Skip to Main content
Number of documents

75

nicolas hanusse


Journal articles15 documents

  • Karim Alami, Nicolas Hanusse, Patrick Kamnang-Wanko, Sofian Maabout. The negative skycube. Information Systems, Elsevier, 2020, 88, pp.101443. ⟨10.1016/j.is.2019.101443⟩. ⟨hal-02326458⟩
  • Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen. Disconnected components detection and rooted shortest-path tree maintenance in networks. Journal of Parallel and Distributed Computing, Elsevier, 2019, 132, pp.299-309. ⟨10.1016/j.jpdc.2019.05.006⟩. ⟨hal-02283167⟩
  • Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout. Calculer et compresser le skycube négatif. Ingéniérie des Systèmes d'Information, Lavoisier, 2017. ⟨hal-01664248⟩
  • Evangelos Bampas, Leszek Gąsieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, et al.. Robustness of the Rotor–Router Mechanism. Algorithmica, Springer Verlag, 2017, 78 (3), pp.869-895. ⟨10.1007/s00453-016-0179-y⟩. ⟨hal-01416012⟩
  • Christian Glacet, Nicolas Hanusse, David Ilcinkas. The impact of dynamic events on the number of errors in networks. Theoretical Computer Science, Elsevier, 2016, 627, pp.1-12. ⟨10.1016/j.tcs.2016.02.012⟩. ⟨hal-01325664⟩
  • Sofian Maabout, Carlos Ordonez, Patrick Kamnang Wanko, Nicolas Hanusse. Skycube Materialization Using the Topmost Skyline or Functional Dependencies. ACM Transactions on Database Systems, Association for Computing Machinery, 2016, 41 (4), pp.1-40. ⟨10.1145/2955092⟩. ⟨hal-01407518⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. Tight Stretch Factors for $L_1$- and $L_\infty$-Delaunay Triangulations. Computational Geometry, Elsevier, 2015, 48, pp.237-250. ⟨hal-00964470⟩
  • Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout, Carlos Ordonez. Dépendances fonctionnelles et requêtes skyline multidimensionnelles. Revue des Sciences et Technologies de l'Information - Série ISI : Ingénierie des Systèmes d'Information, Lavoisier, 2015, ISI : Ingénierie des Systèmes d'Information, 20 (5), pp.9-26. ⟨hal-01274388⟩
  • Cyril Gavoille, Nicolas Hanusse. On Compact Encoding of Pagenumber $k$ Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.23-34. ⟨hal-00402218⟩
  • Nicolas Hanusse, Dimitris Kavvadias, Evangelos Kranakis, Danny Krizanc. Memoryless search algorithms in a network with faulty advice. Theoretical Computer Science, Elsevier, 2008, 402 (2-3), pp.190-198. ⟨hal-00341468⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, Springer Verlag, 2006, 22 (2), pp.185-202. ⟨hal-00159296⟩
  • Philippe Duchon, Nicolas Hanusse, Nasser Saheb-Djahromi, Akka Zemmari. Broadcast in the rendezvous model. Information and Computation, Elsevier, 2006, pp.697-712. ⟨hal-00307147⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Could any graph be turned into a small-world?. Theoretical Computer Science, Elsevier, 2006, 355, pp.96--103. ⟨hal-00307150⟩
  • Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. Journal of Graph Algorithms and Applications, Brown University, 2005, 9, pp.185--204. ⟨hal-00307594⟩
  • Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc. Searching with mobile agents in networks with liars. Discrete Applied Mathematics, Elsevier, 2004, 137, pp.69--85. ⟨hal-00307259⟩

