Nicolas Bonichon

According to our database, Nicolas Bonichon authored at least 43 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Freeze-Tag in L₁ has Wake-up Time Five.

Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse

CoRR, 2024

2023

Improved Routing on the Delaunay Triangulation.

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid

Discret. Comput. Geom., October, 2023

2022

Local Routing Algorithms on Euclidean Spanners with Small Diameter.

Nicolas Bonichon, Prosenjit Bose, Yan Garito

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

A bijection for essentially 3-connected toroidal maps.

Nicolas Bonichon, Éric Fusy, Benjamin Lévêque

Eur. J. Comb., 2021

2019

A Bijection for Essentially 4-Connected Toroidal Triangulations.

Nicolas Bonichon, Benjamin Lévêque

Electron. J. Comb., 2019

2017

Rook-drawings of Plane Graphs.

David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun

J. Graph Algorithms Appl., 2017

On the number of planar Eulerian orientations.

Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun

Eur. J. Comb., 2017

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

2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

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

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

Tight stretch factors for L₁- and L_∞-Delaunay triangulations.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Comput. Geom., 2015

Rook-Drawing for Plane Graphs.

David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

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

There are Plane Spanners of Maximum Degree 4.

Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Quelques algorithmes entre le monde des graphes et les nuages de points.

Nicolas Bonichon

, 2013

2012

The Stretch Factor of L₁- and L_∞-Delaunay Triangulations

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

CoRR, 2012

Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling.

Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Loris Marchal

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Mixed Data-Parallel Scheduling for Distributed Continuous Integration.

Olivier Beaumont, Nicolas Bonichon, Ludovic Courtès, Eelco Dolstra, Xavier Hanin

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Proceedings of the Algorithms - ESA 2012, 2012

2011

Use of Internet Embedding Tools for Heterogeneous Resources Aggregation.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks.

Olivier Beaumont, Nicolas Bonichon, Hubert Larchevêque

Proceedings of the International Conference on Parallel Processing, 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

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse

Proceedings of the Towards an Information Theory of Complex Networks, 2011

2010

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Plane Spanners of Maximum Degree Six.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Intervals in Catalan lattices and realizers of triangulations.

Olivier Bernardi, Nicolas Bonichon

J. Comb. Theory, Ser. A, 2009

2008

Baxter permutations and plane bipolar orientations.

Nicolas Bonichon, Mireille Bousquet-Mélou, Éric Fusy

Electron. Notes Discret. Math., 2008

Distributed Approximation Algorithm for Resource Clustering.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque

Proceedings of the Structural Information and Communication Complexity, 2008

A Distributed Algorithm for Resource Clustering in Large Scale Platforms.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model.

Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007

Short Labels by Traversal and Jumping.

Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel

Electron. Notes Discret. Math., 2007

Convex Drawings of 3-Connected Plane Graphs.

Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah

Algorithmica, 2007

2006

Planar Graphs, via Well-Orderly Maps and Trees.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer

Graphs Comb., 2006

2005

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse

J. Graph Algorithms Appl., 2005

Edge Partition of Toroidal Graphs into Forests in Linear Time.

Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel

Electron. Notes Discret. Math., 2005

A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths.

Nicolas Bonichon

Discret. Math., 2005

2003

Watermelon uniform random generation with applications.

Nicolas Bonichon, Mohamed Mosbah

Theor. Comput. Sci., 2003

An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

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

Nicolas Bonichon

PhD thesis, 2002

Optimal Area Algorithm for Planar Polyline Drawings.

Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Wagner's Theorem on Realizers.

Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000

Orthogonal Drawings Based On The Stratification Of Planar Graphs.

Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Electron. Notes Discret. Math., 2000