Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly

Filter your results

63 Results
Author: personID (integer) : 1082126

Finding Cactus Roots in Polynomial Time

Petr Golovach , Dieter Kratsch , Daniël Paulusma , Anthony Stewart
IWOCA 2016: Combinatorial Algorithms, pp.361-372, 2016, ⟨10.1007/978-3-319-44543-4_28⟩
Book sections hal-03242352v1

Present-biased optimization

Fedor Fomin , Pierre Fraigniaud , Petr Golovach
Mathematical Social Sciences, 2022, 119, pp.56-67. ⟨10.1016/j.mathsocsci.2022.06.001⟩
Journal articles hal-03871448v1

Hadwiger Number of Graphs with Small Chordality

Petr A. Golovach , Pinar Heggernes , Pim van 'T Hof , Christophe Paul
SIAM Journal on Discrete Mathematics, 2015, 29 (3), pp.1427-1451. ⟨10.1137/140975279⟩
Journal articles hal-01263856v1
Image document

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

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
Image document

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
Image document

Pursuing a fast robber on a graph

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Nicolas Nisse , Karol Suchan et al.
Theoretical Computer Science, 2010, 411 (7-9), pp.1167-1181. ⟨10.1016/j.tcs.2009.12.010⟩
Journal articles inria-00476686v1

Enumerating minimal dominating sets in chordal bipartite graphs

Petr A. Golovach , Pinar Heggernes , Mamadou Moustapha Kanté , Dieter Kratsch , Yngve Villanger et al.
Discrete Applied Mathematics, 2016, 199, pp.30--36. ⟨10.1016/j.dam.2014.12.010⟩
Journal articles hal-02083515v1
Image document

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.
CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156, ⟨10.1007/978-3-319-20297-6_10⟩
Conference papers lirmm-01225602v1
Image document

The Parameterized Complexity of Graph Cyclability

Petr A. Golovach , Marcin Kamiski , Spyridon Maniatis , Dimitrios M. Thilikos
ESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩
Conference papers hal-01083993v1
Image document

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
Image document

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

Fedor Fomin , Petr Golovach , Dimitrios M. Thilikos
ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩
Journal articles hal-03389854v2
Image document

Variants of Plane Diameter Completion

Clément Requilé , Dimitrios M. Thilikos , Petr A. Golovach
IPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩
Conference papers lirmm-01225566v1

Finding Cactus Roots in Polynomial Time

Petr Golovach , Dieter Kratsch , Daniël Paulusma , Anthony Stewart
Theory of Computing Systems, 2018, 62 (6), pp.1409-1426. ⟨10.1007/s00224-017-9825-2⟩
Journal articles hal-03242338v1

On the Tractability of Optimization Problems on H-Graphs

Fedor Fomin , Petr Golovach , Jean-Florent Raymond
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
Journal articles hal-03449925v1

Branch and Recharge: Exact algorithms for generalized domination

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
WADS'2007 : 10th Workshop on Algorithms and Data Structures, Aug 2007, Halifax, Canada. pp.507-518, ⟨10.1007/978-3-540-73951-7_44⟩
Conference papers istex hal-00460736v1

Branch and Recharge: Exact Algorithms for Generalized Domination

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
Algorithmica, 2011, 61 (2), pp.252-273. ⟨10.1007/s00453-010-9418-9⟩
Journal articles istex hal-00512289v1

Enumeration and maximum number of minimal dominating sets for chordal graphs

Petr Golovach , Dieter Kratsch , Mathieu Liedloff , Mohamed Yosri Sayadi
Theoretical Computer Science, 2019, 783, pp.41-52. ⟨10.1016/j.tcs.2019.03.017⟩
Journal articles hal-03242334v1

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

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

Fedor V. Fomin , Petr A. Golovach , Dimitrios M. Thilikos
LICS 2021 - 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470540⟩
Conference papers hal-04043100v1

Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds

Petr A. Golovach , Dieter Kratsch , Jean-François Couturier
Graph Theoretic Concepts in Computer Science, pp.39-50, 2010, 978-3-642-16925-0. ⟨10.1007/978-3-642-16926-7_6⟩
Book sections istex hal-02332120v1

Sparse Square Roots

Manfred Cochefert , Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma et al.
Graph-Theoretic Concepts in Computer Science, pp.177-188, 2013, ⟨10.1007/978-3-642-45043-3_16⟩
Book sections hal-02332225v1

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

Increasing the minimum degree of a graph by contractions

Petr A. Golovach , Marcin J. Kamiński , Daniël Paulusma , Dimitrios M. Thilikos
Theoretical Computer Science, 2013, 481, pp.74-84. ⟨10.1016/j.tcs.2013.02.030⟩
Journal articles lirmm-00804766v1

Sort and search: Exact algorithms for generalized domination

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
Information Processing Letters, 2009, 109 (14), pp.795-798. ⟨10.1016/j.ipl.2009.03.023⟩
Journal articles hal-00460850v1

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

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 of Discrete Algorithms, 2012, 15, pp.56-62. ⟨10.1016/j.jda.2012.04.008⟩
Journal articles hal-02332177v1

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.
WG 2017: Graph-Theoretic Concepts in Computer Science, pp.275-288, 2017, ⟨10.1007/978-3-319-68705-6_21⟩
Book sections hal-03242359v1

Enumeration of Maximal Irredundant Sets for Claw-Free Graphs

Petr Golovach , Dieter Kratsch , Mohamed Yosri Sayadi
CIAC 2017: Algorithms and Complexity, pp.297-309, 2017, ⟨10.1007/978-3-319-57586-5_25⟩
Book sections hal-03242341v1
Image document

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