Nicolas Bonichon

56 papers A* 2A 10B 10Journal 27Unranked 4

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Euclidean Freeze-Tag Problem on Plane. CCCG Saeed Odak, Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse
2024	J	`jnl`	Freeze-Tag in L CoRR Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
2024	A	`conf`	Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
2023	J	`jnl`	Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid
2022	B	`conf`	Local Routing Algorithms on Euclidean Spanners with Small Diameter. LATIN Nicolas Bonichon, Prosenjit Bose, Yan Garito
2021	J	`jnl`	A bijection for essentially 3-connected toroidal maps. Eur. J. Comb. Nicolas Bonichon, Éric Fusy, Benjamin Lévêque
2019	J	`jnl`	A Bijection for Essentially 4-Connected Toroidal Triangulations. Electron. J. Comb. Nicolas Bonichon, Benjamin Lévêque
2019	J	`jnl`	A bijection for essentially 3-connected toroidal maps. CoRR Nicolas Bonichon, Éric Fusy, Benjamin Lévêque
2018	A	`conf`	Improved Routing on the Delaunay Triangulation. ESA Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid
2017	J	`jnl`	A bijection for essentially 4-connected toroidal triangulations. CoRR Nicolas Bonichon, Benjamin Lévêque
2017	J	`jnl`	On the number of planar Eulerian orientations. Eur. J. Comb. Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun
2017	J	`jnl`	Rook-drawings of Plane Graphs. J. Graph Algorithms Appl. David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun
2017	J	`jnl`	Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2016	A	`conf`	Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
2016	J	`jnl`	Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
2015	A	`conf`	Rook-Drawing for Plane Graphs. GD David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun
2015	J	`jnl`	There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2015	J	`jnl`	Tight stretch factors for L Comput. Geom. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2015	J	`jnl`	Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2015	A	`conf`	Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen
2014	J	`jnl`	Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. IEEE Trans. Parallel Distributed Syst. Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski, Shailesh Kumar Agrawal
2014	A*	`conf`	There are Plane Spanners of Maximum Degree 4. SoCG Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2014	J	`jnl`	There are Plane Spanners of Maximum Degree 4. CoRR Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2013	—	`book`	Quelques algorithmes entre le monde des graphes et les nuages de points. Nicolas Bonichon
2012	A	`conf`	Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling. IPDPS Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Loris Marchal
2012	—	`conf`	Mixed Data-Parallel Scheduling for Distributed Continuous Integration. IPDPS Workshops Olivier Beaumont, Nicolas Bonichon, Ludovic Courtès, Eelco Dolstra, Xavier Hanin
2012	J	`jnl`	The Stretch Factor of L CoRR Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2012	A	`conf`	The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2011	—	`ch.`	An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Towards an Information Theory of Complex Networks Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2011	B	`conf`	Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model. ICPADS Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski
2011	B	`conf`	Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks. ICPP Olivier Beaumont, Nicolas Bonichon, Hubert Larchevêque
2011	—	`conf`	Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. IPDPS Workshops Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque
2010	B	`conf`	Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
2010	—	`conf`	Plane Spanners of Maximum Degree Six. ICALP (1) Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2009	J	`jnl`	Intervals in Catalan lattices and realizers of triangulations. J. Comb. Theory A Olivier Bernardi, Nicolas Bonichon
2008	B	`conf`	A Distributed Algorithm for Resource Clustering in Large Scale Platforms. OPODIS Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque
2008	J	`jnl`	Baxter permutations and plane bipolar orientations. Electron. Notes Discret. Math. Nicolas Bonichon, Mireille Bousquet-Mélou, Éric Fusy
2008	B	`conf`	Distributed Approximation Algorithm for Resource Clustering. SIROCCO Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque
2008	A	`conf`	Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. IPDPS Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois
2007	J	`jnl`	Convex Drawings of 3-Connected Plane Graphs. Algorithmica Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
2007	J	`jnl`	Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2006	J	`jnl`	Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
2006	B	`conf`	Short Labels by Traversal and Jumping. SIROCCO Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2005	J	`jnl`	A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discret. Math. Nicolas Bonichon
2005	J	`jnl`	Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. J. Graph Algorithms Appl. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2005	J	`jnl`	Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2004	A	`conf`	Convex Drawings of 3-Connected Plane Graphs. GD Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
2004	J	`jnl`	Orthogonal drawings based on the stratification of planar graphs. Discret. Math. Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
2004	B	`conf`	Planar Graphs, via Well-Orderly Maps and Trees. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
2003	A	`conf`	An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2003	B	`conf`	Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2003	J	`jnl`	Watermelon uniform random generation with applications. Theor. Comput. Sci. Nicolas Bonichon, Mohamed Mosbah
2002	—	`—`	Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. (Algorithmic and combinatorial aspects of maximal plane graphs realizers). Nicolas Bonichon
2002	B	`conf`	Optimal Area Algorithm for Planar Polyline Drawings. WG Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
2002	A*	`conf`	Wagner's Theorem on Realizers. ICALP Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
2000	J	`jnl`	Orthogonal Drawings Based On The Stratification Of Planar Graphs. Electron. Notes Discret. Math. Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah