activity
20112026
most citedLinear kernels for edge deletion problems to immersion-closed graph classes

12 citations · 47 across the 20 of their papers we have counts for

collaborators
Showing 2015 · cs.CCShow all

1 paper · 2 filters

cs.CC2015

Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs

Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier

We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems…