Similar Items: Moderately beyond clique-width: reduced component max-leaf and related parameters
- On the redundancy of transitivity constraints in the clique partitioning problem
- Cuts and Gauges for Submodular Width
- Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
- Most ReLU Networks Admit Identifiable Parameters
- Flow Shop Scheduling with Stochastic Reentry
- Dirac's theorem and the switch geometry of perfect matchings