BACK TO INDEX
|
All publications sorted by type
|
-
N. Bonichon.
Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux.
PhD thesis,
LaBRI, Université Bordeaux I, Talence, France,
2002.
[WWW
] [bibtex-key = Bonb:2002] [bibtex-entry]
|
Articles in journal or book's chapters
|
-
Nicolas Bonichon,
Mireille Bousquet-Mélou,
and Éric Fusy.
Baxter permutations and plane bipolar orientations.
Séminaire Lotharingien de Combinatoire,
61A,
2010.
[WWW
] [bibtex-key = BBF10] [bibtex-entry]
-
O. Bernardi and N. Bonichon.
Catalan's intervals and realizers of triangulations.
JCT-A,
116(1):55-75,
2009.
[WWW
] [bibtex-key = BeBob:2009] [bibtex-entry]
-
N. Bonichon,
S. Felsner,
and M. Mosbah.
Convex Drawings of 3-Connected Planar Graphs.
Algorithmica,
47(4):399--420,
2007.
[WWW
] [bibtex-key = BFM07] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BGHPS06] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BGH05] [bibtex-entry]
-
N. Bonichon.
A Bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths.
Discrete Mathematics,
298:104--114,
2005.
Note: FPSAC'02 Special Issue.
[WWW
] [bibtex-key = Bon:2004] [bibtex-entry]
-
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.
Note: Special issue: 6th International Conference on Graph Theory - Edited by J.-L. Fouquet, I. Rusu.
[WWW
] [bibtex-key = BLM:2003] [bibtex-entry]
-
N. Bonichon and M. Mosbah.
Watermelon uniform random generation with applications.
Theoretical Computer Science,
307(2):241--256,
2003.
[WWW
] [bibtex-key = BM:2003] [bibtex-entry]
-
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,
2008.
Springer.
[WWW
] [bibtex-key = BBDL:2008] [bibtex-entry]
-
O. Beaumont,
N. Bonichon,
Ph. Duchon,
and H. Larchevêque.
Distributed Approximation Algorithm for Resource Clustering in large scale platforms.
In OPODIS 2008,
volume 5401 of Lecture Notes in Computer Science,
pages 564--567,
2008.
Springer.
[WWW
] [bibtex-key = BBDL:2008b] [bibtex-entry]
-
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,
2008.
Proceedings of IPDPS 2008, IEEE Computer Society Press.
[bibtex-key = BBE:2008] [bibtex-entry]
-
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,
2008.
Elsevier.
[bibtex-key = BBF:2008] [bibtex-entry]
-
O. Bernardi and N. Bonichon.
Catalan's intervals and realizers of triangulations (extended abstract).
In Proceedings of FPSAC'07,
2007.
[bibtex-key = BeBo:2007] [bibtex-entry]
-
Nicolas Bonichon,
Cyril Gavoille,
and Arnaud Labourel.
Short Labels by Traversal and Jumping.
In $13^{th}$ International Colloquium on Structural Information & Communication Complexity (SIROCCO),
volume Lecture Notes in Computer Science 4056,
July 2006.
Springer.
Note: 143--156.
[WWW
]
Keywords:
tree,
labeling scheme.
[bibtex-key = BGL06] [bibtex-entry]
-
Nicolas Bonichon,
Cyril Gavoille,
and Arnaud Labourel.
Edge Partition of Toroidal Graphs into Forests in Linear Time.
In Elsevier, editor,
$7^{th}$ International Conference on Graph Theory (ICGT),
volume 22,
pages 421--425,
September 2005.
Electronical Notes in Discrete Mathematics.
[WWW
] [bibtex-key = BGL05] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BFM04] [bibtex-entry]
-
N. Bonichon,
C. Gavoille,
N. Hanusse,
D. Poulalhon,
and G. Schaeffer.
Planar Graphs, via Well-Orderly Maps and Trees.
In $30^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG),
volume 3353 of Lecture Notes in Computer Science,
pages 270--284,
2004.
Springer-Verlag.
[WWW
] [bibtex-key = BGHPS04] [bibtex-entry]
-
N. Bonichon,
C. Gavoille,
and N. Hanusse.
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.
In $20^{th}$ Annual Symposium on Theoretical Aspects of Computer Science (STACS),
volume 2607 of Lecture Notes in Computer Science,
pages 499-510,
February 2003.
Springer-Verlag.
Note: Appears also as RR-1279-02 (2002), and a revised version is available here.
[WWW
] [bibtex-key = BGH03] [bibtex-entry]
-
N. Bonichon,
C. Gavoille,
and N. Hanusse.
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.
In $29^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG),
volume 2880 of Lecture Notes in Computer Science,
pages 81--92,
June 2003.
Springer-Verlag.
[WWW
] [bibtex-key = BGH03c] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = Bon:2002] [bibtex-entry]
-
N. Bonichon,
B. Le Saëc,
and M. Mosbah.
Optimal area algorithm for planar polyline drawings.
In $28^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG),
volume 2573 of LNCS,
pages 35--46,
2002.
Springer-Verlag.
[WWW
] [bibtex-key = BLMc:2002] [bibtex-entry]
-
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,
2002.
Springer-Verlag.
[WWW
] [bibtex-key = BLMb:2002] [bibtex-entry]
-
N. Bonichon,
B. Le Saëc,
and M. Mosbah.
Orthogonal Drawings based on the Stratification of Planar Graphs.
In Elsevier, editor,
$6^{th}$ International Conference on Graph Theory (ICGT),
pages 139-142,
August 2000.
Electronical Notes in Discrete Mathematics.
[WWW
] [bibtex-key = BGH00] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BGHI10] [bibtex-entry]
-
Nicolas Bonichon,
Mireille Bousquet-Mélou,
and Éric Fusy.
Baxter permutations and plane bipolar orientations.
Technical report arXiv:0805.4180,
arXiv,
2008.
[WWW
] [bibtex-key = BBF08] [bibtex-entry]
-
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.
Keywords:
tree,
labeling scheme.
[bibtex-key = BGL06a] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BGHPS04b] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BGH03b] [bibtex-entry]
-
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.
Note: Extended abstract published in STACS '03, and a revised version is available here.
[WWW
] [bibtex-key = BGH02] [bibtex-entry]
-
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.
[WWW
] [bibtex-key = BLM:2000] [bibtex-entry]
-
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,
.
[WWW
] [bibtex-key = BBDEL08] [bibtex-entry]
BACK TO INDEX
Disclaimer:
This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein
are retained by authors or by other copyright holders.
All person copying this information are expected to adhere to
the terms and constraints invoked by each author's copyright.
In most cases, these works may not be reposted
without the explicit permission of the copyright holder.
Les documents contenus dans ces répertoires sont rendus disponibles
par les auteurs qui y ont contribué en vue d'assurer la diffusion
à temps de travaux savants et techniques sur une base non-commerciale.
Les droits de copie et autres droits sont gardés par les auteurs
et par les détenteurs du copyright, en dépit du fait qu'ils présentent
ici leurs travaux sous forme électronique. Les personnes copiant ces
informations doivent adhérer aux termes et contraintes couverts par
le copyright de chaque auteur. Ces travaux ne peuvent pas être
rendus disponibles ailleurs sans la permission explicite du détenteur
du copyright.
Last modified: Mon Mar 15 13:41:51 2010
Author: bonichon.
This document was translated from BibTEX by
bibtex2html