Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Labourel, Arnaud"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fault-tolerant rendezvous in networks
Jérémie Chalopin
,
Yoann Dieudonné
,
Arnaud Labourel
,
Andrzej Pelc
Lecture Notes in Computer Science
8573
, 2014, pp. 411-422
Retracts of products of chordal graphs
Bos̑tjan Bres̑ar
,
Jérémie Chalopin
,
Victor Chepoi
,
Matjaz̑ Kovs̑e
,
Arnaud Labourel
,
Yann Vaxès
Journal of Graph Theory
73
(2), 2013, pp. 161-180
Tight bounds for black hole search with scattered agents in synchronous rings
Jérémie Chalopin
,
Shantanu Das
,
Arnaud Labourel
,
Euripides Markou
Theoretical Computer Science
509
, 2013, pp. 70-85
Worst-case optimal exploration of terrains with obstacles
Jurek Czyzowicz
,
David Ilcinkas
,
Arnaud Labourel
,
Andrzej Pelc
Information and Computation
225
, 2013, pp. 16-28
Asynchronous deterministic rendezvous in bounded terrains
Jurek Czyzowicz
,
David Ilcinkas
,
Arnaud Labourel
,
Andrzej Pelc
Theoretical Computer Science
412
(50), 2011, pp. 6926-6937
Optimality and competitiveness of exploring polygons by mobile robots
Jurek Czyzowicz
,
Arnaud Labourel
,
Andrzej Pelc
Information and Computation
209
(1), 2011, pp. 74-88
Tell me where I am so I can meet you sooner - (Asynchronous rendezvous with location information)
Andrew Collins
,
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Arnaud Labourel
Lecture Notes in Computer Science
6199
, 2010, pp. 502-514
Optimal exploration of terrains with obstacles
Jurek Czyzowicz
,
David Ilcinkas
,
Arnaud Labourel
,
Andrzej Pelc
Lecture Notes in Computer Science
6139
, 2010, pp. 1-12
Optimality and competitiveness of exploring polygons by mobile robots
Jurek Czyzowicz
,
Arnaud Labourel
,
Andrzej Pelc
Lecture Notes in Computer Science
5757
, 2009, pp. 263-274
On induced-universal graphs for the class of bounded-degree graphs
Louis Esperet
,
Arnaud Labourel
,
Pascal Ochem
Information Processing Letters
108
(5), 2008, pp. 255-260
Shorter implicit representation for planar graphs and bounded treewidth graphs
Cyril Gavoille
,
Arnaud Labourel
Lecture Notes in Computer Science
4698
, 2007, pp. 582-593
Distributed relationship schemes for trees
Cyril Gavoille
,
Arnaud Labourel
Lecture Notes in Computer Science
4835
, 2007, pp. 728-738