Intervals in Catalan lattices and realizers of triangulations O Bernardi, N Bonichon Journal of Combinatorial Theory, Series A 116 (1), 55-75, 2009 | 135 | 2009 |

Convex drawings of 3-connected plane graphs N Bonichon, S Felsner, M Mosbah Algorithmica 47 (4), 399-420, 2007 | 121 | 2007 |

Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces N Bonichon, C Gavoille, N Hanusse, D Ilcinkas Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010 | 96 | 2010 |

Planar graphs, via well-orderly maps and trees N Bonichon, C Gavoille, N Hanusse, D Poulalhon, G Schaeffer Graphs and Combinatorics 22, 185-202, 2006 | 85 | 2006 |

Baxter permutations and plane bipolar orientations N Bonichon, M Bousquet-Mélou, É Fusy Séminaire Lotharingien de Combinatoire 61, B61Ah, 2010 | 77 | 2010 |

An information-theoretic upper bound of planar graphs using triangulation N Bonichon, C Gavoille, N Hanusse STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science …, 2003 | 70 | 2003 |

A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths N Bonichon Discrete Mathematics 298 (1-3), 104-114, 2005 | 51 | 2005 |

Wagner’s theorem on realizers N Bonichon, B Le Saëc, M Mosbah International Colloquium on Automata, Languages, and Programming, 1043-1053, 2002 | 47 | 2002 |

Plane spanners of maximum degree six N Bonichon, C Gavoille, N Hanusse, L Perković International Colloquium on Automata, Languages, and Programming, 19-30, 2010 | 41 | 2010 |

Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation N Bonichon, C Gavoille, N Hanusse Graph-Theoretic Concepts in Computer Science: 29th International Workshop …, 2003 | 38 | 2003 |

The Stretch Factor of *L*_{1}- and *L*_{ ∞ }-Delaunay TriangulationsN Bonichon, C Gavoille, N Hanusse, L Perković European Symposium on Algorithms, 205-216, 2012 | 36* | 2012 |

Mixed data-parallel scheduling for distributed continuous integration O Beaumont, N Bonichon, L Courtès, E Dolstra, X Hanin 2012 IEEE 26th International Parallel and Distributed Processing Symposium …, 2012 | 34 | 2012 |

Short labels by traversal and jumping N Bonichon, C Gavoille, A Labourel Electronic Notes in Discrete Mathematics 28, 153-160, 2007 | 31 | 2007 |

Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model O Beaumont, N Bonichon, L Eyraud-Dubois 2008 IEEE International Symposium on Parallel and Distributed Processing, 1-7, 2008 | 28 | 2008 |

Watermelon uniform random generation with applications N Bonichon, M Mosbah Theoretical Computer Science 307 (2), 241-256, 2003 | 28 | 2003 |

Upper and lower bounds for online routing on Delaunay triangulations N Bonichon, P Bose, JL De Carufel, L Perković, A van Renssen Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 25 | 2015 |

Optimal area algorithm for planar polyline drawings N Bonichon, B Le Saëc, M Mosbah International Workshop on Graph-Theoretic Concepts in Computer Science, 35-46, 2002 | 23 | 2002 |

Gabriel triangulations and angle-monotone graphs: Local routing and recognition N Bonichon, P Bose, P Carmi, I Kostitsyna, A Lubiw, S Verdonschot International Symposium on Graph Drawing and Network Visualization, 519-531, 2016 | 20 | 2016 |

Asymptotics of geometrical navigation on a random set of points in the plane N Bonichon, JF Marckert Advances in Applied Probability 43 (4), 899-942, 2011 | 20 | 2011 |

There are plane spanners of degree 4 and moderate stretch factor N Bonichon, I Kanj, L Perković, G Xia Discrete & Computational Geometry 53 (3), 514-546, 2015 | 19 | 2015 |