Finding odd cycle transversals

By Bruce A. Reed, Kaleigh Smith, Adrian R. Vetta. Operations Research Letters, 2004

399 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/8dc6ad16acf086efdda2e22622b1630ec237f253

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Marek Cygan
2. Daniel Marx
3. Jesper Nederlof

In Electrical and Electronic Engineering

1. Daniel Marx

Citations in the corpus

• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (2011, positive): “For this we will combine the Cut & Count approach with iterative compression [38].”
• (Meta) Kernelization (2009, neutral): “These include Directed Feedback Vertex Set [18], and Odd Cycle Transversal [50] to name a few.”
• Parameterized Complexity and Approximation Algorithms (2008, background): “” It turns out that for certain minimization problems if we can solve the compression problem, then we can solve the search problem as well by iteratively solving larger and larger problems [101, 34, 85, 62, 63, 88].”