Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Matús Mihalák
2010 – today
- 2013
[j9]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013)- [j8]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. Discrete Applied Mathematics 161(10-11): 1287-1307 (2013)
- [j7]Matús Mihalák, Jan Christoph Schlegel: The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Theory Comput. Syst. 53(1): 53-72 (2013)
- [c29]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák: Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC 2013: 158-169
- [c28]Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer: Robust optimization in the presence of uncertainty. ITCS 2013: 505-514
- [i4]Matús Mihalák, Rastislav Srámek: Counting approximately-shortest paths in directed acyclic graphs. CoRR abs/1304.6707 (2013)
- 2012
- [j6]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012)
- [c27]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer: Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89
- [c26]Matús Mihalák, Jan Christoph Schlegel: Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. MFCS 2012: 693-704
- [i3]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)
- [i2]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák: Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012)
- 2011
- [j5]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)
- [j4]Yann Disser, Matús Mihalák, Peter Widmayer: A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011)
- [c25]Markus Bohlin, Holger Flier, Jens Maue, Matús Mihalák: Track Allocation in Freight-Train Classification with Mixed Tracks. ATMOS 2011: 38-51
- [c24]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
- [c23]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
- [c22]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych: Maximum Independent Set in 2-Direction Outersegment Graphs. WG 2011: 155-166
- 2010
- [j3]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)
- [c21]Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych: Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73
- [c20]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
- [c19]Matús Mihalák, Jan Christoph Schlegel: The Price of Anarchy in Network Creation Games Is (Mostly) Constant. SAGT 2010: 276-287
- [c18]Yann Disser, Matús Mihalák, Peter Widmayer: Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24
2000 – 2009
- 2009
- [c17]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99
- [c16]Anvesh Komuravelli, Matús Mihalák: Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. SSS 2009: 458-471
- [c15]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
- [p1]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
- [c14]Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124
- [c13]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
- [c12]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
- [c11]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
- [c10]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288
- [c9]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer: Angle Optimization in Target Tracking. SWAT 2008: 65-76
- [i1]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008)
- 2007
- [j2]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)
- [c8]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
- [c7]Thomas Erlebach, Alexander Hall, Matús Mihalák: Approximate Discovery of Random Graphs. SAGA 2007: 82-92
- 2006
- [j1]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)
- [c6]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
- [c5]Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák: Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80
- 2005
- [c4]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
- [c3]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
- [c2]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
- [c1]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: Joint Base Station Scheduling. WAOA 2004: 225-238
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-02 03:08 CEST by the dblp team