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.
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.
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.

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

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.
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.  [pdf]

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

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

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

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

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

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

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

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

Conference Publications

Distance-preserving graph contractions
Citation key BernsteinDaeubelDisserKlimmMuetzeSmolny2018
Author Bernstein, Aaron and Däubel, Karl and Disser, Yann and Klimm, Max and Mütze, Torsten and Smolny, Frieder
Title of Book 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Pages 51:1–51:14
Year 2018
ISBN 978-3-95977-060-6
ISSN 1868-8969
DOI 10.4230/LIPIcs.ITCS.2018.51
Volume 94
Editor Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Series Leibniz International Proceedings in Informatics (LIPIcs)
Link to original publication Download Bibtex entry

Zusatzinformationen / Extras