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

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

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

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]

This list was generated on Tue Oct 27 01:32:21 2020 CET.