Incompressibility of $$H$$ H -Free Edge Modification Problems

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Engineering, Graph Theory, Np-complete Graph Problems +6

On problems without polynomial kernels

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows et al. · Journal of Computer and System Sciences · 2009 · 564 citations

Mathematical Programming, Spectral Theory, Engineering +5

Fixed-parameter tractability of graph modification problems for hereditary properties

Leizhen Cai · Information Processing Letters · 1996 · 374 citations

Mathematical Programming, Engineering, Graph Theory +7

Infeasibility of instance compression and succinct PCPs for NP

Lance Fortnow, Rahul Santhanam · Journal of Computer and System Sciences · 2010 · 281 citations

Engineering, Instance Compression, Computational Complexity +6

Kernel bounds for disjoint cycles and disjoint paths

Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo · Theoretical Computer Science · 2011 · 237 citations

Disjoint Cycles, Graph Theory, Structural Graph Theory +3