Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

(2022) Yuuki Aoike et al.   THEORY OF COMPUTING SYSTEMS

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems

(2020) Akanksha Agrawal et al.   ACM Transactions on Algorithms

Interval Deletion Is Fixed-Parameter Tractable

(2015) Yixin Cao et al.   ACM Transactions on Algorithms

Chordal Editing is Fixed-Parameter Tractable

(2015) Yixin Cao et al.   ALGORITHMICA

A graph modification approach for finding core–periphery structures in protein interaction networks

(2015) Sharon Bruckner et al.   Algorithms for Molecular Biology

Faster Parameterized Algorithms Using Linear Programming

(2014) Daniel Lokshtanov et al.   ACM Transactions on Algorithms

Faster deterministic Feedback Vertex Set

(2014) Tomasz Kociumaka et al.   INFORMATION PROCESSING LETTERS

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

(2013) Marek Cygan et al.   INFORMATION PROCESSING LETTERS

Proper Interval Vertex Deletion

(2012) Pim van ’t Hof et al.   ALGORITHMICA

Improved upper bounds for vertex cover

(2010) Jianer Chen et al.   THEORETICAL COMPUTER SCIENCE