default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Bonichon
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC 2024: 9:1-9:16- [i7]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L1 has Wake-up Time Five. CoRR abs/2402.03258 (2024) - 2023
- [j20]Nicolas Bonichon
, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70(3): 495-549 (2023) - 2022
- [c24]Nicolas Bonichon, Prosenjit Bose, Yan Garito:
Local Routing Algorithms on Euclidean Spanners with Small Diameter. LATIN 2022: 696-712 - 2021
- [j19]Nicolas Bonichon, Éric Fusy, Benjamin Lévêque:
A bijection for essentially 3-connected toroidal maps. Eur. J. Comb. 95: 103290 (2021)
2010 – 2019
- 2019
- [j18]Nicolas Bonichon, Benjamin Lévêque:
A Bijection for Essentially 4-Connected Toroidal Triangulations. Electron. J. Comb. 26(1): 1 (2019) - [i6]Nicolas Bonichon, Éric Fusy, Benjamin Lévêque:
A bijection for essentially 3-connected toroidal maps. CoRR abs/1907.04016 (2019) - 2018
- [c23]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - 2017
- [j17]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58(2): 482-504 (2017) - [j16]Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun:
On the number of planar Eulerian orientations. Eur. J. Comb. 65: 59-91 (2017) - [j15]David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun:
Rook-drawings of Plane Graphs. J. Graph Algorithms Appl. 21(1): 103-120 (2017) - [i5]Nicolas Bonichon, Benjamin Lévêque:
A bijection for essentially 4-connected toroidal triangulations. CoRR abs/1707.08191 (2017) - 2016
- [c22]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD 2016: 519-531 - [i4]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR abs/1608.08892 (2016) - 2015
- [j14]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Tight stretch factors for L1- and L∞-Delaunay triangulations. Comput. Geom. 48(3): 237-250 (2015) - [j13]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53(3): 514-546 (2015) - [c21]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - [c20]David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun:
Rook-Drawing for Plane Graphs. GD 2015: 180-191 - [i3]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR abs/1501.01783 (2015) - 2014
- [j12]Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski, Shailesh Kumar Agrawal:
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. IEEE Trans. Parallel Distributed Syst. 25(10): 2520-2528 (2014) - [c19]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. SoCG 2014: 20 - [i2]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. CoRR abs/1403.5350 (2014) - 2013
- [b2]Nicolas Bonichon:
Quelques algorithmes entre le monde des graphes et les nuages de points. University of Bordeaux, France, 2013 - 2012
- [c18]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA 2012: 205-216 - [c17]Olivier Beaumont, Nicolas Bonichon, Ludovic Courtès, Eelco Dolstra, Xavier Hanin:
Mixed Data-Parallel Scheduling for Distributed Continuous Integration. IPDPS Workshops 2012: 91-98 - [c16]Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Loris Marchal:
Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling. IPDPS 2012: 273-284 - [i1]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L1- and L∞-Delaunay Triangulations. CoRR abs/1202.5127 (2012) - 2011
- [c15]Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski:
Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model. ICPADS 2011: 173-180 - [c14]Olivier Beaumont, Nicolas Bonichon, Hubert Larchevêque:
Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks. ICPP 2011: 482-491 - [c13]Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque:
Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. IPDPS Workshops 2011: 114-124 - [p1]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Towards an Information Theory of Complex Networks 2011: 17-46 - 2010
- [c12]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30 - [c11]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas:
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278
2000 – 2009
- 2009
- [j11]Olivier Bernardi, Nicolas Bonichon:
Intervals in Catalan lattices and realizers of triangulations. J. Comb. Theory A 116(1): 55-75 (2009) - 2008
- [j10]Nicolas Bonichon, Mireille Bousquet-Mélou, Éric Fusy:
Baxter permutations and plane bipolar orientations. Electron. Notes Discret. Math. 31: 69-74 (2008) - [c10]Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois:
Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. IPDPS 2008: 1-7 - [c9]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 - [c8]Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque:
Distributed Approximation Algorithm for Resource Clustering. SIROCCO 2008: 61-73 - 2007
- [j9]Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. Algorithmica 47(4): 399-420 (2007) - [j8]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28: 153-160 (2007) - 2006
- [j7]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22(2): 185-202 (2006) - [c7]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156 - 2005
- [j6]Nicolas Bonichon:
A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discret. Math. 298(1-3): 104-114 (2005) - [j5]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22: 421-425 (2005) - [j4]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
- [j3]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal drawings based on the stratification of planar graphs. Discret. Math. 276(1-3): 43-57 (2004) - [c6]Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. GD 2004: 60-70 - [c5]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284 - 2003
- [j2]Nicolas Bonichon, Mohamed Mosbah:
Watermelon uniform random generation with applications. Theor. Comput. Sci. 307(2): 241-256 (2003) - [c4]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510 - [c3]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92 - 2002
- [b1]Nicolas Bonichon:
Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. (Algorithmic and combinatorial aspects of maximal plane graphs realizers). University of Bordeaux, France, 2002 - [c2]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Wagner's Theorem on Realizers. ICALP 2002: 1043-1053 - [c1]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Optimal Area Algorithm for Planar Polyline Drawings. WG 2002: 35-46 - 2000
- [j1]Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs. Electron. Notes Discret. Math. 5: 35-37 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
