 | 2009 |
| 23 |  | Evangelos Bampas,
Leszek Gasieniec,
Nicolas Hanusse,
David Ilcinkas,
Ralf Klasing,
Adrian Kosowski:
Euler Tour Lock-In Problem in the Rotor-Router Model.
DISC 2009: 423-435 |
| 22 |  | Nicolas Hanusse,
Sofian Maabout,
Radu Tofan:
A view selection algorithm with performance guarantee.
EDBT 2009: 946-957 |
| 2008 |
| 21 |  | Cyril Gavoille,
Nicolas Hanusse:
On Compact Encoding of Pagenumber.
Discrete Mathematics & Theoretical Computer Science 10(3): (2008) |
| 20 |  | Nicolas Hanusse,
Dimitris J. Kavvadias,
Evangelos Kranakis,
Danny Krizanc:
Memoryless search algorithms in a network with faulty advice.
Theor. Comput. Sci. 402(2-3): 190-198 (2008) |
| 2007 |
| 19 |  | Philippe Duchon,
Nicole Eggemann,
Nicolas Hanusse:
Non-Searchability of Random Power-Law Graphs.
OPODIS 2007: 274-285 |
| 18 |  | Philippe Duchon,
Nicole Eggemann,
Nicolas Hanusse:
Non-searchability of random scale-free graphs.
PODC 2007: 380-381 |
| 2006 |
| 17 |  | Anthony Don,
Nicolas Hanusse:
A Deterministic Multidimensional Scaling Algorithm for Data Visualisation.
IV 2006: 511-520 |
| 16 |  | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Towards small world emergence.
SPAA 2006: 225-232 |
| 15 |  | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse,
Dominique Poulalhon,
Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees.
Graphs and Combinatorics 22(2): 185-202 (2006) |
| 14 |  | Philippe Duchon,
Nicolas Hanusse,
Nasser Saheb,
Akka Zemmari:
Broadcast in the rendezvous model.
Inf. Comput. 204(5): 697-712 (2006) |
| 13 |  | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Could any graph be turned into a small-world?
Theor. Comput. Sci. 355(1): 96-103 (2006) |
| 2005 |
| 12 |  | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Could any Graph be Turned into a Small-World?.
DISC 2005: 511-513 |
| 11 |  | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.
J. Graph Algorithms Appl. 9(2): 185-204 (2005) |
| 2004 |
| 10 |  | Philippe Duchon,
Nicolas Hanusse,
Sébastien Tixeuil:
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings.
DISC 2004: 216-229 |
| 9 |  | Philippe Duchon,
Nicolas Hanusse,
Nasser Saheb,
Akka Zemmari:
Broadcast in the Rendezvous Model.
STACS 2004: 559-570 |
| 8 |  | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse,
Dominique Poulalhon,
Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees.
WG 2004: 270-284 |
| 7 |  | Nicolas Hanusse,
Evangelos Kranakis,
Danny Krizanc:
Searching with mobile agents in networks with liars.
Discrete Applied Mathematics 137(1): 69-85 (2004) |
| 2003 |
| 6 |  | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.
STACS 2003: 499-510 |
| 5 |  | Nicolas Bonichon,
Cyril Gavoille,
Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.
WG 2003: 81-92 |
| 2002 |
| 4 |  | Nicolas Hanusse,
Dimitris J. Kavvadias,
Evangelos Kranakis,
Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice.
IFIP TCS 2002: 206-216 |
| 2000 |
| 3 |  | Hee-Kap Ahn,
Prosenjit Bose,
Jurek Czyzowicz,
Nicolas Hanusse,
Evangelos Kranakis,
Pat Morin:
Flipping your Lid.
CCCG 2000 |
| 2 |  | Nicolas Hanusse,
Evangelos Kranakis,
Danny Krizanc:
Searching with Mobile Agents in Networks with Liars.
Euro-Par 2000: 583-590 |
| 1999 |
| 1 |  | Cyril Gavoille,
Nicolas Hanusse:
Compact Routing Tables for Graphs of Bounded Genus.
ICALP 1999: 351-360 |