Faster Parameterized Algorithms for Deletion to Split Graphs

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

On the hardness of approximating minimization problems

Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text

Computing, Computer Science, Algorithms +5

The node-deletion problem for hereditary properties is NP-complete

John M. Lewis, Mihalis Yannakakis · Journal of Computer and System Sciences · 1980 · 516 citations

Natural Sciences, Genetics, Data Structures +6

Fixed-parameter tractability of graph modification problems for hereditary properties

Leizhen Cai · Information Processing Letters · 1996 · 375 citations

Computing, Genetics, Formal Methods +8

Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs

Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi et al. · Journal of the ACM · 2005 · 331 citations

Computing, Computer Science, Mathematics +13