Yann Disser

Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013)

Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Simple agents learn to find their way: An introduction on mapping polygons. Discrete Applied Mathematics 161(10-11): 1287-1307 (2013)

Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012)

Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer: Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89

Yann Disser, Jannik Matuschke: Degree-Constrained Orientations of Embedded Graphs. ISAAC 2012: 506-516

Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. CoRR abs/1204.3850 (2012)

Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák: Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012)

Yann Disser: Mapping Polygons. ETH Zurich 2011, isbn 978-3-8325-3023-5, pp. 1-137

Yann Disser, Matús Mihalák, Peter Widmayer: A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011)

Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Telling convex from reflex allows to map a polygon. STACS 2011: 153-164

Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239

Yann Disser, Matús Mihalák, Peter Widmayer: Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24

Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99

Yann Disser, Matthias Müller-Hannemann, Mathias Schnee: Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA 2008: 347-361