| 2012 | ||
|---|---|---|
| 33 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons CoRR abs/1204.3850: (2012) | |
| 2011 | ||
| 32 | Markus Bohlin, Holger Flier, Jens Maue, Matús Mihalák: Track Allocation in Freight-Train Classification with Mixed Tracks. ATMOS 2011: 38-51 | |
| 31 | Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer: On the Complexity of the Metric TSP under Stability Considerations. SOFSEM 2011: 382-393 | |
| 30 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 | |
| 29 | Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych: Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166 | |
| 28 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) | |
| 27 | Yann Disser, Matús Mihalák, Peter Widmayer: A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011) | |
| 2010 | ||
| 26 | Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych: Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73 | |
| 25 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 | |
| 24 | Matús Mihalák, Jan Christoph Schlegel: The Price of Anarchy in Network Creation Games Is (Mostly) Constant. SAGT 2010: 276-287 | |
| 23 | Yann Disser, Matús Mihalák, Peter Widmayer: Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24 | |
| 22 | Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14-15): 1626-1637 (2010) | |
| 2009 | ||
| 21 | Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 | |
| 20 | Anvesh Komuravelli, Matús Mihalák: Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. SSS 2009: 458-471 | |
| 19 | Thomas Erlebach, Matús Mihalák: A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA 2009: 135-146 | |
| 18 | Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer: Shunting for Dummies: An Introductory Algorithmic Survey. Robust and Online Large-Scale Optimization 2009: 310-337 | |
| 2008 | ||
| 17 | Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124 | |
| 16 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329 | |
| 15 | Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer: Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 | |
| 14 | Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 | |
| 13 | Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 | |
| 12 | Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Angle Optimization in Target Tracking. SWAT 2008: 65-76 | |
| 11 | Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty CoRR abs/0802.2855: (2008) | |
| 2007 | ||
| 10 | Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45 | |
| 9 | Thomas Erlebach, Alexander Hall, Matús Mihalák: Approximate Discovery of Random Graphs. SAGA 2007: 82-92 | |
| 8 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) | |
| 2006 | ||
| 7 | Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14 | |
| 6 | Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák: Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80 | |
| 5 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. IEEE Journal on Selected Areas in Communications 24(12): 2168-2181 (2006) | |
| 2005 | ||
| 4 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005 | |
| 3 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. WG 2005: 127-138 | |
| 2004 | ||
| 2 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 | |
| 1 | Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: Joint Base Station Scheduling. WAOA 2004: 225-238 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page