Conference papers49 documents

  • Nicolas Hanusse, David Ilcinkas, Antonin Lentz. Framing Algorithms for Approximate Multicriteria Shortest Paths. 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩. ⟨hal-03034585⟩
  • Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers. Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par 2020 - 26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. ⟨10.1007/978-3-030-57675-2_23⟩. ⟨hal-02486218v3⟩
  • Noël Gillet, Nicolas Hanusse, Frédéric Lalanne. Impact de la réplication sur la latence dans les bases de données distribuées et application à Cassandra. ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01517186⟩
  • Noël Gillet, Nicolas Hanusse. Algorithme distribué d'orientation de graphes dans un environnement asynchrone et avec pannes. ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01517177⟩
  • Alexandre Perrot, Romain Bourqui, Nicolas Hanusse, David Auber. HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark Streaming. IV2017 - 21st International Conference on Information Visualisation, Jul 2017, Londres, United Kingdom. ⟨hal-01516888⟩
  • Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout. Computing and Summarizing the Negative Skycube . CIKM (Int. Conference on Information and Knowledge Management), Oct 2016, Indianapolis, United States. pp.1-10. ⟨hal-01347960⟩
  • Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout. Using Histograms for Skyline Size Estimation. 20th International Database Engineering & Applications Symposium (IDEAS'16), Jul 2016, Montreal, Canada. ⟨hal-01316242⟩
  • Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. Router dans Internet avec quinze entrées. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. ⟨hal-01149335v2⟩
  • Patrick Kamnang Wanko, Nicolas Hanusse, Sofian Maabout. Approches basées sur la distribution pour l’estimation de la taille du skyline. BDA: Bases de données Avancées, 2015, Ile de Proquerolles, France. ⟨hal-01274393⟩
  • Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. Brief Announcement: Routing the Internet with very few entries. PODC 2015, Jul 2015, Donostia-San Sebastián, Spain. pp.33-35, ⟨10.1145/2767386.2767449⟩. ⟨hal-01195778⟩
  • Alexandre Perrot, Romain Bourqui, Nicolas Hanusse, Frédéric Lalanne, David Auber. Large Interactive Visualization of Density Functions on Big Data Infrastructure. 5th IEEE Symposium on Large Data Analysis and Visualization, IEEE, Oct 2015, Chicago, United States. ⟨hal-01188721⟩
  • Christian Glacet, Nicolas Hanusse, David Ilcinkas. Impact de la dynamique sur la fiabilité d'informations de routage. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4. ⟨hal-00985637⟩
  • Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout, Carlos Ordonez. Les Dépendances Fonctionnelles pour l’Optimisation des Requêtes Skyline Multi-dimensionnelle. BDA: Bases de Données Avancées, 2014, Autrans, France. ⟨hal-01274391⟩
  • Eve Garnaud, Nicolas Hanusse, Sofian Maabout, Noël Novelli. Parallel Mining of Dependencies. The 2014 International Conference on High Performance Computing & Simulation (HPCS 2014, Jul 2014, Bologne, Italy. pp.1-8. ⟨hal-01010968⟩
  • Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen. Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2014), Sep 2014, Paderborn, Germany. pp.120 - 134, ⟨10.1007/978-3-319-11764-5_9⟩. ⟨hal-01111188⟩
  • Eve Garnaud, Nicolas Hanusse, Sofian Maabout, Noël Novelli. Calcul parallèle de dépendances. Bases de Données Avancées, Oct 2013, Nantes, France. pp.1-20. ⟨hal-00940779⟩
  • Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. Algorithme distribué de routage compact en temps optimal. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.117-120. ⟨hal-00818445v2⟩
  • Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC 2013, Oct 2013, Jérusalem, Israel. pp.418-432. ⟨hal-00851217⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations. 20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. pp.205-216. ⟨hal-00725844⟩
  • Nicolas Hanusse, Sofian Maabout. A parallel Algorithm for Computing Borders. International Conference on Information and Knowledge Managment (CIKM), Oct 2011, Glasgow, United Kingdom. pp.1639-1648. ⟨hal-00644517⟩
  • Christian Glacet, Nicolas Hanusse, David Ilcinkas. The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011, Dec 2011, Toulouse, France. pp.378-391, ⟨10.1007/978-3-642-25873-2_26⟩. ⟨hal-00652051⟩
  • Nicolas Hanusse, Sofian Maabout, Radu Tofan. Revisiting the Partial Data Cube Materialization. Conference on Advances in Data Bases and Information Systems (ADBIS), Sep 2011, Vienne, Austria. pp.70-83. ⟨hal-00644526⟩
  • Ioannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim. On Power-Law Distributed Balls in Bins and its Applications to View Size Estimation. ISAAC, Dec 2011, Yokohama, Japan. ⟨inria-00618785⟩
  • Nicolas Hanusse, Sofian Maabout. Un algorithme parallèle pour l'extraction des bordures. BDA'10 : Actes des 26èmes Journées Bases de Données Avancées, Oct 2010, France. 11 p. ⟨hal-00548847⟩
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. Comment battre la marche aléatoire en comptant ?. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. ⟨inria-00475863⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas, Ljubomir Perkovic. Comment résumer le plan. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. ⟨inria-00476151⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. Plane Spanners of Maximum Degree Six. ICALP, 2010, France. pp.19-30, ⟨10.1007/978-3-642-14165-2_3⟩. ⟨hal-00534212⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010, Jun 2010, Greece. pp.266--278, ⟨10.1007/978-3-642-16926-7_25⟩. ⟨hal-00536710⟩
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. Locating a Target with an Agent Guided by Unreliable Local Advice. PODC 2010, Jul 2010, Zurich, Switzerland. pp.355-364, ⟨10.1145/1835698.1835781⟩. ⟨hal-00516695⟩
  • Nicolas Hanusse, Sofian Maabout, Radu Tofan. Algorithme distribué pour l'extraction des fréquents maximaux. Algotel, 2009, Carry-Le-Rouet, France. ⟨inria-00385104⟩
  • Nicolas Hanusse, Sofian Maabout, Radu Tofan. Algorithmes pour la sélection de vues à matérialiser avec garantie de performance. 5ème journées francophones sur les entrepôts de données et l'analyse en ligne (EDA'09), Jun 2009, Montpellier, France. pp.1-15. ⟨hal-00375595⟩
  • Nicolas Hanusse, Sofian Maabout, Radu Tofan. A view selection algorithm with performance guarantee. International Conference on Extending Database Technology, 2009, St Petersburg, Russia. pp.électronique. ⟨hal-00341475⟩
  • Nicolas Hanusse, Sofian Maabout, Radu Tofan. Matérialisation Partielle des Cubes de Données. 25èmes journées "Bases de Données Avancées" BDA'09, Oct 2009, Namur, Belgique. pp.1-20. ⟨hal-00403358⟩
  • Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, et al.. Euler Tour Lock-in Problem in the Rotor-Router Model. DISC 2009, Sep 2009, Spain. pp.421--433. ⟨hal-00402749⟩
  • A. Don, Nicolas Hanusse. Content-based image retrieval using greedy routing. Electronic Imaging - Multimedia Content Access Track, 2008, San José, United States. pp.68200I1-6820I11. ⟨hal-00307538⟩
  • Philippe Duchon, Nicole Eggemann, Nicolas Hanusse. Non-searchability of random power-law graphs. 11th International Conference On Principles Of Distributed Systems (OPODIS 2007), 2007, France. pp.274--285. ⟨hal-00307148⟩
  • Philippe Duchon, Nicole Eggemann, Nicolas Hanusse. Non-searchability of random scale-free graphs. PODC'2007, 2007, France. pp.380-381, ⟨10.1145/1281100.1281183⟩. ⟨hal-00341490⟩
  • Philippe Duchon, Nicole Eggemann, Nicolas Hanusse. Non-Searchability of Random Scale-Free Graphs. 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.27-30. ⟨inria-00176940⟩
  • A. Don, Nicolas Hanusse. A Deterministic Multidimensional Scaling Algorithm for Data Visualization. IEEE IV2006 - International Conference on Information Visualization, Jul 2006, Japan. pp.511-520. ⟨hal-00307537⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Towards Small World Emergence. SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2006, United States. pp.225-232. ⟨hal-00307149⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Could any graph be turned into a small world ?. International Symposium on Distributed Computing (DISC), 2005, France. pp.511-513. ⟨hal-00307531⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Could any graph be turned into a small-world ?. Actes d'AlgoTel'2005 (conférence francophone sur les algorithmes de communications), May 2005, France. pp.511-513. ⟨hal-00307532⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, D. Poulalhon, Gilles Schaeffer. Planar Graphs, via Well-Orderly Maps and Trees. $30^$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2004, Germany. pp.270-284. ⟨hal-00307603⟩
  • Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil. Protocoles auto-stabilisants synchrones d'exclusion mutuelle pour les anneaux anonymes et uniformes. Actes d'AlgoTel 2004, May 2004, France. pp.135--140. ⟨hal-00307529⟩
  • Philippe Duchon, Nicolas Hanusse, Nasser Saheb-Djahromi, Akka Zemmari. Broadcast in the Rendezvous Model. Proceedings of STACS 2004, 2004, France. pp.559--570. ⟨hal-00307528⟩
  • Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil. Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. Proceedings of DISC'2004, Oct 2004, Netherlands. pp.216--229. ⟨hal-00307527⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. $20^$ Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003, Germany. pp.499-510. ⟨hal-00307599⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. $29^$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2003, Netherlands. pp.81-92. ⟨hal-00307598⟩
  • Nicolas Hanusse, Dimitris Kavvadias, Evangelos Kranakis, Danny Krizanc. Memoryless Search Algorithm in Networks with Faulty Advice. IFIP-WCC'2002 (World Computer Congress); Track - International Conference on Theoretical Computer Science, 2002, Canada. pp.206-216. ⟨hal-00307260⟩

