| 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 | 102 | 2010 |
| 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 | 96 | 2015 |
| 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 | 89 | 2006 |
| 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 | 80 | 2006 |
| 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 | 70 | 2003 |
| 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 International Symposium on Distributed Computing, 423-435, 2009 | 69* | 2009 |
| Compact routing tables for graphs of bounded genus C Gavoille, N Hanusse Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 2002 | 49 | 2002 |
| Towards small world emergence P Duchon, N Hanusse, E Lebhar, N Schabanel Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006 | 47 | 2006 |
| Plane spanners of maximum degree six N Bonichon, C Gavoille, N Hanusse, L Perković International Colloquium on Automata, Languages, and Programming, 19-30, 2010 | 46 | 2010 |
| 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 | 40 | 2003 |
| A view selection algorithm with performance guarantee N Hanusse, S Maabout, R Tofan Proceedings of the 12th International Conference on Extending Database …, 2009 | 37 | 2009 |
| Cacti, braids and complex polynomials M El Marraki, N Hanusse, J Zipperer, A Zvonkin Séminaire Lotharingien de Combinatoire 37, 36, 1997 | 31 | 1997 |
| 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 | 29 | 2008 |
| Searching with mobile agents in networks with liars N Hanusse, E Kranakis, D Krizanc Discrete Applied Mathematics 137 (1), 69-85, 2004 | 27 | 2004 |
| 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 | 26 | 2005 |
| The Stretch Factor of L1- and L ∞ -Delaunay Triangulations N Bonichon, C Gavoille, N Hanusse, L Perković European Symposium on Algorithms, 205-216, 2012 | 23 | 2012 |
| 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 | 22 | 2010 |
| Tight stretch factors for L1-and L∞-Delaunay triangulations N Bonichon, C Gavoille, N Hanusse, L Perković Computational Geometry 48 (3), 237-250, 2015 | 20 | 2015 |
| On Compact Encoding of Pagenumber Graphs C Gavoille, N Hanusse Discrete Mathematics & Theoretical Computer Science 10, 2008 | 19 | 2008 |
| Optimal randomized self-stabilizing mutual exclusion on synchronous rings P Duchon, N Hanusse, S Tixeuil International Symposium on Distributed Computing, 216-229, 2004 | 19 | 2004 |
