„Graph modification problems“

Suchergebnisse

30 Treffer

• Modification to Planarity is Fixed Parameter Tractable
  Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
  Fluschnik, Till ; Hermelin, Danny ; Nichterlein, André ; Niedermeier, Rolf 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Variants of Plane Diameter Completion
  Golovach, Petr A. ; Requilé, Clément ; Thilikos, Dimitrios M. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Chordal Editing is Fixed-Parameter Tractable
  Cao, Yixin ; Marx, Dániel 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Obtaining a Bipartite Graph by Contracting Few Edges
  Heggernes, Pinar ; van 't Hof, Pim ; Lokshtanov, Daniel ; Paul, Christophe 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph Modification Problems (Dagstuhl Seminar 14071)
  Bodlaender, Hans L. ; Heggernes, Pinar ; Lokshtanov, Daniel
• Faster parameterized algorithms for modification problems to minor-closed classes
  Morelle, Laure ; Sau, Ignasi ; Stamoulis, Giannos ; Thilikos, Dimitrios M.
• Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
  Gramm, Jens ; Guo, Jiong ; Hüffner, Falk ; Niedermeier, Rolf
• Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
  Foucaud, Florent ; Hocquard, Hervé ; Lajou, Dimitri ; Mitsou, Valia ; Pierron, Théo
• Algorithm design techniques for parameterized graph modification problems
  Guo, Jiong