12 citations · 47 across the 20 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 12 cited
Linear kernels for edge deletion problems to immersion-closed graph classes
Archontia C. Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos +2
Suppose is a finite family of graphs. We consider the following meta-problem, called -Immersion Deletion: given a graph and integer , decide wheth…
cs.DS2016
Cutwidth: obstructions and algorithmic aspects
Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond +2
Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a linear manner, so that the maximum number of edges betw…