| * | 2009 |
|---|
| 9 | EE | Jurek Czyzowicz,
Arnaud Labourel,
Andrzej Pelc:
Optimality and Competitiveness of Exploring Polygons by Mobile Robots.
ESA 2009: 263-274 |
| 2008 |
|---|
| 8 | EE | Arnaud Labourel:
On Universal Graphs of Minor Closed Families.
Electronic Notes in Discrete Mathematics 31: 85-89 (2008) |
| 7 | EE | Louis Esperet,
Arnaud Labourel,
Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs.
Inf. Process. Lett. 108(5): 255-260 (2008) |
| 2007 |
|---|
| 6 | EE | Cyril Gavoille,
Arnaud Labourel:
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs.
ESA 2007: 582-593 |
| 5 | EE | Cyril Gavoille,
Arnaud Labourel:
Distributed Relationship Schemes for Trees.
ISAAC 2007: 728-738 |
| 4 | EE | Cyril Gavoille,
Arnaud Labourel:
On local representation of distances in trees.
PODC 2007: 352-353 |
| 3 | EE | Nicolas Bonichon,
Cyril Gavoille,
Arnaud Labourel:
Short Labels by Traversal and Jumping.
Electronic Notes in Discrete Mathematics 28: 153-160 (2007) |
| 2006 |
|---|
| 2 | EE | Nicolas Bonichon,
Cyril Gavoille,
Arnaud Labourel:
Short Labels by Traversal and Jumping.
SIROCCO 2006: 143-156 |
| 2005 |
|---|
| 1 | EE | Nicolas Bonichon,
Cyril Gavoille,
Arnaud Labourel:
Edge Partition of Toroidal Graphs into Forests in Linear Time.
Electronic Notes in Discrete Mathematics 22: 421-425 (2005) |
