Segueix
nicolas hanusse
nicolas hanusse
Research Director of Computer Science, CNRS, Bordeaux University, LaBRI
Correu electrònic verificat a labri.fr
Títol
Citada per
Citada per
Any
Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces
N Bonichon, C Gavoille, N Hanusse, D Ilcinkas
Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010
932010
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
842015
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
812006
Planar graphs, via well-orderly maps and trees
N Bonichon, C Gavoille, N Hanusse, D Poulalhon, G Schaeffer
Graphs and Combinatorics 22, 185-202, 2006
772006
An information-theoretic upper bound of planar graphs using triangulation
N Bonichon, C Gavoille, N Hanusse
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science …, 2003
582003
Euler tour lock-in problem in the rotor-router model: I choose pointers and you choose port numbers
E Bampas, L Gąsieniec, N Hanusse, D Ilcinkas, R Klasing, A Kosowski
Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain …, 2009
572009
Compact routing tables for graphs of bounded genus
C Gavoille, N Hanusse
Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 1999
521999
Towards small world emergence
P Duchon, N Hanusse, E Lebhar, N Schabanel
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
482006
Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation
N Bonichon, C Gavoille, N Hanusse
Graph-Theoretic Concepts in Computer Science: 29th International Workshop …, 2003
422003
Plane spanners of maximum degree six
N Bonichon, C Gavoille, N Hanusse, L Perković
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
402010
A view selection algorithm with performance guarantee
N Hanusse, S Maabout, R Tofan
Proceedings of the 12th International Conference on Extending Database …, 2009
392009
Cacti, braids and complex polynomials
M El Marraki, N Hanusse, J Zipperer, A Zvonkin
Séminaire Lotharingien de Combinatoire 37, 36, 1997
281997
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
272008
Could any graph be turned into a small-world?
P Duchon, N Hanusse, E Lebhar, N Schabanel
Distributed Computing: 19th International Conference, DISC 2005, Cracow …, 2005
262005
Searching with mobile agents in networks with liars
N Hanusse, E Kranakis, D Krizanc
Discrete Applied Mathematics 137 (1), 69-85, 2004
262004
The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations
N Bonichon, C Gavoille, N Hanusse, L Perković
Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012
222012
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
Distributed Computing: 18th International Conference, DISC 2004, Amsterdam …, 2004
182004
Flipping your lid
HK Ahn, P Bose, J Czyzowicz, N Hanusse, E Kranakis, P Morin
172001
On Compact Encoding of Pagenumber Graphs
C Gavoille, N Hanusse
Discrete Mathematics and Theoretical Computer Science 10 (3), 23-34, 2008
162008
En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.
Articles 1–20