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
Hilfe
Suche: Author="Hanusse, 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
On power-law distributed balls in bins and its applications to view size estimation
Ioannis Atsonios
,
Olivier Beaumont
,
Nicolas Hanusse
,
Yusik Kim
Lecture Notes in Computer Science
7074
, 2011, pp. 504-513
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
Memoryless search algorithms in a network with faulty advice
Nicolas Hanusse
,
Dimitris Kavvadias
,
Evangelos Kranakis
,
Danny Krizanc
Theoretical Computer Science
402
(2-3), 2008, pp. 190-198
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
Towards small world emergence
Philippe Duchon
,
Nicolas Hanusse
,
Emmanuelle Lebhar
,
Nicolas Schabanel
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 225-232
Could any graph be turned into a small-world?
Philippe Duchon
,
Nicolas Hanusse
,
Emmanuelle Lebhar
,
Nicolas Schabanel
Theoretical Computer Science
355
(1), 2006, pp. 96-103
Broadcast in the rendezvous model
Philippe Duchon
,
Nicolas Hanusse
,
Nasser Saheb
,
Akka Zemmari
Information and Computation
204
(5), 2006, pp. 697-712
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
Broadcast in the rendezvous model
Philippe Duchon
,
Nicolas Hanusse
,
Nasser Saheb
,
Akka Zemmari
Lecture Notes in Computer Science
2996
, 2004, pp. 559-570
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
Searching with mobile agents in networks with liars
Nicolas Hanusse
,
Evangelos Kranakis
,
Danny Krizanc
Lecture Notes in Computer Science
1900
, 2000, pp. 583-590
Compact routing tables for graphs of bounded genus
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
1644
, 1999, pp. 351-360