Similar Items: Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
- Vertex connectivity of the nonzero nonunit core of the comaximal graph of $mathbb Z_n$
- Moderately beyond clique-width: reduced component max-leaf and related parameters
- On the redundancy of transitivity constraints in the clique partitioning problem
- Facial diagrams and cycle double cover
- Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
- Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints