12 citations · 47 across the 20 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
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…
cs.DS2015★ 8 cited
Uniform Kernelization Complexity of Hitting Forbidden Minors
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov +1
The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph…