Orthogonal Drawings Based On The Stratification Of Planar Graphs. - Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah 001 (Electron. Notes Discret. Math., 2000)

Wagner's Theorem on Realizers. - Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah 001 (ICALP, 2002)

Optimal Area Algorithm for Planar Polyline Drawings. - Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah 001 (WG, 2002)

Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. (Algorithmic and combinatorial aspects of maximal plane graphs realizers). - Nicolas Bonichon (2002)

An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (STACS, 2003)

Watermelon uniform random generation with applications. - Nicolas Bonichon; Mohamed Mosbah 001 (Theor. Comput. Sci., 2003)

A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. - Nicolas Bonichon (Discret. Math., 2005)

Edge Partition of Toroidal Graphs into Forests in Linear Time. - Nicolas Bonichon; Cyril Gavoille; Arnaud Labourel (Electron. Notes Discret. Math., 2005)

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (J. Graph Algorithms Appl., 2005)

Planar Graphs, via Well-Orderly Maps and Trees. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Dominique Poulalhon; Gilles Schaeffer (Graphs Comb., 2006)

Convex Drawings of 3-Connected Plane Graphs. - Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah 001 (Algorithmica, 2007)

Short Labels by Traversal and Jumping. - Nicolas Bonichon; Cyril Gavoille; Arnaud Labourel (Electron. Notes Discret. Math., 2007)

Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois (IPDPS, 2008)

A Distributed Algorithm for Resource Clustering in Large Scale Platforms. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Lionel Eyraud-Dubois; Hubert Larchevêque (OPODIS, 2008)

Distributed Approximation Algorithm for Resource Clustering. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Hubert Larchevêque (SIROCCO, 2008)

Baxter permutations and plane bipolar orientations. - Nicolas Bonichon; Mireille Bousquet-Mélou; Éric Fusy (Electron. Notes Discret. Math., 2008)

Intervals in Catalan lattices and realizers of triangulations. - Olivier Bernardi; Nicolas Bonichon (J. Comb. Theory A, 2009)

Plane Spanners of Maximum Degree Six. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ICALP (1), 2010)

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; David Ilcinkas (WG, 2010)

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (Towards an Information Theory of Complex Networks, 2011)

Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois; Przemyslaw Uznanski (ICPADS, 2011)

Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks. - Olivier Beaumont; Nicolas Bonichon; Hubert Larchevêque (ICPP, 2011)

Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Hubert Larchevêque (IPDPS Workshops, 2011)

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ESA, 2012)

Mixed Data-Parallel Scheduling for Distributed Continuous Integration. - Olivier Beaumont; Nicolas Bonichon; Ludovic Courtès; Eelco Dolstra; Xavier Hanin (IPDPS Workshops, 2012)

Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois; Loris Marchal (IPDPS, 2012)

The Stretch Factor of L1- and L∞-Delaunay Triangulations - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (CoRR, 2012)

Quelques algorithmes entre le monde des graphes et les nuages de points. - Nicolas Bonichon (2013)

There are Plane Spanners of Maximum Degree 4. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SoCG, 2014)

Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois; Przemyslaw Uznanski; Shailesh Kumar Agrawal (IEEE Trans. Parallel Distributed Syst., 2014)

Rook-Drawing for Plane Graphs. - David Auber; Nicolas Bonichon; Paul Dorbec; Claire Pennarun (GD, 2015)

Tight stretch factors for L1- and L∞-Delaunay triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (Comput. Geom., 2015)

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (CoRR, 2015)

There are Plane Spanners of Degree 4 and Moderate Stretch Factor. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (Discret. Comput. Geom., 2015)

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. - Nicolas Bonichon; Prosenjit Bose; Paz Carmi; Irina Kostitsyna; Anna Lubiw; Sander Verdonschot (GD, 2016)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (Discret. Comput. Geom., 2017)

On the number of planar Eulerian orientations. - Nicolas Bonichon; Mireille Bousquet-Mélou; Paul Dorbec; Claire Pennarun (Eur. J. Comb., 2017)

Rook-drawings of Plane Graphs. - David Auber; Nicolas Bonichon; Paul Dorbec; Claire Pennarun (J. Graph Algorithms Appl., 2017)

A Bijection for Essentially 4-Connected Toroidal Triangulations. - Nicolas Bonichon; Benjamin Lévêque (Electron. J. Comb., 2019)

A bijection for essentially 3-connected toroidal maps. - Nicolas Bonichon; Éric Fusy; Benjamin Lévêque (Eur. J. Comb., 2021)

Local Routing Algorithms on Euclidean Spanners with Small Diameter. - Nicolas Bonichon; Prosenjit Bose; Yan Garito (LATIN, 2022)

Improved Routing on the Delaunay Triangulation. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Vincent Despré; Darryl Hill; Michiel Smid (Discret. Comput. Geom., 2023)

Euclidean Freeze-Tag Problem on Plane. - Saeed Odak; Cyril Gavoille; Nicolas Bonichon; Nicolas Hanusse (CCCG, 2024)

Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (DISC, 2024)

Freeze-Tag in L1 has Wake-up Time Five. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (CoRR, 2024)