Nicolas Bonichon
Nicolas Bonichon
Maître de conférences, Université de Bordeaux
Dirección de correo verificada de labri.fr - Página principal
TítuloCitado porAño
Convex drawings of 3-connected plane graphs
N Bonichon, S Felsner, M Mosbah
Algorithmica 47 (4), 399-420, 2007
1002007
Intervals in Catalan lattices and realizers of triangulations
O Bernardi, N Bonichon
Journal of Combinatorial Theory, Series A 116 (1), 55-75, 2009
962009
Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces
N Bonichon, C Gavoille, N Hanusse, D Ilcinkas
International Workshop on Graph-Theoretic Concepts in Computer Science, 266-278, 2010
772010
Planar graphs, via well-orderly maps and trees
N Bonichon, C Gavoille, N Hanusse, D Poulalhon, G Schaeffer
Graphs and Combinatorics 22 (2), 185-202, 2006
612006
An information-theoretic upper bound of planar graphs using triangulation
N Bonichon, C Gavoille, N Hanusse
Annual Symposium on Theoretical Aspects of Computer Science, 499-510, 2003
582003
Baxter permutations and plane bipolar orientations
N Bonichon, M Bousquet-Mélou, É Fusy
Séminaire Lotharingien de Combinatoire A 61, 2010, 2010
572010
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
492005
Wagner’s theorem on realizers
N Bonichon, B Le Saëc, M Mosbah
International Colloquium on Automata, Languages, and Programming, 1043-1053, 2002
462002
Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation
N Bonichon, C Gavoille, N Hanusse
International Workshop on Graph-Theoretic Concepts in Computer Science, 81-92, 2003
352003
Plane spanners of maximum degree six
N Bonichon, C Gavoille, N Hanusse, L Perković
International Colloquium on Automata, Languages, and Programming, 19-30, 2010
302010
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
252008
Watermelon uniform random generation with applications
N Bonichon, M Mosbah
Theoretical Computer Science 307 (2), 241-256, 2003
252003
Short labels by traversal and jumping
N Bonichon, C Gavoille, A Labourel
Electronic Notes in Discrete Mathematics 28, 153-160, 2007
222007
The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
European Symposium on Algorithms, 205-216, 2012
21*2012
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
192002
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
162011
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, 203-214, 2015
13*2015
Distributed approximation algorithm for resource clustering
O Beaumont, N Bonichon, P Duchon, H Larchevêque
International Colloquium on Structural Information and Communication …, 2008
132008
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
122016
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
O Beaumont, L Eyraud-Dubois, SK Agrawal
2010 IEEE International Symposium on Parallel & Distributed Processing …, 2010
112010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20