Similar Items: Flow Shop Scheduling with Stochastic Reentry
- Approximating the Network Design Problem for Potential-Based Flows
- Dirac's theorem and the switch geometry of perfect matchings
- Moderately beyond clique-width: reduced component max-leaf and related parameters
- Completely Independent Steiner Trees
- On Threshold Compatibility Graphs
- A hierarchy of edge-weight symmetries in perfect matchings