Similar Items: The Gallai Vertex Problem is $Θ_2^p$-Complete
- Local Homophily on Bicolored Graphs is $mathbf{P}$-complete
- Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
- Feedback vertex sets of planar digraphs with fixed digirth
- Vertex connectivity of the nonzero nonunit core of the comaximal graph of $mathbb Z_n$
- Completely Independent Steiner Trees
- Tree-independence number of $P_5$-free graphs with no large bicliques