- Olivier Beaumont,
Nicolas Bonichon, Ludovic Courtès, Eelco Dolstra, and Xavier Hanin.
Mixed data-parallel scheduling for distributed continuous integration.
In IEEE, editor, Heterogeneous Computing Workshop HCW'2012, page
to appear, 2012.
- Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois,
and Loris Marchal.
Minimizing Weighted Mean
Completion Time for Malleable Tasks Scheduling.
In IEEE, editor, IPDPS 2012, 26th IEEE International Parallel &
Distributed Processing Symposium, Shangai, China, 2012.
- Nicolas Bonichon,
Cyril Gavoille, Nicolas Hanusse, and Perkovic Ljubomir.
The stretch factor of L_1- and
L_infty- Delaunay triangulations.
Technical Report arXiv:1202.5127, arXiv, 2012.
- O. Beaumont,
N. Bonichon, and H. Larchevêque.
Bin
packing avec contrainte de distance.
In ROADEF 2011 Volume 1, pages 365–366, 2011.
- Olivier
Beaumont, Nicolas Bonichon, Philippe Duchon, and Hubert
Larchevêque.
Use
of Internet Embedding Tools for Heterogeneous Resources
Aggregation.
Research report, 2011.
- Olivier
Beaumont, Nicolas Bonichon, Philippe Duchon, and Hubert
Larchevêque.
Use of Internet Embedding Tools for Heterogeneous Resources
Aggregation.
In HCW 2011, page Accepted, 2011.
- Olivier
Beaumont, Nicolas Bonichon, Philippe Duchon, and Hubert
Larchevêque.
Utilisation
d'outils de plongement d'internet pour l'agrégation de ressources
hétérogènes.
In 13èmes Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel), pages
139–143, 2011.
- Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois,
and Loris Marchal.
Minimizing
Weighted Mean Completion Time for Malleable Tasks Scheduling.
Technical report, 2011.
- Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois,
and P. Uznanski.
Broadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the
Bounded Multi-Port Model.
In ICPADS 2011 – 17th Internation Conference on Parallel and
Distributed Systems, volume Proceeding of ICPADS 2011, Taïnan,
Taïwan, Province De Chine, 2011.
- Olivier
Beaumont, Nicolas Bonichon, and Hubert Larchevêque.
Modeling and Practical Evaluation of a Service Location
Problem in Large Scale Networks.
Research report, 03 2011.
- Olivier
Beaumont, Nicolas Bonichon, and Hubert Larchevêque.
Modeling and Practical Evaluation of a Service Location Problem in
Large Scale Networks.
In ICPP 2011, pages 482–491, 2011.
- Nicolas Bonichon
and Jean-François Marckert.
Asymptotics of geometrical navigation on a random set of points of the plane.
Advances in Applied Probability, 43:1–44, 2011.
- Nicolas Bonichon,
Cyril Gavoille, and Nicolas Hanusse.
An
information-theoretic upper bound on planar graphs using well-orderly
maps.
In Matthias Dehmer, Frank Emmert-Streib, and Alexander Mehler, editors,
Towards an Information Theory of Complex Networks, pages 17–46.
Birkhäuser Boston, 2011.
10.1007/978-0-8176-4904-3_2.
- Nicolas Bonichon
and Jean-François Marckert.
Asymptotic of geometrical navigation
on a random set of points of the plane.
Technical Report arXiv:1009.4679, arXiv, 2010.
- Nicolas Bonichon,
Mireille Bousquet-Mélou, and Éric Fusy.
Baxter
permutations and plane bipolar orientations.
Séminaire Lotharingien de Combinatoire, 61A, 2010.
- Nicolas Bonichon,
Cyril Gavoille, Nicolas Hanusse, and David Ilcinkas.
Connections between
theta-graphs, delaunay triangulations, and orthogonal surfaces.
Technical Report hal-00454565_v1, HAL, February 2010.
- Nicolas
Bonichon, Cyril Gavoille, Nicolas Hanusse, and David Ilcinkas.
Connections
between theta-graphs, delaunay triangulations, and orthogonal surfaces.
In WG'2010, volume 6410 of Lecture Notes in Computer
Science, pages 266–278, 2010.
- Nicolas Bonichon, Cyril Gavoille, Nicolas
Hanusse, David Ilcinkas, and Ljubomir Perkovic.
Comment résumer le plan.
In 12èmes Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel),
2010.
- Nicolas
Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir
Perkovic.
Plane spanners of
maximum degree six.
In ICALP'10, volume 6198 of Lecture Notes in Computer
Science, pages 19–30, 2010.
- Olivier
Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud
Dubois, and Hubert Larchevêque.
A
Distributed Algorithm for Resource Clustering in Large Scale
Platforms.
Technical report, 2009.
- O. Bernardi
and N. Bonichon.
Catalan's intervals and realizers of triangulations.
JCT-A, 116(1):55–75, 2009.
- O. Beaumont,
N. Bonichon, Ph. Duchon, and H. Larchevêque.
Distributed approximation algorithm for resource clustering.
In Alexander A. Shvartsman and Pascal Felber, editors, SIROCCO
2008, volume 5058 of Lecture Notes in Computer Science,
pages 61–73. Springer, 2008.
- O. Beaumont,
N. Bonichon, and L. Eyraud-Dubois.
Scheduling
divisible workload on heterogeneous platforms under bounded multi-port
model.
In Heterogeneous Computing Workshop HCW'2008, pages 1–7.
Proceedings of IPDPS 2008, IEEE Computer Society Press, 2008.
- O. Beaumont,
N. Bonichon, L. Eyraud-Dubois, Ph. Duchon, and H. Larchevêque.
A
distributed algorithm for resource clustering in large scale platforms.
In OPODIS 2008, volume 5401 of Lecture Notes in Computer
Science, pages 564–567. Springer, 2008.
- N. Bonichon,
M. Bousquet-Mélou, and E. Fusy.
Baxter permutations and plane bipolar
orientations.
In Topological and Geometric Graph Theory, volume 31 of
Electronic Notes in Distrete Mathematics, pages 69–64.
Elsevier, 2008.
- Nicolas Bonichon,
Mireille Bousquet-Mélou, and Éric Fusy.
Baxter permutations and plane
bipolar orientations.
Technical Report arXiv:0805.4180, arXiv, 2008.
- O. Bernardi
and N. Bonichon.
Catalan's intervals and realizers of triangulations (extended abstract).
In Proceedings of FPSAC'07, 2007.
- N. Bonichon,
S. Felsner, and M. Mosbah.
Convex
drawings of 3-connected planar graphs.
Algorithmica, 47(4):399–420, 2007.
- N. Bonichon,
C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer.
Planar graphs, via well-orderly maps and trees.
Graphs and Combinatorics, 22:1–18, 2006.
- Nicolas Bonichon,
Cyril Gavoille, and Arnaud Labourel.
Short labels by
traversal and jumping.
In 13th International Colloquium on Structural Information &
Communication Complexity (SIROCCO), volume Lecture Notes in Computer
Science 4056. Springer, July 2006.
143–156.
- Nicolas Bonichon,
Cyril Gavoille, and Arnaud Labourel.
Short labels by
traversal and jumping.
Research Report RR-1389-06, LaBRI, University of Bordeaux 1, 351, cours de la
Libération, 33405 Talence Cedex, France, March 2006.
- N. Bonichon.
A bijection between realizers of maximal plane graphs and pairs of
non-crossing dyck paths.
Discrete Mathematics, 298:104–114, 2005.
FPSAC'02 Special Issue.
- N. Bonichon,
C. Gavoille, and N. Hanusse.
Canonical decomposition of outerplanar maps and
application to enumeration, coding and generation.
Journal of Graph Algorithms and Applications, 9(2):185 – 204,
2005.
- Nicolas Bonichon,
Cyril Gavoille, and Arnaud Labourel.
Edge partition of toroidal graphs into forests in linear time.
In Elsevier, editor, 7th International Conference on Graph Theory
(ICGT), volume 22, pages 421–425. Electronical Notes in Discrete
Mathematics, September 2005.
- N. Bonichon,
S. Felsner, and M. Mosbah.
Convex drawings of 3-connected planar graphs - (extended
abstract).
In Graph Drawing: 12th International Symposium, GD 2004, volume
3383 of LNCS, pages 60–70, 2004.
- N. Bonichon,
C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer.
Planar
graphs, via well-orderly maps and trees.
In 30th International Workshop, Graph - Theoretic Concepts in
Computer Science (WG), volume 3353 of Lecture Notes in Computer
Science, pages 270–284. Springer-Verlag, 2004.
- N. Bonichon,
C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer.
Planar graphs, via well-orderly maps and trees.
Research Report RR-1333-04, LaBRI, University of Bordeaux, 351, cours de la
Libération, 33405 Talence Cedex, France, sept 2004.
- N. Bonichon, B. Le
Saëc, and M. Mosbah.
Orthogonal
drawings based on the stratification of planar graphs.
Discrete Mathematics, 276(1-3):43–57, 2004.
Special issue: 6th International Conference on Graph Theory - Edited by J.-L.
Fouquet, I. Rusu.
- N. Bonichon and
M. Mosbah.
Watermelon uniform random
generation with applications.
Theoretical Computer Science, 307(2):241–256, 2003.
- N. Bonichon,
C. Gavoille, and N. Hanusse.
Canonical
decomposition of outerplanar maps and application to enumeration, coding and
generation.
In 29th International Workshop, Graph - Theoretic Concepts in
Computer Science (WG), volume 2880 of Lecture Notes in Computer
Science, pages 81–92. Springer-Verlag, June 2003.
- N. Bonichon,
C. Gavoille, and N. Hanusse.
Canonical decomposition of outerplanar maps and application to
enumeration, coding and generation.
Research Report RR-1295-03, LaBRI, University of Bordeaux, 351, cours de la
Libération, 33405 Talence Cedex, France, March 2003.
- N. Bonichon,
C. Gavoille, and N. Hanusse.
An
information-theoretic upper bound of planar graphs using triangulation.
In 20th Annual Symposium on Theoretical Aspects of Computer Science
(STACS), volume 2607 of Lecture Notes in Computer
Science, pages 499–510. Springer-Verlag, February 2003.
- N. Bonichon.
Aspects algorithmiques et combinatoires des
réaliseurs des graphes plans maximaux.
PhD thesis, LaBRI, Université Bordeaux I, Talence, France, 2002.
- N. Bonichon.
A bijection between realizers of maximal plane
graphs and pairs of non-crossing dyck paths.
In Proceedings of FPSAC'02, pages 123–132, 2002.
- N. Bonichon,
C. Gavoille, and N. Hanusse.
An information upper bound of planar graphs using triangulation.
Research Report RR-1279-02, LaBRI, University of Bordeaux, 351, cours de la
Libération, 33405 Talence Cedex, France, September 2002.
- N. Bonichon,
B. Le Saëc, and M. Mosbah.
Optimal area algorithm for planar polyline
drawings.
In 28th International Workshop, Graph - Theoretic Concepts in
Computer Science (WG), volume 2573 of LNCS, pages 35–46.
Springer-Verlag, 2002.
- N. Bonichon,
B. Le Saëc, and M. Mosbah.
Wagner's theorem on realizers.
In Proceedings of International Colloquium on Automata, Languages and
Programming 2002 (ICALP'02), volume 2380 of Lecture Notes in
Computer Science, pages 1043–1053. Springer-Verlag, 2002.
- N. Bonichon, B. Le
Saëc, and M. Mosbah.
Orthogonal drawings based on the stratification of planar graphs.
In Elsevier, editor, 6th International Conference on Graph Theory
(ICGT), pages 139–142. Electronical Notes in Discrete Mathematics,
August 2000.
- N. Bonichon, B. Le
Saëc, and M. Mosbah.
Orthogonal drawings based on the stratification of planar graphs.
Technical Report RR-1246-00, LaBRI, 2000.