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: 49.

Birx, Alexander and Disser, Y. (2020):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
In: SIAM Journal on Discrete Mathematics, (2), 34. Society for Industrial and Applied Mathematics, pp. 1409-1443, ISSN 0895-4801,
DOI: 10.1137/19M1268513,
[Online-Edition: https://epubs.siam.org/doi/10.1137/19M1268513],
[Article]

Disser, Y. and Friedmann, O. and Hopp, A. V. (2019):
An Exponential Lower Bound for Zadeh's pivot rule.
(Preprint), In: Optimization and Control, arXiv, 1911.01074, [Online-Edition: https://arxiv.org/abs/1911.01074v1],
[Report]

KhudaBukhsh, W. R. and Auddy, A. and Disser, Y. and Koeppl, H. (2019):
Approximate Lumpability for Markovian Agent-based Models Using Local Symmetries.
In: Jounal of Applied Probability, 56 (3), Cambridge University Press, pp. 647-671, DOI: 10.1017/jpr.2019.44,
[Online-Edition: https://www.cambridge.org/core/journals/journal-of-applied-p...],
[Article]

Birx, Alexander and Disser, Y. and Schewior, Kevin Achlioptas, Dimitris and Végh‬, ‪László (eds.) (2019):
Improved Bounds for Open Online Dial-a-Ride on the Line.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, In: 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2019), Cambridge, USA, September 20-22, 2019, pp. 21:1-21:22, ISBN 978-3-95977-125-2,
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.21,
[Online-Edition: https://drops.dagstuhl.de/opus/portals/lipics/index.php?semn...],
[Conference or Workshop Item]

Birx, Alexander and Disser, Y. Niedermeier, Rolf and Paul, Christophe (eds.) (2019):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 13.-16.03., pp. 15:1-15:17, ISBN 978-3-95977-100-9,
DOI: 10.4230/LIPIcs.STACS.2019.15,
[Online-Edition: https://drops.dagstuhl.de/opus/portals/lipics/index.php?semn...],
[Conference or Workshop Item]

Disser, Y. and Hopp, A.V. Lodi, A. and Nagarajan, V. (eds.) (2019):
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
In: LNCS, In: Integer Programming and Combinatorial Optimization, Heidelberg, Springer, pp. 168-180, DOI: 10.1007/978-3-030-17953-3_13,
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/6873],
[Book Section]

Disser, Y. and Mousset, Frank and Noever, Andreas and Škorić, Nemanja and Steger, Angelika (2017):
A general lower bound for collaborative tree exploration.
In: Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Porquerolles, France, 19-22 June 2017, [Conference or Workshop Item]

Bärtschi, A. and Chalopin, J. and Das, S. and Disser, Y. and Geissmann, B. and Graf, D. and Labourel, A. and Mihalák, M. (2017):
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Theoretical Computer Science, 810pp. 2-14, [Article]

Bärtschi, A. and Chalopin, J. and Das, S. and Disser, Y. and Graf, D. and Hackfeld, J. and Penna, P. (2017):
Energy-efficient Delivery by Heterogenous Mobile Agents.
In: Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Bernstein, A. and Disser, Y. and Groß, M. (2017):
General Bounds for Incremental Maximization.
In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), [Conference or Workshop Item]

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

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

Abed, F. and Chen, L. and Disser, Y. and Groß, M. and Megow, N. and Meißner, J. and Richter, A. and Rischke, R. (2017):
Scheduling Maintenance Jobs in Networks.
In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), [Conference or Workshop Item]

Bjelde, A. and Disser, Y. and Hackfeld, J. and Hansknecht, C. and Lipmann, M. and Meißner, J. and Schewior, K. and Schlöter, M. and Stougie, L. (2017):
Tight bounds for online TSP on the line.
In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), [Conference or Workshop Item]

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

Bärtschi, A. and Chalopin, J. and Das, S. and Disser, Y. and Geissmann, B. and Graf, D. and Labourel, A. and Mihalák, M. (2016):
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), [Conference or Workshop Item]

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

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

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

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

Disser, Y. and Feldmann, A. and Klimm, M. and Mihalák, M. (2015):
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In: Theoretical Computer Science, 562pp. 557-564, [Article]

Böhmová, K. and Disser, Y. and Kravina, E. and Mihalák, M. and Widmayer, P. (2015):
Interval Selection on Unrelated Machines.
In: Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), [Conference or Workshop Item]

Chalopin, J. and Das, S. and Disser, Y. and Mihalák, M. and Widmayer, P. (2015):
Mapping simple polygons: The power of telling convex from reflex.
In: ACM Transactions on Algorithms, 11pp. 33(16), [Article]

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

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

Disser, Y. and Skutella, M. (2015):
The Simplex Algorithm is NP-mighty.
In: Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 858-872, [Conference or Workshop Item]

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

Disser, Y. and Kratsch, S. and Sorge, M. (2014):
The Minimum Feasible Tileset Problem.
In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), pp. 144–155, [Conference or Workshop Item]

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

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

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

Disser, Y. and Feldmann, A. and Klimm, M. and Mihalák, M. (2013):
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In: Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), pp. 158-169, [Conference or Workshop Item]

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

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

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

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

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

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

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

Bilò, D. and Disser, Y. and Mihalák, M. and Vicari, E. and Suri, S. and Widmayer, P. (2012):
Reconstructing Visibility Graphs with Simple Robots.
In: Theoretical Computer Science, 444pp. 52-59, [Article]

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

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

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

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

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

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

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

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

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

This list was generated on Tue Oct 27 00:43:30 2020 CET.