30 citations · 157 across the 83 of their papers we have counts for
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019
Finding irrelevant vertices in linear time on bounded-genus graphs
Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis +1
The irrelevant vertex technique provides a powerful tool for the design of parameterized algorithms for a wide variety of problems on graphs. A common characteristic of these probl…
cs.DS2019
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a fixed finite collection of graphs , the -M-DELETION problem asks, given an -vertex input graph for the minimum number of vertices that intersect a…
cs.DS2019
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
For a finite collection of graphs , the \textsc{-TM-Deletion} problem has as input an -vertex graph and an integer and asks whether there exists a se…