Nicolas Hanusse

	2012
32		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic: The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations CoRR abs/1202.5127: (2012)
	2011
31		Nicolas Hanusse, Sofian Maabout, Radu Tofan: Revisiting the Partial Data Cube Materialization. ADBIS 2011: 70-83
30		Nicolas Hanusse, Sofian Maabout: A parallel algorithm for computing borders. CIKM 2011: 1639-1648
29		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
28		Christian Glacet, Nicolas Hanusse, David Ilcinkas: The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391
27		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
26		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic: Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30
25		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
24		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278
	2009
23		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
22		Nicolas Hanusse, Sofian Maabout, Radu Tofan: A view selection algorithm with performance guarantee. EDBT 2009: 946-957
	2008
21		Cyril Gavoille, Nicolas Hanusse: On Compact Encoding of Pagenumber. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
20		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
19		Philippe Duchon, Nicole Eggemann, Nicolas Hanusse: Non-Searchability of Random Power-Law Graphs. OPODIS 2007: 274-285
18		Philippe Duchon, Nicole Eggemann, Nicolas Hanusse: Non-searchability of random scale-free graphs. PODC 2007: 380-381
	2006
17		Anthony Don, Nicolas Hanusse: A Deterministic Multidimensional Scaling Algorithm for Data Visualisation. IV 2006: 511-520
16		Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel: Towards small world emergence. SPAA 2006: 225-232
15		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer: Planar Graphs, via Well-Orderly Maps and Trees. Graphs and Combinatorics 22(2): 185-202 (2006)
14		Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari: Broadcast in the rendezvous model. Inf. Comput. 204(5): 697-712 (2006)
13		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)
	2005
12		Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel: Could any Graph be Turned into a Small-World?. DISC 2005: 511-513
11		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)
	2004
10		Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil: Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. DISC 2004: 216-229
9		Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari: Broadcast in the Rendezvous Model. STACS 2004: 559-570
8		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer: Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284
7		Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc: Searching with mobile agents in networks with liars. Discrete Applied Mathematics 137(1): 69-85 (2004)
	2003
6		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510
5		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92
	2002
4		Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc: Memoryless Search Algorithms in a Network with Faulty Advice. IFIP TCS 2002: 206-216
	2000
3		Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin: Flipping your Lid. CCCG 2000
2		Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc: Searching with Mobile Agents in Networks with Liars. Euro-Par 2000: 583-590
	1999
1		Cyril Gavoille, Nicolas Hanusse: Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360

Coauthor Index

1	Hee-Kap Ahn	[3]
2	Ioannis Atsonios	[29]
3	Evangelos Bampas	[23]
4	Olivier Beaumont	[29]
5	Nicolas Bonichon	[5] [6] [8] [11] [15] [24] [26] [27] [32]
6	Prosenjit Bose	[3]
7	Jurek Czyzowicz	[3]
8	Anthony Don	[17]
9	Philippe Duchon	[9] [10] [12] [13] [14] [16] [18] [19]
10	Nicole Eggemann	[18] [19]
11	Leszek Gasieniec	[23]
12	Cyril Gavoille	[1] [5] [6] [8] [11] [15] [21] [24] [26] [27] [32]
13	Christian Glacet	[28]
14	David Ilcinkas	[23] [24] [25] [28]
15	Dimitris J. Kavvadias	[4] [20]
16	Yusik Kim	[29]
17	Ralf Klasing	[23]
18	Adrian Kosowski	[23] [25]
19	Evangelos Kranakis	[2] [3] [4] [7] [20]
20	Danny Krizanc	[2] [4] [7] [20]
21	Emmanuelle Lebhar	[12] [13] [16]
22	Sofian Maabout	[22] [30] [31]
23	Pat Morin	[3]
24	Nicolas Nisse	[25]
25	Ljubomir Perkovic	[26] [32]
26	Dominique Poulalhon	[8] [15]
27	Nasser Saheb-Djahromi (Nasser Saheb)	[9] [14]
28	Nicolas Schabanel	[12] [13] [16]
29	Gilles Schaeffer	[8] [15]
30	Sébastien Tixeuil	[10]
31	Radu Tofan	[22] [31]
32	Akka Zemmari	[9] [14]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page