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

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

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

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. ; 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. ; 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. ; 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]

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. ; 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]

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]

This list was generated on Sat Oct 16 03:00:40 2021 CEST.