TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 41.

Birx, A. ; Disser, Y. ; Hopp, A. ; Karousatou, C. (2021):
An Improved Lower Bound for Competitive Graph Exploration.
In: Theoretical Computer Science, 868, pp. 65-86. Elsevier, ISSN 0304-3975,
DOI: 10.1016/j.tcs.2021.04.003,
[Article]

Disser, Y. ; Friedmann, O. ; Hopp, A. V. (2019):
An Exponential Lower Bound for Zadeh's pivot rule.
In: Optimization and Control, (Preprint), arXiv, 1911.01074, [Report]

Disser, Y. ; Hopp, A. V.
Lodi, A. ; Nagarajan, V. (eds.) (2019):
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
In: Lecture Notes in Computer Science, 11480, In: Integer Programming and Combinatorial Optimization, pp. 168-180,
Springer, 20th Interantional Conference on Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, USA, 22.-24.05.2019, ISBN 978-3-030-17953-3,
DOI: 10.1007/978-3-030-17953-3_13,
[Conference or Workshop Item]

Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. (2017):
Scheduling Maintenance Jobs in Networks.
In: Lecture Notes in Computer Science, 10236, In: CIAC 2017: Algorithms and Complexity, pp. 19-30,
Springer, 10th International Conference on Algorithms and Complexity, Athens, Greece, 24.-26.05.2017, ISBN 978-3-319-57585-8,
DOI: 10.1007/978-3-319-57586-5_3,
[Conference or Workshop Item]

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), [Conference or Workshop Item]

Disser, Y. ; Klimm, M. ; Megow, N. ; Stiller, S. (2017):
Packing a knapsack of unknown capacity.
In: SIAM Journal on Discrete Mathematics, 31 (3), pp. 1477-1497. [Article]

Disser, Y. ; Kratsch, S. (2017):
Robust and adaptive search.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Disser, Y. ; Skiena, S. S.
Goodman, J. E. ; O'Rourke, J. ; Tóth, C. D. (eds.) (2016):
Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry, CRC Press LLC, [Book Section]

Disser, Y. ; Matuschke, J. (2016):
Degree-constrained orientations of embedded graphs.
In: Journal of Combinatorial Optimization, 3, pp. 758-773. [Article]

Böhmová, K. ; Disser, Y. ; Mihalák, M. ; Sramek, R. (2016):
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
pp. 220–234, Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN), [Conference or Workshop Item]

Disser, Y. ; Hackfeld, J. ; Klimm, M. (2016):
Undirected Graph Exploration with Θ(log log n) Pebbles.
pp. 25-39, Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), [Conference or Workshop Item]

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2015):
Fast Collaborative Graph Exploration.
In: Information and Computation, 243, pp. 37-49. [Article]

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, pp. 557-564. [Article]

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), [Conference or Workshop Item]

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, pp. 33(16). [Article]

Disser, Y. ; Mihalák, M. ; Montanari, S. (2015):
Max Shortest Path for Imprecise Points.
Proceedings of the 30th European Workshop on Computational Geometry (EuroCG), [Conference or Workshop Item]

Disser, Y. ; Klimm, M. ; Lübbecke, E. (2015):
Scheduling Bidirectional Traffic on a Path.
pp. 406–418, Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), [Conference or Workshop Item]

Disser, Y. ; Skutella, M. (2015):
The Simplex Algorithm is NP-mighty.
In: Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 858-872,
SIAM, 26th ACM-SIAM Symposium on Discrete Algorithms, San Diego, USA, 04.-06.01.2015, ISBN 978-1-61197-374-7,
DOI: 10.1137/1.9781611973730.59,
[Conference or Workshop Item]

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2014):
Mapping a polygon with holes using a compass.
In: Theoretical Computer Science, 553, pp. 106-113. [Article]

Disser, Y. ; Kratsch, S. ; Sorge, M. (2014):
The Minimum Feasible Tileset Problem.
In: Lecture Notes in Computer Science, 8952, In: Approximation and Online Algorithms, pp. 144-155,
Springer, 12th Workshop on Approximation and Online Algorithms (WAOA 2014), Wrolaw, Poland, 11.-12.09.2014, ISBN 978-3-319-18262-9,
DOI: 10.1007/978-3-319-18263-6_13,
[Conference or Workshop Item]

Disser, Y. ; Megow, N. ; Klimm, M. ; Stiller, S. (2014):
Packing a Knapsack of Unknown Capacity.
pp. 276-287, Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Montanari, S. ; Widmayer, P. (2014):
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
pp. 208-220, Proceedings of the International Symposium on Combinatorial Optimization (ISCO), [Conference or Workshop Item]

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2013):
Fast Collaborative Graph Exploration.
p. 520, Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), [Conference or Workshop Item]

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.
pp. 158-169, Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), [Conference or Workshop Item]

Böhmová, K. ; Disser, Y. ; Widmayer, P. ; Mihalák, M. (2013):
Interval Selection with Machine-Dependent Intervals.
pp. 170-181, Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS), [Conference or Workshop Item]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013):
Mapping Simple Polygons: How Robots Benefit from Looking Back.
In: Algorithmica, 65, pp. 43-59. [Article]

Bilò, D. ; Disser, Y. ; Gualà, L. ; Mihalák, M. ; Proietti, G. ; Widmayer, P. (2013):
Polygon-Constrained Motion Planning Problems.
pp. 67-82, Proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), [Conference or Workshop Item]

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, pp. 1287-1307. [Article]

Disser, Y. ; Matuschke, J. (2012):
Degree-constrained orientations of embedded graphs.
pp. 506-516, Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), [Conference or Workshop Item]

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2012):
Mapping a polygon with holes using a compass.
pp. 78-89, Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2012):
Mapping polygons with agents that measure angles.
pp. 415-425, Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR), [Conference or Workshop Item]

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, pp. 52-59. [Article]

Disser, Y. (2011):
Mapping Polygons.
Logos Berlin, ETH Zurich,
[Ph.D. Thesis]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011):
Telling convex from reflex allows to map a polygon.
pp. 153-164, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011):
A polygon is determined by its angles.
In: Computational Geometry: Theory and Applications, 44, pp. 418-426. [Article]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010):
How Simple Robots Benefit from Looking Back.
pp. 229-239, Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010):
Reconstructing a simple polygon from its angles.
pp. 13-24, Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), [Conference or Workshop Item]

Disser, Y. ; Bilò, D. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009):
On the Limitations of Combinatorial Visibilities.
pp. 207-210, Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), [Conference or Workshop Item]

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009):
Reconstructing Visibility Graphs with Simple Robots.
pp. 87-99, Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), [Conference or Workshop Item]

Wilms, J. ; Disser, Y. ; Alber, G. ; Percival, I. C. (2008):
Local Realism, Detection Efficiencies, and Probability Polytopes.
In: Physical Review A, 78 (3), APS Physics, ISSN 2469-9926,
DOI: 10.1103/PhysRevA.78.032116,
[Article]

Disser, Y. ; Müller-Hannemann, M. ; Schnee, M. (2008):
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
pp. 347 - 361, Proceedings of the 7th International Workshop on Experimental Algorithms (WEA), [Conference or Workshop Item]

This list was generated on Sat Oct 1 01:40:48 2022 CEST.