default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Hanusse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c38]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC 2024: 9:1-9:16- [i2]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L1 has Wake-up Time Five. CoRR abs/2402.03258 (2024) - 2021
- [c37]Yassine Faize, Jérémie Crenne, Nicolas Hanusse, Christophe Jégo:
An Energy Efficient and Scalable Node Architecture for Sensor Network. NEWCAS 2021: 1-4 - 2020
- [j16]Karim Alami
, Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout:
The negative skycube. Inf. Syst. 88 (2020) - [c36]Nicolas Hanusse, David Ilcinkas, Antonin Lentz:
Framing Algorithms for Approximate Multicriteria Shortest Paths. ATMOS 2020: 11:1-11:19 - [c35]Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers:
Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par 2020: 359-375
2010 – 2019
- 2019
- [j15]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. 132: 299-309 (2019) - 2017
- [j14]Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - [j13]Patrick Kamnang Wanko, Sofian Maabout, Nicolas Hanusse:
Calculer et compresser le skycube négatif. Ingénierie des Systèmes d Inf. 22(3): 9-33 (2017) - [c34]Alexandre Perrot, Romain Bourqui, Nicolas Hanusse, David Auber:
HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark Streaming. IV 2017: 66-71 - [c33]Noël Gillet, Nicolas Hanusse:
A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation. SSS 2017: 308-322 - 2016
- [j12]Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout:
Approches basées sur la distribution pour l'estimation de la taille du skyline. Ingénierie des Systèmes d Inf. 21(3): 119-140 (2016) - [j11]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci. 627: 1-12 (2016) - [j10]Sofian Maabout, Carlos Ordonez, Patrick Kamnang Wanko, Nicolas Hanusse:
Skycube Materialization Using the Topmost Skyline or Functional Dependencies. ACM Trans. Database Syst. 41(4): 25:1-25:40 (2016) - [c32]Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout:
Computing and Summarizing the Negative Skycube. CIKM 2016: 1733-1742 - [c31]Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout:
Using Histograms for Skyline Size Estimation. IDEAS 2016: 125-134 - 2015
- [j9]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Tight stretch factors for L1- and L∞-Delaunay triangulations. Comput. Geom. 48(3): 237-250 (2015) - [j8]Nicolas Hanusse, Patrick Kamnang Wanko, Sofian Maabout, Carlos Ordonez:
Dépendances fonctionnelles et requêtes skyline multidimensionnelles. Ingénierie des Systèmes d Inf. 20(5): 9-26 (2015) - [c30]Alexandre Perrot, Romain Bourqui, Nicolas Hanusse, Frédéric Lalanne, David Auber:
Large interactive visualization of density functions on big data infrastructure. LDAV 2015: 99-106 - [c29]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
Brief Announcement: Routing the Internet with Very Few Entries. PODC 2015: 33-35 - 2014
- [c28]Eve Garnaud, Nicolas Hanusse, Sofian Maabout, Noël Novelli:
Parallel mining of dependencies. HPCS 2014: 491-498 - [c27]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS 2014: 120-134 - 2013
- [c26]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC 2013: 418-432 - 2012
- [c25]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA 2012: 205-216 - [i1]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L1- and L∞-Delaunay Triangulations. CoRR abs/1202.5127 (2012) - 2011
- [c24]Nicolas Hanusse, Sofian Maabout, Radu Tofan:
Revisiting the Partial Data Cube Materialization. ADBIS 2011: 70-83 - [c23]Nicolas Hanusse, Sofian Maabout:
A parallel algorithm for computing borders. CIKM 2011: 1639-1648 - [c22]Ioannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim:
On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation. ISAAC 2011: 504-513 - [c21]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391 - [p1]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Towards an Information Theory of Complex Networks 2011: 17-46 - 2010
- [c20]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30 - [c19]Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse:
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC 2010: 355-364 - [c18]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas:
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278
2000 – 2009
- 2009
- [b1]Nicolas Hanusse:
Navigation dans les grands graphes. University of Bordeaux, France, 2009 - [c17]Nicolas Hanusse, Sofian Maabout, Radu Tofan:
Algorithmes pour la sélection de vues à matérialiser avec garantie de performance. EDA 2009: 107-122 - [c16]Nicolas Hanusse, Sofian Maabout, Radu Tofan:
A view selection algorithm with performance guarantee. EDBT 2009: 946-957 - [c15]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 - 2008
- [j7]Cyril Gavoille, Nicolas Hanusse:
On Compact Encoding of Pagenumber. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j6]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
- [c14]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-Searchability of Random Power-Law Graphs. OPODIS 2007: 274-285 - [c13]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-searchability of random scale-free graphs. PODC 2007: 380-381 - 2006
- [j5]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22(2): 185-202 (2006) - [j4]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari:
Broadcast in the rendezvous model. Inf. Comput. 204(5): 697-712 (2006) - [j3]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) - [c12]Anthony Don, Nicolas Hanusse:
A Deterministic Multidimensional Scaling Algorithm for Data Visualisation. IV 2006: 511-520 - [c11]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Towards small world emergence. SPAA 2006: 225-232 - 2005
- [j2]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) - [c10]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any Graph be Turned into a Small-World?. DISC 2005: 511-513 - 2004
- [j1]Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc:
Searching with mobile agents in networks with liars. Discret. Appl. Math. 137(1): 69-85 (2004) - [c9]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari:
Broadcast in the Rendezvous Model. STACS 2004: 559-570 - [c8]Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil:
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. DISC 2004: 216-229 - [c7]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284 - 2003
- [c6]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510 - [c5]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92 - 2002
- [c4]Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice. IFIP TCS 2002: 206-216 - 2000
- [c3]Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin:
Flipping your Lid. CCCG 2000 - [c2]Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc:
Searching with Mobile Agents in Networks with Liars. Euro-Par 2000: 583-590
1990 – 1999
- 1999
- [c1]Cyril Gavoille, Nicolas Hanusse:
Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
