Nicolas Bonichon

881 total citations
24 papers, 210 citations indexed

About

Nicolas Bonichon is a scholar working on Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Nicolas Bonichon has authored 24 papers receiving a total of 210 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Graphics and Computer-Aided Design, 7 papers in Computer Networks and Communications and 6 papers in Computer Vision and Pattern Recognition. Recurrent topics in Nicolas Bonichon's work include Computational Geometry and Mesh Generation (15 papers), Data Management and Algorithms (5 papers) and Digital Image Processing Techniques (4 papers). Nicolas Bonichon is often cited by papers focused on Computational Geometry and Mesh Generation (15 papers), Data Management and Algorithms (5 papers) and Digital Image Processing Techniques (4 papers). Nicolas Bonichon collaborates with scholars based in France, Canada and United States. Nicolas Bonichon's co-authors include Olivier Bernardi, Mohamed Mosbah, Mireille Bousquet‐Mélou, Cyril Gavoille, Éric Fusy, Stefan Felsner, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer and Olivier Beaumont and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, Theoretical Computer Science and Discrete Mathematics.

In The Last Decade

Nicolas Bonichon

22 papers receiving 192 citations

Peers

Countries citing papers authored by Nicolas Bonichon

Since Specialization

Citations

This map shows the geographic impact of Nicolas Bonichon's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nicolas Bonichon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicolas Bonichon more than expected).

Fields of papers citing papers by Nicolas Bonichon

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nicolas Bonichon. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nicolas Bonichon. The network helps show where Nicolas Bonichon may publish in the future.

Co-authorship network of co-authors of Nicolas Bonichon

This figure shows the co-authorship network connecting the top 25 collaborators of Nicolas Bonichon. A scholar is included among the top collaborators of Nicolas Bonichon based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nicolas Bonichon. Nicolas Bonichon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity 2024 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse	0
2	Improved Routing on the Delaunay Triangulation 2023 ·Discrete & Computational Geometry ·Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, (unknown), (unknown), Michiel Smid	1
3	A Bijection for Essentially 4-Connected Toroidal Triangulations 2019 ·The Electronic Journal of Combinatorics ·Nicolas Bonichon, Benjamin Lévêque	0
4	Improved Routing on the Delaunay Triangulation 2018 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, (unknown), (unknown), Michiel Smid	1
5	Rook-drawings of Plane Graphs 2016 ·Journal of Graph Algorithms and Applications ·David Auber, Nicolas Bonichon, Paul Dorbec, (unknown)	1
6	There are Plane Spanners of Degree 4 and Moderate Stretch Factor 2015 ·Discrete & Computational Geometry ·Nicolas Bonichon, Iyad Kanj, Ljubomir Perković, Ge Xia	6
7	Tight stretch factors for L1- and L∞-Delaunay triangulations 2014 ·Computational Geometry ·Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perković	3
8	Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model 2013 ·IEEE Transactions on Parallel and Distributed Systems ·Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud‐Dubois, Przemysław Uznański, (unknown)	2
9	Asymptotics of geometrical navigation on a random set of points in the plane 2011 ·Advances in Applied Probability ·Nicolas Bonichon, (unknown)	2
10	Asymptotics of geometrical navigation on a random set of points in the plane 2011 ·Advances in Applied Probability ·Nicolas Bonichon, (unknown)	4
11	Use of Internet Embedding Tools for Heterogeneous Resources Aggregation 2011 ·Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, (unknown)	2
12	Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model 2011 ·Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud‐Dubois, Przemysław Uznański	2
13	Intervals in Catalan lattices and realizers of triangulations 2008 ·Journal of Combinatorial Theory Series A ·Olivier Bernardi, Nicolas Bonichon	40
14	Baxter permutations and plane bipolar orientations 2008 ·Electronic Notes in Discrete Mathematics ·Nicolas Bonichon, Mireille Bousquet‐Mélou, Éric Fusy	31
15	Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model 2008 ·Proceedings - IEEE International Parallel and Distributed Processing Symposium ·Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud‐Dubois	13
16	Planar Graphs, via Well-Orderly Maps and Trees 2006 ·Graphs and Combinatorics ·Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer	29
17	A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths 2005 ·Discrete Mathematics ·Nicolas Bonichon	20
18	Edge Partition of Toroidal Graphs into Forests in Linear Time 2005 ·Electronic Notes in Discrete Mathematics ·Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel	1
19	Watermelon uniform random generation with applications 2003 ·Theoretical Computer Science ·Nicolas Bonichon, Mohamed Mosbah	14
20	Orthogonal Drawings Based On The Stratification Of Planar Graphs 2000 ·Electronic Notes in Discrete Mathematics ·Nicolas Bonichon, (unknown), Mohamed Mosbah	1

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact