Nicolas Hanusse

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
30Revisiting the Partial Data Cube Materialization. Nicolas Hanusse, Sofian Maabout, Radu Tofan. ADBIS 2011, 70-83. Web SearchBibTeXDownload
29A parallel algorithm for computing borders. Nicolas Hanusse, Sofian Maabout. CIKM 2011, 1639-1648. Web SearchBibTeXDownload
28On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation. Ioannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim. ISAAC 2011, 504-513. Web SearchBibTeXDownload
27The Impact of Edge Deletions on the Number of Errors in Networks. Christian Glacet, Nicolas Hanusse, David Ilcinkas. OPODIS 2011, 378-391. Web SearchBibTeXDownload
2010
26Plane Spanners of Maximum Degree Six. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. ICALP (1) 2010, 19-30. Web SearchBibTeXDownload
25Locating 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, 355-364. Web SearchBibTeXDownload
24Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. WG 2010, 266-278. Web SearchBibTeXDownload
2009
23Euler Tour Lock-In Problem in the Rotor-Router Model. Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski. DISC 2009, 423-435. Web SearchBibTeXDownload
22A view selection algorithm with performance guarantee. Nicolas Hanusse, Sofian Maabout, Radu Tofan. EDBT 2009, 946-957. Web SearchBibTeXDownload
2008
21On Compact Encoding of Pagenumber. Cyril Gavoille, Nicolas Hanusse. Discrete Mathematics & Theoretical Computer Science (10) (2008). Web SearchBibTeXDownload
20Memoryless search algorithms in a network with faulty advice. Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc. Theor. Comput. Sci. (402): 190-198 (2008). Web SearchBibTeXDownload
2007
19Non-Searchability of Random Power-Law Graphs. Philippe Duchon, Nicole Eggemann, Nicolas Hanusse. OPODIS 2007, 274-285. Web SearchBibTeXDownload
18Non-searchability of random scale-free graphs. Philippe Duchon, Nicole Eggemann, Nicolas Hanusse. PODC 2007, 380-381. Web SearchBibTeXDownload
2006
17Planar Graphs, via Well-Orderly Maps and Trees. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. Graphs and Combinatorics (22): 185-202 (2006). Web SearchBibTeXDownload
16Broadcast in the rendezvous model. Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari. Inf. Comput. (204): 697-712 (2006). Web SearchBibTeXDownload
15A Deterministic Multidimensional Scaling Algorithm for Data Visualisation. Anthony Don, Nicolas Hanusse. IV 2006, 511-520. Web SearchBibTeXDownload
14Towards small world emergence. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. SPAA 2006, 225-232. Web SearchBibTeXDownload
13Could any graph be turned into a small-world?. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Theor. Comput. Sci. (355): 96-103 (2006). Web SearchBibTeXDownload
2005
12Could any Graph be Turned into a Small-World?. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. DISC 2005, 511-513. Web SearchBibTeXDownload
11Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. J. Graph Algorithms Appl. (9): 185-204 (2005). Web SearchBibTeXDownload
2004
10Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil. DISC 2004, 216-229. Web SearchBibTeXDownload
9Searching with mobile agents in networks with liars. Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc. Discrete Applied Mathematics (137): 69-85 (2004). Web SearchBibTeXDownload
8Broadcast in the Rendezvous Model. Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari. STACS 2004, 559-570. Web SearchBibTeXDownload
7Planar Graphs, via Well-Orderly Maps and Trees. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. WG 2004, 270-284. Web SearchBibTeXDownload
2003
6An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. STACS 2003, 499-510. Web SearchBibTeXDownload
5Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. WG 2003, 81-92. Web SearchBibTeXDownload
2002
4Memoryless Search Algorithms in a Network with Faulty Advice. Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc. IFIP TCS 2002, 206-216. Web SearchBibTeX
2000
3Flipping your Lid. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin. CCCG 2000. Web SearchBibTeXDownload
2Searching with Mobile Agents in Networks with Liars. Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc. Euro-Par 2000, 583-590. Web SearchBibTeXDownload
1999
1Compact Routing Tables for Graphs of Bounded Genus. Cyril Gavoille, Nicolas Hanusse. ICALP 1999, 351-360. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research