Finding Cactus Roots in Polynomial Time
Petr Golovach
,
Dieter Kratsch
,
Daniël Paulusma
,
Anthony Stewart
Book sections
hal-03242352v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Present-biased optimization
Fedor Fomin
,
Pierre Fraigniaud
,
Petr Golovach
Journal articles
hal-03871448v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Hadwiger Number of Graphs with Small Chordality
Petr A. Golovach
,
Pinar Heggernes
,
Pim van 'T Hof
,
Christophe Paul
Journal articles
hal-01263856v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Hitting topological minor models in planar graphs is fixed parameter tractable
Petr A. Golovach
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms , Jan 2020, Salt Lake City, UT, United States. pp.931-950,
⟨10.1137/1.9781611975994.56⟩
Conference papers
hal-03003167v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Coloring Graphs Characterized by a Forbidden Subgraph
Petr A. Golovach
,
Daniel Paulusma
,
Bernard Ries
37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012 , Aug 2012, Bratislava, Slovakia. pp.443-454,
⟨10.1007/978-3-642-32589-2_40⟩
Conference papers
hal-01509549v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
Fedor Fomin
,
Petr Golovach
,
Dimitrios M. Thilikos
Graph-Theoretic Concepts in Computer Science , 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science,
⟨10.1007/978-3-030-86838-3_24⟩
Book sections
hal-03390090v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Pursuing a fast robber on a graph
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvil
,
Nicolas Nisse
,
Karol Suchan
et al.
Journal articles
inria-00476686v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumerating minimal dominating sets in chordal bipartite graphs
Petr A. Golovach
,
Pinar Heggernes
,
Mamadou Moustapha Kanté
,
Dieter Kratsch
,
Yngve Villanger
et al.
Journal articles
hal-02083515v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Editing to a Planar Graph of Given Degrees
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim Van'T Hof
,
Daniël Paulusma
,
Dimitrios M. Thilikos
et al.
Conference papers
lirmm-01225602v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
The Parameterized Complexity of Graph Cyclability
Petr A. Golovach
,
Marcin Kamiski
,
Spyridon Maniatis
,
Dimitrios M. Thilikos
Conference papers
hal-01083993v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Complexity of Connected Even/Odd Subgraph Problems
Fedor V. Fomin
,
Petr A. Golovach
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) , Feb 2012, Paris, France. pp.432-440
Conference papers
hal-00678168v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Complexity of Elimination Distance to First-Order Logic Properties
Fedor Fomin
,
Petr Golovach
,
Dimitrios M. Thilikos
Journal articles
hal-03389854v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Variants of Plane Diameter Completion
Clément Requilé
,
Dimitrios M. Thilikos
,
Petr A. Golovach
Conference papers
lirmm-01225566v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Finding Cactus Roots in Polynomial Time
Petr Golovach
,
Dieter Kratsch
,
Daniël Paulusma
,
Anthony Stewart
Journal articles
hal-03242338v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Tractability of Optimization Problems on H-Graphs
Fedor Fomin
,
Petr Golovach
,
Jean-Florent Raymond
Journal articles
hal-03449925v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Branch and Recharge: Exact algorithms for generalized domination
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvil
,
Dieter Kratsch
,
Mathieu Liedloff
et al.
Conference papers
istex
hal-00460736v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Branch and Recharge: Exact Algorithms for Generalized Domination
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvil
,
Dieter Kratsch
,
Mathieu Liedloff
et al.
Journal articles
istex
hal-00512289v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumeration and maximum number of minimal dominating sets for chordal graphs
Petr Golovach
,
Dieter Kratsch
,
Mathieu Liedloff
,
Mohamed Yosri Sayadi
Journal articles
hal-03242334v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Cyclability in Graph Classes
Christophe Crespelle
,
Carl Feghali
,
Petr A. Golovach
30th International Symposium on Algorithms and Computation, ISAAC 2019 , Dec 2019, Shanghai, China
Conference papers
hal-02523719v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Complexity of Elimination Distance to First-Order Logic Properties
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
Conference papers
hal-04043100v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
Petr A. Golovach
,
Dieter Kratsch
,
Jean-François Couturier
Book sections
istex
hal-02332120v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Sparse Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
Book sections
hal-02332225v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs
Petr A. Golovach
,
Dieter Kratsch
,
Mathieu Liedloff
,
Mohamed Yosri Sayadi
International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017) , Jun 2017, Eindhoven, Netherlands. pp.289-302
Conference papers
hal-01971051v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Increasing the minimum degree of a graph by contractions
Petr A. Golovach
,
Marcin J. Kamiński
,
Daniël Paulusma
,
Dimitrios M. Thilikos
Journal articles
lirmm-00804766v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Sort and search: Exact algorithms for generalized domination
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvil
,
Dieter Kratsch
,
Mathieu Liedloff
et al.
Journal articles
hal-00460850v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Acyclic, Star, and Injective Colouring: Bounding the Diameter
Christoph Brause
,
Petr Golovach
,
Barnaby Martin
,
Pascal Ochem
,
Daniël Paulusma
et al.
The Electronic Journal of Combinatorics , 2022, 29 (2), pp.#P2.43.
⟨10.37236/10738⟩
Journal articles
lirmm-03799962v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the parameterized complexity of coloring graphs in the absence of a linear forest
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Journal articles
hal-02332177v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
Petr Golovach
,
Pinar Heggernes
,
Dieter Kratsch
,
Paloma Lima
,
Daniël Paulusma
et al.
Book sections
hal-03242359v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
Petr Golovach
,
Dieter Kratsch
,
Mohamed Yosri Sayadi
Book sections
hal-03242341v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Algorithms for Finding Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
2019
Preprints, Working Papers, ...
hal-02332212v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More