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

Filter your results

11 Results
Author: personID (integer) : 867667

Determining the L(2, 1)-span in polynomial space

Konstanty Junosza-Szaniawski , Jan Kratochvil , Mathieu Liedloff , Pawel Rzazewski
Discrete Applied Mathematics, 2013, 161 (13-14), pp.2052-2061. ⟨10.1016/j.dam.2013.03.027⟩
Journal articles hal-00942922v1

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

Fast Exact Algorithm for L(2,1)-Labeling of Graphs

Konstanty Junosza-Szaniawski , Jan Kratochvil , Mathieu Liedloff , Peter Rossmanith , Pawel Rzazewski et al.
TAMC 2011 : Theory and Applications of Models of Computation - 8th Annual Conference, May 2011, Tokyo, Japan. pp.82-93, ⟨10.1007/978-3-642-20877-5_9⟩
Conference papers hal-00607169v1
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

Determining the L(2,1)-Span in Polynomial Space

Konstanty Junosza-Szaniawski , Jan Kratochvil , Mathieu Liedloff , Pawel Rzazewski
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, 2012, Israel. pp.126-137, ⟨10.1007/978-3-642-34611-8_15⟩
Conference papers hal-00942928v1

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

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

Steven Chaplick , Paul Dorbec , Jan Kratochvil , Mickaël Montassier , Juraj Stacho et al.
WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151, ⟨10.1007/978-3-319-12340-0_12⟩
Conference papers lirmm-01264271v1

Exact Algorithms for L(2,1)-Labeling of Graphs

Frédéric Havet , Martin Klazar , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
Algorithmica, 2011, 59 (2), pp.169-194. ⟨10.1007/s00453-009-9302-7⟩
Journal articles hal-00460873v1

Fast exact algorithm for L(2,1)-labeling of graphs

Konstanty Junosza-Szaniawski , Jan Kratochvil , Mathieu Liedloff , Peter Rossmanith , Pawel Rzazewski et al.
Theoretical Computer Science, 2013, 505, pp.42-54. ⟨10.1016/j.tcs.2012.06.037⟩
Journal articles hal-00942917v1

Exact Algorithms for L(2,1)-Labeling of Graphs

Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff
MFCS'2007 : 32nd International Symposium on Mathematical Foundations of Computer Science, Aug 2007, Cesky Krumlov, Czech Republic. pp.513-524, ⟨10.1007/978-3-540-74456-6_46⟩
Conference papers hal-00460771v1