目录
- A Note on Preemptive Scheduling with Multiple Maintenance Activities to Minimize the Total Late Work
- A Sufficient Condition for Networks to be n-Neighbor d-Diagnosable under the Comparison Model
- Ergodicity of Bandwidth and Cutwidth on Families of Graphs and Trees
- Forming a Critical Tree with Cutwidth k
- Induced Matching-Extendability of Halin Graphs
- Independent Roman {2}-Domination in Trees
- A Note on Two-Agent Scheduling with Rejection on a Single Machine
- Online Parallel-Batch Machines Scheduling with a Single Server
- A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs
- Research on Unbounded Parallel-Batch Scheduling with Jobs Having Set-Up Times
- A Note on the Girth of 3-Regular Hamiltonian Graph
- Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs
- Profile of Mr.Yixun Lin