TU Darmstadt / ULB / TUbiblio

Browsen nach Person

Ebene hoch
Gruppiere nach: Keine Gruppierung | Typ des Eintrags | Datum | Sprache
Anzahl der Einträge: 23.

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

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

Böhmová, K. ; Disser, Y. ; Mihalák, M. ; 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).
[Konferenz- oder Workshop-Beitrag], (2016)

Disser, Y. ; Feldmann, A. ; Klimm, M. ; 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.
[Artikel], (2015)

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

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

Disser, Y. ; Mihalák, M. ; Montanari, S. :
Max Shortest Path for Imprecise Points.
In: Proceedings of the 30th European Workshop on Computational Geometry (EuroCG).
[Konferenz- oder Workshop-Beitrag], (2015)

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

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

Disser, Y. ; Feldmann, A. ; Klimm, M. ; 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).
[Konferenz- oder Workshop-Beitrag], (2013)

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

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

Bilò, D. ; Disser, Y. ; Gualà, L. ; Mihalák, M. ; Proietti, G. ; 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).
[Konferenz- oder Workshop-Beitrag], (2013)

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

Disser, Y. ; Ghosh, S.K. ; Mihalák, M. ; 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).
[Konferenz- oder Workshop-Beitrag], (2012)

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

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

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; 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).
[Konferenz- oder Workshop-Beitrag], (2011)

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

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

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

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

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

Diese Liste wurde am Sat Sep 23 07:59:43 2017 CEST generiert.