Similar Items: On the redundancy of transitivity constraints in the clique partitioning problem
- Moderately beyond clique-width: reduced component max-leaf and related parameters
- Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints
- Approximating the Network Design Problem for Potential-Based Flows
- Improving SAT Solvers on Orthogonal Latin Square Problems
- More on the ErdH os--Kleitman problem on matchings in set families
- Flow Shop Scheduling with Stochastic Reentry