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

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

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

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)

This list was generated on Tue Apr 23 00:34:13 2019 CEST.