Compact Routing Tables for Graphs of Bounded Genus. - Cyril Gavoille; Nicolas Hanusse (ICALP, 1999)

Flipping your Lid. - Hee-Kap Ahn; Prosenjit Bose; Jurek Czyzowicz; Nicolas Hanusse; Evangelos Kranakis; Pat Morin (CCCG, 2000)

An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (STACS, 2003)

Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. - Philippe Duchon; Nicolas Hanusse; Sébastien Tixeuil (DISC, 2004)

Searching with mobile agents in networks with liars. - Nicolas Hanusse; Evangelos Kranakis; Danny Krizanc (Discret. Appl. Math., 2004)

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (J. Graph Algorithms Appl., 2005)

A Deterministic Multidimensional Scaling Algorithm for Data Visualisation. - Anthony Don; Nicolas Hanusse (IV, 2006)

Towards small world emergence. - Philippe Duchon; Nicolas Hanusse; Emmanuelle Lebhar; Nicolas Schabanel (SPAA, 2006)

Planar Graphs, via Well-Orderly Maps and Trees. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Dominique Poulalhon; Gilles Schaeffer (Graphs Comb., 2006)

Broadcast in the rendezvous model. - Philippe Duchon; Nicolas Hanusse; Nasser Saheb; Akka Zemmari (Inf. Comput., 2006)

Could any graph be turned into a small-world? - Philippe Duchon; Nicolas Hanusse; Emmanuelle Lebhar; Nicolas Schabanel (Theor. Comput. Sci., 2006)

Non-Searchability of Random Power-Law Graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (OPODIS, 2007)

Non-searchability of random scale-free graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (PODC, 2007)

On Compact Encoding of Pagenumber. - Cyril Gavoille; Nicolas Hanusse (Discret. Math. Theor. Comput. Sci., 2008)

Memoryless search algorithms in a network with faulty advice. - Nicolas Hanusse; Dimitris J. Kavvadias; Evangelos Kranakis; Danny Krizanc (Theor. Comput. Sci., 2008)

Navigation dans les grands graphes. - Nicolas Hanusse (2009)

Algorithmes pour la sélection de vues à matérialiser avec garantie de performance. - Nicolas Hanusse; Sofian Maabout; Radu Tofan (EDA, 2009)

A view selection algorithm with performance guarantee. - Nicolas Hanusse; Sofian Maabout; Radu Tofan (EDBT, 2009)

Euler Tour Lock-In Problem in the Rotor-Router Model. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski (DISC, 2009)

Plane Spanners of Maximum Degree Six. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ICALP (1), 2010)

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? - Nicolas Hanusse; David Ilcinkas; Adrian Kosowski; Nicolas Nisse (PODC, 2010)

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; David Ilcinkas (WG, 2010)

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse (Towards an Information Theory of Complex Networks, 2011)

Revisiting the Partial Data Cube Materialization. - Nicolas Hanusse; Sofian Maabout; Radu Tofan (ADBIS, 2011)

A parallel algorithm for computing borders. - Nicolas Hanusse; Sofian Maabout (CIKM, 2011)

On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation. - Ioannis Atsonios; Olivier Beaumont; Nicolas Hanusse; Yusik Kim (ISAAC, 2011)

The Impact of Edge Deletions on the Number of Errors in Networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas (OPODIS, 2011)

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (ESA, 2012)

The Stretch Factor of L1- and L∞-Delaunay Triangulations - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (CoRR, 2012)

On the Communication Complexity of Distributed Name-Independent Routing Schemes. - Cyril Gavoille; Christian Glacet; Nicolas Hanusse; David Ilcinkas (DISC, 2013)

Parallel mining of dependencies. - Eve Garnaud; Nicolas Hanusse; Sofian Maabout; Noël Novelli (HPCS, 2014)

Large interactive visualization of density functions on big data infrastructure. - Alexandre Perrot; Romain Bourqui; Nicolas Hanusse; Frédéric Lalanne; David Auber (LDAV, 2015)

Brief Announcement: Routing the Internet with Very Few Entries. - Cyril Gavoille; Christian Glacet; Nicolas Hanusse; David Ilcinkas (PODC, 2015)

Tight stretch factors for L1- and L∞-Delaunay triangulations. - Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Ljubomir Perkovic (Comput. Geom., 2015)

Dépendances fonctionnelles et requêtes skyline multidimensionnelles. - Nicolas Hanusse; Patrick Kamnang Wanko; Sofian Maabout; Carlos Ordonez 001 (Ingénierie des Systèmes d Inf., 2015)

Computing and Summarizing the Negative Skycube. - Nicolas Hanusse; Patrick Kamnang Wanko; Sofian Maabout (CIKM, 2016)

Using Histograms for Skyline Size Estimation. - Nicolas Hanusse; Patrick Kamnang Wanko; Sofian Maabout (IDEAS, 2016)

Approches basées sur la distribution pour l'estimation de la taille du skyline. - Nicolas Hanusse; Patrick Kamnang Wanko; Sofian Maabout (Ingénierie des Systèmes d Inf., 2016)

The impact of dynamic events on the number of errors in networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas (Theor. Comput. Sci., 2016)

Skycube Materialization Using the Topmost Skyline or Functional Dependencies. - Sofian Maabout; Carlos Ordonez 001; Patrick Kamnang Wanko; Nicolas Hanusse (ACM Trans. Database Syst., 2016)

HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark Streaming. - Alexandre Perrot; Romain Bourqui; Nicolas Hanusse; David Auber (IV, 2017)

A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation. - Noël Gillet; Nicolas Hanusse (SSS, 2017)

Robustness of the Rotor-Router Mechanism. - Evangelos Bampas; Leszek Gasieniec; Nicolas Hanusse; David Ilcinkas; Ralf Klasing; Adrian Kosowski; Tomasz Radzik (Algorithmica, 2017)

Calculer et compresser le skycube négatif. - Patrick Kamnang Wanko; Sofian Maabout; Nicolas Hanusse (Ingénierie des Systèmes d Inf., 2017)

Disconnected components detection and rooted shortest-path tree maintenance in networks. - Christian Glacet; Nicolas Hanusse; David Ilcinkas; Colette Johnen (J. Parallel Distributed Comput., 2019)

Framing Algorithms for Approximate Multicriteria Shortest Paths. - Nicolas Hanusse; David Ilcinkas; Antonin Lentz (ATMOS, 2020)

Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. - Olivier Beaumont; Tobias Castanet; Nicolas Hanusse; Corentin Travers (Euro-Par, 2020)

The negative skycube. - Karim Alami; Nicolas Hanusse; Patrick Kamnang Wanko; Sofian Maabout (Inf. Syst., 2020)

An Energy Efficient and Scalable Node Architecture for Sensor Network. - Yassine Faize; Jérémie Crenne; Nicolas Hanusse; Christophe Jégo (NEWCAS, 2021)

Euclidean Freeze-Tag Problem on Plane. - Saeed Odak; Cyril Gavoille; Nicolas Bonichon; Nicolas Hanusse (CCCG, 2024)

Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (DISC, 2024)

Freeze-Tag in L1 has Wake-up Time Five. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (CoRR, 2024)

Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm. - Cyril Gavoille; Nicolas Hanusse; Gabriel Le Bouder; Taïssir Marcé (PODC, 2025)