Research

Publications

  1. An Information-Theoretic Upper Bound of Planar Graphs using Well−Orderly maps.
    N. Bonichon, C. Gavoille, N. Hanusse
    Chapter of “Information Theory and Statistics of Complex Networks”, Springer−Verlag, 32 pages, 2011.
  2. Plane Spanners of Maximum Degree Six.
    Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
    Proc of ICALP (1) 2010: 19-30
  3. 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:
    Proc. of PODC 2010: 355-364
  4. Un algorithme parallèle pour l'extraction des bordures
    Nicolas Hanusse, Sofian Maabout
    Proc. of BDA'10 : Actes des 26èmes Journées Bases de Données Avancées (2010) 11 pages
  5. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.
    Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
    Proc. of WG 2010: 266-278
  6. Matérialisation Partielle des Cubes de Données
    Hanusse N., Maabout S., Tofan R.
    Proceedings of 25èmes journées "Bases de Données Avancées" BDA'09 (2009) 1-20
  7. Euler Tour Lock-in Problem in the Rotor-Router Model
    Bampas E., Gasieniec L., Hanusse N., Ilcinkas D., Klasing R., Kosowski A.
    Proc. of DISC 2009, 5805 (2009) 421--433
  8. Algorithmes pour la sélection de vues à matérialiser avec garantie de performance
    Hanusse N., Maabout S., Tofan R.
    Proc. of 5ème journées francophones sur les entrepôts de données et l'analyse en ligne (EDA'09) (2009)
  9. Algorithme distribué pour l'extraction des fréquents maximaux
    Hanusse N., Maabout S., Tofan R.
    Proc. of Algotel (2009)
  10. A view selection algorithm with performance guarantee
    Hanusse N., Maabout S., Tofan R.
    Proc. of International Conference on Extending Database Technology (2009)
  11. On Compact Encoding of Pagenumber k Graphs
    Gavoille C., Hanusse N.
    Discrete Mathematics & Theoretical Computer Science 10, 3 (2008) 23-34
  12. Memoryless search algorithms in a network with faulty advice
    Hanusse N., Kavvadias D., Kranakis E., Krizanc D.
    Theoretical Computer Science (TCS) 402, 2-3 (2008) 190-198
  13. Content-based image retrieval using greedy routing
    Don A., Hanusse N.
    In Proc. of Electronic Imaging - Multimedia Content Access Track 6820 (2008)
  14. Non-searchability of random scale-free graphs
    Duchon P., Eggemann N., Hanusse N.
    In Proc. of PODC'2007 (2007) 380-381
  15. Non-searchability of random power-law graphs
    Duchon P., Eggemann N., Hanusse N.
    In Proc. of 11th International Conference On Principles Of Distributed Systems (OPODIS 2007) 4878 (2007) 274--285
  16. A Deterministic Multidimensional Scaling Algorithm for Data Visualization
    Don A., Hanusse N.
    Proc. of IEEE IV2006 - International Conference on Information Visualization (2006) 511-520
  17. Non-Searchability of Random Scale-Free Graphs
    Duchon P., Eggemann N., Hanusse N.
    Proc of 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (2007) 27-30
  18. Towards Small World Emergence
    Duchon P., Hanusse N., Lebhar E., Schabanel N.
    Dans SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (2006) 225-232
  19. Could any graph be turned into a small-world?
    Duchon P., Hanusse N., Lebhar E., Schabanel N.
    Theoretical Computer Science 355 (2006) 96--103
  20. Broadcast in the rendezvous model
    Duchon P., Hanusse N., Saheb-Djahromi N., Zemmari A.
    Information and Computation (2006) 697-712
  21. Planar graphs, via well-orderly maps and trees
    Bonichon N., Gavoille C., Hanusse N., Poulalhon D., Schaeffer G.
    Graphs and Combinatorics 22, 2 (2006) 185-202
  22. Could any graph be turned into a small-world ?
    Duchon P., Hanusse N., Lebhar E., Schabanel N.
    Proc of. AlgoTel'2005 (conférence francophone sur les algorithmes de communications) (2005)
  23. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
    Gavoille C., Bonichon N., Hanusse N.
    Journal of Graph Algorithms and Applications 9 (2005) 185--204
  24. Could any graph be turned into a small world ?
    Duchon P., Hanusse N., Lebhar E., Schabanel N.
    Proc. of International Symposium on Distributed Computing (DISC) 3724
  25. Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
    Duchon P., Hanusse N., Tixeuil S.
    Dans Proceedings of DISC'2004 (2004) 216--229
  26. Planar Graphs, via Well-Orderly Maps and Trees
    Bonichon N., Gavoille C., Hanusse N., Poulalhon D., Schaeffer G.
    Technical Report (2004)
  27. Protocoles auto-stabilisants synchrones d'exclusion mutuelle pour les anneaux anonymes et uniformes
    Duchon P., Hanusse N., Tixeuil S.
    Proc. of Actes d'AlgoTel 2004 (2004) 135--140
  28. Planar Graphs, via Well-Orderly Maps and Trees
    Bonichon N., Gavoille C., Hanusse N., Poulalhon D., Schaeffer G.
    Proc. of $30^(th)$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG) 3353 (2004) 270-284
  29. Broadcast in the Rendezvous Model
    Duchon P., Hanusse N., Saheb-Djahromi N., Zemmari A.
    Proceedings of STACS 2004 2996 (2004) 559--570
  30. Searching with mobile agents in networks with liars
    Hanusse N., Kranakis E., Krizanc D.
    Discrete Applied Mathematics 137 (2004) 69--85
  31. An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
    Bonichon N., Gavoille C., Hanusse N.
    Proc. of $20^(th)$ Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2607 of Lecture Note in Computer Science (2003) 499-510
  32. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
    Bonichon N., Gavoille C., Hanusse N.
    Proc of $29^(th)$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG) 2880 (2003) 81-92
  33. Memoryless Search Algorithm in Networks with Faulty Advice
    Hanusse N., Kavvadias D., Kranakis E., Krizanc D.
    Proc of IFIP-WCC'2002 (World Computer Congress); Track - International Conference on Theoretical Computer Science (2002) 206-216