15 citations · 56 across the 16 of their papers we have counts for
4 papers · 1 filter
On the tractability of optimization problems on H-graphs
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
For a graph , a graph is an -graph if it is an intersection graph of connected subgraphs of some subdivision of . -graphs naturally generalize several important gra…
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…
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…
An -approximation for covering and packing minor models of
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1
Given two graphs and , we define (resp. ) as the minimum number of vertices (resp. edges) whose removal from produces…