Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bonichon, Nicolas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The stretch factor of
L_1
- and
L_{\infty}
-Delaunay triangulations
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
7501
, 2012, pp. 205-216
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
,
David Ilcinkas
Lecture Notes in Computer Science
6410
, 2010, pp. 266-278
Plane spanners of maximum degree six
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
,
Ljubomir Perković
Lecture Notes in Computer Science
6198
, 2010, pp. 19-30
Intervals in Catalan lattices and realizers of triangulations
Olivier Bernardi
,
Nicolas Bonichon
Journal of Combinatorial Theory Series A
116
(1), 2009, pp. 55-75
Convex drawings of 3-connected plane graphs
Nicolas Bonichon
,
Stefan Felsner
,
Mohamed Mosbah
Algorithmica
47
(4), 2007, pp. 399-420
Planar graphs, via well-orderly maps and trees
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
,
Dominique Poulalhon
,
Gilles Schaeffer
Graphs and Combinatorics
22
(2), 2006, pp. 185-202
Convex drawings of 3-connected plane graphs
Nicolas Bonichon
,
Stefan Felsner
,
Mohamed Mosbah
Lecture Notes in Computer Science
3383
, 2004, pp. 60-70
Planar graphs, via well-orderly maps and trees
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
,
Dominique Poulalhon
,
Gilles Schaeffer
Lecture Notes in Computer Science
3353
, 2004, pp. 270-284
An information-theoretic upper bound of planar graphs using triangulation
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
2607
, 2003, pp. 499-510
Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
2880
, 2003, pp. 81-92
Watermelon uniform random generation with applications
Nicolas Bonichon
,
Mohamed Mosbah
Theoretical Computer Science
307
(2), 2003, pp. 241-256
Wagner's theorem on realizers
Nicolas Bonichon
,
Bertrand Le Saëc
,
Mohamed Mosbah
Lecture Notes in Computer Science
2380
, 2002, pp. 1043-1053
Optimal area algorithm for planar polyline drawings
Nicolas Bonichon
,
Bertrand Le Saëc
,
Mohamed Mosbah
Lecture Notes in Computer Science
2573
, 2002, pp. 35-46