Breaking the $2^n$-barrier for Irredundance: Two lines of attack
Daniel Binkele-Raible
,
Ljiljana Brankovic
,
Marek Cygan
,
Henning Fernau
,
Joachim Kneis
,
et al.
Journal of Discrete Algorithms , 2011, 9 (3), pp.214-230
Article dans une revue
hal-00607123v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact exponential algorithms to find tropical connected sets of minimum size
Mathieu Chapelle
,
Manfred Cochefert
,
Dieter Kratsch
,
Romain Letourneur
,
Mathieu Liedloff
Article dans une revue
hal-01971120v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Guest Editorial: Selected Papers from WG 2014
Dieter Kratsch
,
Ioan Todinca
Article dans une revue
hal-03242344v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
Dieter Kratsch
,
Fedor V. Fomin
,
Ioan Todinca
2004, pp.568-580
Communication dans un congrès
hal-00085561v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact Algorithms for Treewidth and Minimum Fill-In
Fedor V. Fomin
,
Dieter Kratsch
,
Ioan Todinca
,
Yngve Villanger
Article dans une revue
hal-00462391v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
End-Vertices of Graph Search Algorithms
Dieter Kratsch
,
Mathieu Liedloff
,
Daniel Meister
Communication dans un congrès
hal-01216950v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
Jean-François Couturier
,
Pinar Heggernes
,
Pim Van’t Hof
,
Dieter Kratsch
Chapitre d'ouvrage
istex
hal-02332165v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Enumerating minimal dominating sets in chordal bipartite graphs
Petr A. Golovach
,
Pinar Heggernes
,
Mamadou Moustapha Kanté
,
Dieter Kratsch
,
Yngve Villanger
Article dans une revue
hal-02083515v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size
Mathieu Chapelle
,
Manfred Cochefert
,
Dieter Kratsch
,
Romain Letourneur
,
Mathieu Liedloff
Communication dans un congrès
hal-01105083v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Preface: Special graph classes and algorithms–in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday
Feodor Dragan
,
Dieter Kratsch
,
van Bang Le
Article dans une revue
hal-03242339v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Finding Cactus Roots in Polynomial Time
Petr Golovach
,
Dieter Kratsch
,
Daniël Paulusma
,
Anthony Stewart
Chapitre d'ouvrage
hal-03242352v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact Algorithms for Dominating Set
Dieter Kratsch
Chapitre d'ouvrage
hal-03242354v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact algorithms for $L(2,1)$-labeling of graphs
Frédéric Havet
,
Martin Klazar
,
Jan Kratochvil
,
Dieter Kratsch
,
Matthieu Liedloff
[Research Report] RR-6587, INRIA. 2008
Rapport
inria-00303330v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms
Christian Komusiewicz
,
Dieter Kratsch
,
van Bang Le
Article dans une revue
hal-03242330v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
An Exact Algorithm for the Minimum Dominating Clique Problem
Dieter Kratsch
,
Mathieu Liedloff
IWPEC'2006 : 2nd International Workshop on Parameterized and Exact Computation , Sep 2006, Zürich, Switzerland. pp.130-141,
⟨10.1007/11847250_12⟩
Communication dans un congrès
istex
hal-00460727v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Exact Algorithms for Weak Roman Domination
Mathieu Chapelle
,
Manfred Cochefert
,
Jean-François Couturier
,
Dieter Kratsch
,
Mathieu Liedloff
,
et al.
Communication dans un congrès
istex
hal-00848454v1
Actions
Partager
Gmail
Facebook
X
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
Communication dans un congrès
hal-01971051v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Tree-Visibility Orders
Dieter Kratsch
,
Jean-Xavier Rampon
[Research Report] RR-2683, INRIA. 1995
Rapport
inria-00074008v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Sparse Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Chapitre d'ouvrage
hal-02332225v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
Petr A. Golovach
,
Dieter Kratsch
,
Jean-François Couturier
Chapitre d'ouvrage
istex
hal-02332120v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
Jean-François Couturier
,
Pinar Heggernes
,
Pim van ’t Hof
,
Dieter Kratsch
Article dans une revue
hal-02332232v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Sort and search: Exact algorithms for generalized domination
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvil
,
Dieter Kratsch
,
Mathieu Liedloff
Article dans une revue
istex
hal-00460850v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On Independent Sets and Bicliques in Graphs
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
WG'08: 34th International Workshop on Graph-Theoretic Concepts in Computer Science , Jun 2008, Durham, United Kingdom. pp.171-182,
⟨10.1007/978-3-540-92248-3_16⟩
Communication dans un congrès
istex
hal-00460773v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On treewidth approximations
Vincent Bouchitté
,
Dieter Kratsch
,
Haiko Müller
,
Ioan Todinca
Discrete Applied Mathematics , 2004, 136, pp.183-196
Article dans une revue
hal-00085459v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Petr A. Golovach
,
Pinar Heggernes
,
Mamadou Moustapha Kanté
,
Dieter Kratsch
,
Sigve Sæther
,
et al.
Article dans une revue
hal-02083480v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
A linear kernel for finding square roots of almost planar graphs
Petr Golovach
,
Dieter Kratsch
,
Daniël Paulusma
,
Anthony Stewart
Article dans une revue
hal-03242340v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
Petr Golovach
,
Dieter Kratsch
,
Mohamed Yosri Sayadi
Chapitre d'ouvrage
hal-03242341v1
Actions
Partager
Gmail
Facebook
X
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
Chapitre d'ouvrage
hal-03242359v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Frank von Der Kammer
,
Dieter Kratsch
,
Moritz Laudahn
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , 2016, Krakow, Poland. pp.56:1--56:14
Communication dans un congrès
hal-03242367v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
An exact algorithm for the Maximum Leaf Spanning Tree problem
Henning Fernau
,
Joachim Kneis
,
Dieter Kratsch
,
Alexander Langer
,
Mathieu Liedloff
,
et al.
Article dans une revue
hal-00942908v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More