Similar Items: Computational and Combinatorial Results on Conflict-free Choosability
- Mutation-Guided Differentiable Quadratic Combinatorial Optimization
- A Combinatorial Framework for the Pons-Batle Identity: Young Tableaux, Lattice Paths, and Limit Laws
- Tree-independence number of $P_5$-free graphs with no large bicliques
- Flow Shop Scheduling with Stochastic Reentry
- Dirac's theorem and the switch geometry of perfect matchings
- Moderately beyond clique-width: reduced component max-leaf and related parameters