Chapter 1 Gregory Gutin and Graph Optimization Problems

Chapter 2 On Graphs Whose Maximal Cliques and Stable Sets Intersect

Chapter 4 Optimal Factorization of Operators by Operators That Are Consistent with the Graph’s Structure

Chapter 5 Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results

Chapter 6 Dominance Certificates for Combinatorial Optimization Problems

Chapter 7 Conditional Markov Chain Search for the Simple Plant Location Problem Improves Upper Bounds on Twelve Körkel–Ghosh Instances

Chapter 8 An Algorithmic Answer to the Ore-Type Version of Dirac’s Question on Disjoint Cycles

Chapter 9 Combinatorial and Graph-Theoretical Problems and Augmenting Technique

Chapter 10 Optimal Patrol on a Graph Against Random and Strategic Attackers

Chapter 11 Network Design Problem with Cut Constraints

Chapter 12 Process Sequencing Problem in Distributed Manufacturing Process Planning

Chapter 13 Sharp Nordhaus–Gaddum-Type Lower Bounds for Proper Connection Numbers of Graphs