| 2009 |
| 21 | EE | Olivier Bernardi,
Nicolas Bonichon:
Intervals in Catalan lattices and realizers of triangulations.
J. Comb. Theory, Ser. A 116(1): 55-75 (2009) |
| 2008 |
| 20 | EE | Olivier Beaumont,
Nicolas Bonichon,
Lionel Eyraud-Dubois:
Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model.
IPDPS 2008: 1-7 |
| 19 | EE | Olivier Beaumont,
Nicolas Bonichon,
Philippe Duchon,
Lionel Eyraud-Dubois,
Hubert Larchevêque:
A Distributed Algorithm for Resource Clustering in Large Scale Platforms.
OPODIS 2008: 564-567 |
| 18 | EE | Olivier Beaumont,
Nicolas Bonichon,
Philippe Duchon,
Hubert Larchevêque:
Distributed Approximation Algorithm for Resource Clustering.
SIROCCO 2008: 61-73 |
| 17 | EE | Nicolas Bonichon,
Mireille Bousquet-Mélou,
Éric Fusy:
Baxter permutations and plane bipolar orientations.
Electronic Notes in Discrete Mathematics 31: 69-74 (2008) |
| 2007 |
| 16 | EE | Nicolas Bonichon,
Stefan Felsner,
Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs.
Algorithmica 47(4): 399-420 (2007) |
| 15 | EE | Nicolas Bonichon,
Cyril Gavoille,
Arnaud Labourel:
Short Labels by Traversal and Jumping.
Electronic Notes in Discrete Mathematics 28: 153-160 (2007) |
| 2006 |
| 14 | EE | Nicolas Bonichon,
Cyril Gavoille,
Arnaud Labourel:
Short Labels by Traversal and Jumping.
SIROCCO 2006: 143-156 |
| 13 | EE | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse,
Dominique Poulalhon,
Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees.
Graphs and Combinatorics 22(2): 185-202 (2006) |
| 2005 |
| 12 | EE | Nicolas Bonichon:
A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths.
Discrete Mathematics 298(1-3): 104-114 (2005) |
| 11 | 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) |
| 10 | EE | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.
J. Graph Algorithms Appl. 9(2): 185-204 (2005) |
| 2004 |
| 9 | EE | Nicolas Bonichon,
Stefan Felsner,
Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs.
Graph Drawing 2004: 60-70 |
| 8 | EE | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse,
Dominique Poulalhon,
Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees.
WG 2004: 270-284 |
| 7 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Orthogonal drawings based on the stratification of planar graphs.
Discrete Mathematics 276(1-3): 43-57 (2004) |
| 2003 |
| 6 | EE | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.
STACS 2003: 499-510 |
| 5 | EE | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.
WG 2003: 81-92 |
| 4 | EE | Nicolas Bonichon,
Mohamed Mosbah:
Watermelon uniform random generation with applications.
Theor. Comput. Sci. 307(2): 241-256 (2003) |
| 2002 |
| 3 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Wagner's Theorem on Realizers.
ICALP 2002: 1043-1053 |
| 2 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Optimal Area Algorithm for Planar Polyline Drawings.
WG 2002: 35-46 |
| 2000 |
| 1 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs.
Electronic Notes in Discrete Mathematics 5: 35-37 (2000) |