Follow
nicolas hanusse
nicolas hanusse
Research Director of Computer Science, CNRS, Bordeaux University, LaBRI
Verified email at labri.fr
Title
Cited by
Cited by
Year
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
902010
Could any graph be turned into a small-world?
P Duchon, N Hanusse, E Lebhar, N Schabanel
Theoretical Computer Science 355 (1), 96-103, 2006
772006
Large interactive visualization of density functions on big data infrastructure
A Perrot, R Bourqui, N Hanusse, F Lalanne, D Auber
2015 IEEE 5th Symposium on large Data Analysis and Visualization (lDAV), 99-106, 2015
762015
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
732006
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
572003
Euler tour lock-in problem in the rotor-router model
E Bampas, L Gąsieniec, N Hanusse, D Ilcinkas, R Klasing, A Kosowski
International Symposium on Distributed Computing, 423-435, 2009
532009
Compact routing tables for graphs of bounded genus
C Gavoille, N Hanusse
International Colloquium on Automata, Languages, and Programming, 351-360, 1999
511999
Towards small world emergence
P Duchon, N Hanusse, E Lebhar, N Schabanel
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
462006
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
422003
Plane spanners of maximum degree six
N Bonichon, C Gavoille, N Hanusse, L Perković
International Colloquium on Automata, Languages, and Programming, 19-30, 2010
382010
A view selection algorithm with performance guarantee
N Hanusse, S Maabout, R Tofan
Proceedings of the 12th International Conference on Extending Database …, 2009
382009
Memoryless search algorithms in a network with faulty advice
N Hanusse, D Kavvadias, E Kranakis, D Krizanc
Theoretical Computer Science 402 (2-3), 190-198, 2008
282008
Cacti, braids and complex polynomials
M El Marraki, N Hanusse, J Zipperer, A Zvonkin
Séminaire Lotharingien de Combinatoire 37, 36, 1997
271997
Searching with mobile agents in networks with liars
N Hanusse, E Kranakis, D Krizanc
Discrete Applied Mathematics 137 (1), 69-85, 2004
252004
Could any graph be turned into a small-world?
P Duchon, N Hanusse, E Lebhar, N Schabanel
International Symposium on Distributed Computing, 511-513, 2005
232005
The Stretch Factor of L1- and L ∞ -Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
European Symposium on Algorithms, 205-216, 2012
202012
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?
N Hanusse, D Ilcinkas, A Kosowski, N Nisse
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010
192010
Optimal randomized self-stabilizing mutual exclusion on synchronous rings
P Duchon, N Hanusse, S Tixeuil
International Symposium on Distributed Computing, 216-229, 2004
182004
Flipping your lid
HK Ahn, P Bose, J Czyzowicz, N Hanusse, E Kranakis, P Morin
182001
10. On Compact Encoding of Pagenumber Graphs
C Gavoille, N Hanusse
182001
The system can't perform the operation now. Try again later.
Articles 1–20