Englisch

Birx, A. ; Disser, Y. ; Hopp, A. ; Karousatou, C. (2021)
An Improved Lower Bound for Competitive Graph Exploration.
In: Theoretical Computer Science, 868
doi: 10.1016/j.tcs.2021.04.003
Artikel, Bibliographie

Disser, Y. ; Friedmann, O. ; Hopp, A. V. (2019)
An Exponential Lower Bound for Zadeh's pivot rule.
doi: 10.48550/arXiv.1911.01074
Report, Bibliographie

Disser, Y. ; Hopp, A. V.
Hrsg.: Lodi, A. ; Nagarajan, V. (2019)
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
20th Interantional Conference on Integer Programming and Combinatorial Optimization (IPCO 2019). Ann Arbor, USA (22.05.2019-24.05.2019)
doi: 10.1007/978-3-030-17953-3_13
Konferenzveröffentlichung, Bibliographie

Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. (2017)
Scheduling Maintenance Jobs in Networks.
10th International Conference on Algorithms and Complexity. Athens, Greece (24.05.2017-26.05.2017)
doi: 10.1007/978-3-319-57586-5_3
Konferenzveröffentlichung, Bibliographie

Bärtschi, A. ; Chalopin, J. ; Das, S. ; Disser, Y. ; Graf, D. ; Hackfeld, J. ; Penna, P. (2017)
Energy-efficient Delivery by Heterogenous Mobile Agents.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Klimm, M. ; Megow, N. ; Stiller, S. (2017)
Packing a knapsack of unknown capacity.
In: SIAM Journal on Discrete Mathematics, 31 (3)
Artikel, Bibliographie

Disser, Y. ; Kratsch, S. (2017)
Robust and adaptive search.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Skiena, S. S.
Hrsg.: Goodman, J. E. ; O'Rourke, J. ; Tóth, C. D. (2016)
Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry
Buchkapitel, Bibliographie

Disser, Y. ; Matuschke, J. (2016)
Degree-constrained orientations of embedded graphs.
In: Journal of Combinatorial Optimization, 3
Artikel, Bibliographie

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. ; Hackfeld, J. ; Klimm, M. (2016)
Undirected Graph Exploration with Θ(log log n) Pebbles.
Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
Konferenzveröffentlichung, Bibliographie

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2015)
Fast Collaborative Graph Exploration.
In: Information and Computation, 243
Artikel, 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. ; Klimm, M. ; Lübbecke, E. (2015)
Scheduling Bidirectional Traffic on a Path.
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Skutella, M. (2015)
The Simplex Algorithm is NP-mighty.
26th ACM-SIAM Symposium on Discrete Algorithms. San Diego, USA (04.01.2015-06.01.2015)
doi: 10.1137/1.9781611973730.59
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. ; Kratsch, S. ; Sorge, M. (2014)
The Minimum Feasible Tileset Problem.
12th Workshop on Approximation and Online Algorithms (WAOA 2014). Wrolaw, Poland (11.09.2014-12.09.2014)
doi: 10.1007/978-3-319-18263-6_13
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Megow, N. ; Klimm, M. ; Stiller, S. (2014)
Packing a Knapsack of Unknown Capacity.
Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, 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

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2013)
Fast Collaborative Graph Exploration.
Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP).
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. ; Matuschke, J. (2012)
Degree-constrained orientations of embedded graphs.
Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC).
Konferenzveröffentlichung, 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

Disser, Y. (2011)
Mapping Polygons.
Eidgenössische Technische Hochschule Zürich
Dissertation, 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

Wilms, J. ; Disser, Y. ; Alber, G. ; Percival, I. C. (2008)
Local Realism, Detection Efficiencies, and Probability Polytopes.
In: Physical Review A, 78 (3)
doi: 10.1103/PhysRevA.78.032116
Artikel, Bibliographie

Disser, Y. ; Müller-Hannemann, M. ; Schnee, M. (2008)
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
Proceedings of the 7th International Workshop on Experimental Algorithms (WEA).
Konferenzveröffentlichung, Bibliographie