Book sections1 document

  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Dehmer, Matthias and Emmert-Streib, Frank and Mehler, Alexander. Towards an Information Theory of Complex Networks, Birkhäuser Boston, pp.17-46, 2011, 978-0-8176-4904-3. ⟨hal-00649898⟩

Other publications3 documents

  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations. 2012. ⟨hal-00725842⟩
  • Christian Glacet, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas, Frédéric Majorczyk. Simulations de routage du schéma AGMaNT. 2011. ⟨hal-00998994⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. Planar Graphs, via Well-Orderly Maps and Trees. 2004. ⟨hal-00400503⟩

Preprints, Working Papers, ...1 document

  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. 2010. ⟨hal-00454565⟩

Reports5 documents

  • Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen. Disconnected components detection and rooted shortest-path tree maintenance in networks - extended version. [Research Report] LaBRI, CNRS UMR 5800. 2016. ⟨hal-01352245⟩
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations. 2012. ⟨hal-00673187v2⟩
  • Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse. How to beat the random walk when you have a clock?. [Research Report] RR-7210, INRIA. 2010, pp.19. ⟨inria-00458808⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. A fully distributed scheme to run a network into a small world. [Research Report] LIP RR-2006-03, Laboratoire de l'informatique du parallélisme. 2006, 2+13p. ⟨hal-02102237⟩
  • Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Could any graph be turned into a small-world?. [Research Report] LIP RR-2004-61, Laboratoire de l'informatique du parallélisme. 2004, 2+7p. ⟨hal-02101877⟩

Habilitation à diriger des recherches1 document

  • Nicolas Hanusse. Navigation dans les grands graphes. Algorithme et structure de données [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2009. ⟨tel-00717765⟩