Englisch

Böhmová, K. ; Disser, Y. ; Mihalák, M. ; Sramek, R. (2016)
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Feldmann, A. ; Klimm, M. ; Mihalák, M. (2015)
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In: Theoretical Computer Science, 562
Artikel, Bibliographie

Böhmová, K. ; Disser, Y. ; Kravina, E. ; Mihalák, M. ; Widmayer, P. (2015)
Interval Selection on Unrelated Machines.
Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP).
Konferenzveröffentlichung, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2015)
Mapping simple polygons: The power of telling convex from reflex.
In: ACM Transactions on Algorithms, 11
Artikel, Bibliographie

Disser, Y. ; Mihalák, M. ; Montanari, S. (2015)
Max Shortest Path for Imprecise Points.
Proceedings of the 30th European Workshop on Computational Geometry (EuroCG).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2014)
Mapping a polygon with holes using a compass.
In: Theoretical Computer Science, 553
Artikel, Bibliographie

Disser, Y. ; Mihalák, M. ; Montanari, S. ; Widmayer, P. (2014)
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
Proceedings of the International Symposium on Combinatorial Optimization (ISCO).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Feldmann, A. ; Klimm, M. ; Mihalák, M. (2013)
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC).
Konferenzveröffentlichung, Bibliographie

Böhmová, K. ; Disser, Y. ; Widmayer, P. ; Mihalák, M. (2013)
Interval Selection with Machine-Dependent Intervals.
Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS).
Konferenzveröffentlichung, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013)
Mapping Simple Polygons: How Robots Benefit from Looking Back.
In: Algorithmica, 65
Artikel, Bibliographie

Bilò, D. ; Disser, Y. ; Gualà, L. ; Mihalák, M. ; Proietti, G. ; Widmayer, P. (2013)
Polygon-Constrained Motion Planning Problems.
Proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
Konferenzveröffentlichung, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013)
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons.
In: Discrete Applied Mathematics, 161
Artikel, Bibliographie

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2012)
Mapping a polygon with holes using a compass.
Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2012)
Mapping polygons with agents that measure angles.
Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR).
Konferenzveröffentlichung, Bibliographie

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Vicari, E. ; Suri, S. ; Widmayer, P. (2012)
Reconstructing Visibility Graphs with Simple Robots.
In: Theoretical Computer Science, 444
Artikel, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011)
Telling convex from reflex allows to map a polygon.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011)
A polygon is determined by its angles.
In: Computational Geometry: Theory and Applications, 44
Artikel, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010)
How Simple Robots Benefit from Looking Back.
Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010)
Reconstructing a simple polygon from its angles.
Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Bilò, D. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009)
On the Limitations of Combinatorial Visibilities.
Proceedings of the 25th European Workshop on Computational Geometry (EuroCG).
Konferenzveröffentlichung, Bibliographie

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009)
Reconstructing Visibility Graphs with Simple Robots.
Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO).
Konferenzveröffentlichung, Bibliographie