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

Disser, Y. and Hopp, A.V. :
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
In: 20th Conference on Integer Programming and Combinatorial Optimization (IPCO), May 22–24, 2019, Ann Arbor, Michigan, USA. Proceedings of the 20th Conference on Integer Programming and Combinatorial Optimization (IPCO)
[Conference or Workshop Item] , (2019)

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

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. :
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Theoretical Computer Science
[Article] , (2017) (In Press)

Bärtschi, A. and Chalopin, J. and Das, S. and Disser, Y. and Graf, D. and Hackfeld, J. and Penna, P. :
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] , (2017)

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

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

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

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

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. :
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] , (2017)

Disser, Y. and Skiena, S. S.
Goodman, J. E. and O'Rourke, J. and Tóth, C. D. (eds.) :

Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry. CRC Press LLC
[Book Section] , (2016) (In Press)

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. :
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] , (2016)

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

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

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

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

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

Böhmová, K. and Disser, Y. and Kravina, E. and Mihalák, M. and Widmayer, P. :
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] , (2015)

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

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

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

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

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

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

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

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

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

Disser, Y. and Feldmann, A. and Klimm, M. and Mihalák, M. :
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).
[Conference or Workshop Item] , (2013)

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

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

Bilò, D. and Disser, Y. and Gualà, L. and Mihalák, M. and Proietti, G. and Widmayer, P. :
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).
[Conference or Workshop Item] , (2013)

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

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

Disser, Y. and Ghosh, S. K. and Mihalák, M. and Widmayer, P. :
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).
[Conference or Workshop Item] , (2012)

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

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

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

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

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

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

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

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

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

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

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

This list was generated on Sat May 18 02:07:32 2019 CEST.