direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Journal Publications

Disser, Y. and Skutella, M.
The Simplex Algorithm Is NP-Mighty [1].
ACM Transactions on Algorithms, Vol. 15, pp. 5:1–5:19, 2019.


Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F.
Distance-Preserving Graph Contractions [2].
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.


Disser, Y. and Matuschke, J.
Degree-constrained orientations of embedded graphs [3].
Journal of Combinatorial Optimization, Vol. 3, pp. 758–773, 2016.  [pdf] [4]


Disser, Y., Feldmann, A., Klimm, M. and Mihalák, M.
Improving the Hk-bound on the price of stability in undirected Shapley network design games [5].
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.  [pdf] [6]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Mapping Simple Polygons: The Power of telling Convex from Reflex [7].
ACM Transactions on Algorithms, Vol. 11, pp. 33(16), 2015.  [pdf] [8]


Dereniowski, D., Disser, Y., Kosowski, A., Pająk, D. and Uznański, P.
Fast collaborative graph exploration [9].
Information and Computation, Vol. 243, pp. 37–49, 2015.  [pdf] [10]


Disser, Y., Ghosh, S. K., Mihalák, M. and Widmayer, P.
Mapping a polygon with holes using a compass [11].
Theoretical Computer Science, Vol. 553, pp. 106–113, 2014.  [pdf] [12]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Mapping Simple Polygons: How Robots Benefit from Looking Back [13].
Algorithmica, Vol. 65, pp. 43–59, 2013.  [pdf] [14]


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons [15].
Discrete Applied Mathematics, Vol. 161, pp. 1287–1307, 2013.  [pdf] [16]


Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P.
Reconstructing Visibility Graphs with Simple Robots [17].
Theoretical Computer Science, Vol. 444, pp. 52–59, 2012.  [pdf] [18]


Disser, Y., Mihalák, M. and Widmayer, P.
A polygon is determined by its angles [19].
Computational Geometry: Theory and Applications, Vol. 44, pp. 418–426, 2011.  [pdf] [20]


Wilms, J., Disser, Y., Alber, G. and Percival, I. C.
Local Realism, Detection Efficiencies, and Probability Polytopes [21].
Physical Review A, Vol. 73, pp. 032116(8), 2008.  [pdf] [22]


Conference Publications

Collaborative Delivery with Energy-Constrained Mobile Robots
Citation key BaertschiChalopinDas+2017
Author Bärtschi, Andreas and Chalopin, Jérémie and Das, Shantanu and Disser, Yann and Geissmann, Barbara and Graf, Daniel and Labourel, Arnaud and Mihalák, Matus
Title of Book Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
Year 2017
Download Bibtex entry [23]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008