×

zbMATH — the first resource for mathematics

Mihalák, Matúš

Compute Distance To:
Author ID: mihalak.matus Recent zbMATH articles by "Mihalák, Matúš"
Published as: Mihalák, Matúš; Mihal’ák, Matúš; Mihaák, Matúš; Mihalák, Matús; Mihalák, M.; Mihalak, Matus; Mihaľák, Matúš
External Links: MGP
Documents Indexed: 70 Publications since 2004, including 1 Book

Publications by Year

Citations contained in zbMATH Open

53 Publications have been cited 218 times in 165 Documents Cited by Year
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. Zbl 1148.05308
Ambühl, Christoph; Erlebach, Thomas; Mihalák, Matúš; Nunkesser, Marc
28
2006
Network discovery and verification. Zbl 1171.68587
Beerliova, Zuzana; Eberhard, Felix; Erlebach, Thomas; Hall, Alexander; Hoffmann, Michael; Mihaák, Matúš; Ram, L. Shankar
19
2005
Computing minimum spanning trees with uncertainty. Zbl 1259.68161
Hoffmann, Michael; Erlebach, Thomas; Krizanc, Danny; Mihal’ák, Matúš; Raman, Rajeev
11
2008
Data delivery by energy-constrained mobile agents. Zbl 1397.68006
Chalopin, Jérémie; Das, Shantanu; Mihal’ák, Matúš; Penna, Paolo; Widmayer, Peter
10
2014
Data delivery by energy-constrained mobile agents on a line. Zbl 1411.68157
Chalopin, Jérémie; Jacob, Riko; Mihalák, Matúš; Widmayer, Peter
9
2014
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games. Zbl 1366.91037
Mihalák, Matúš; Schlegel, Jan Christoph
8
2012
Shunting for dummies: an introductory algorithmic survey. Zbl 1266.90042
Gatto, Michael; Maue, Jens; Mihalák, Matúš; Widmayer, Peter
8
2009
The price of anarchy in network creation games is (mostly) constant. Zbl 1293.91031
Mihalák, Matúš; Schlegel, Jan Christoph
7
2013
Vertex disjoint paths for dispatching in railways. Zbl 1247.90044
Flier, Holger; Mihalák, Matúš; Schöbel, Anita; Widmayer, Peter; Zych, Anna
7
2010
A polygon is determined by its angles. Zbl 1221.65062
Disser, Yann; Mihalák, Matúš; Widmayer, Peter
7
2011
An algorithmic view on OVSF code assignment. Zbl 1112.68137
Erlebach, Thomas; Jacob, Riko; Mihalák, Matúš; Nunkesser, Marc; Szabó, Gábor; Widmayer, Peter
6
2007
A \((4 + \epsilon )\)-approximation for the minimum-weight dominating set problem in unit disk graphs. Zbl 1284.68663
Erlebach, Thomas; Mihalák, Matúš
5
2010
Collaborative delivery with energy-constrained mobile robots. Zbl 1437.68033
Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Geissmann, Barbara; Graf, Daniel; Labourel, Arnaud; Mihalák, Matúš
5
2016
Reconstructing a simple polygon from its angles. Zbl 1285.68196
Disser, Yann; Mihalák, Matúš; Widmayer, Peter
5
2010
Collaborative delivery with energy-constrained mobile robots. Zbl 1437.68034
Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Geissmann, Barbara; Graf, Daniel; Labourel, Arnaud; Mihalák, Matúš
4
2020
Reconstructing visibility graphs with simple robots. Zbl 1274.68618
Bilò, Davide; Disser, Yann; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
4
2010
Mapping simple polygons: how robots benefit from looking back. Zbl 1259.68189
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
4
2013
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games. Zbl 1303.91056
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Mihalák, Matúš
4
2015
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games. Zbl 1382.91020
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Mihalák, Matúš
4
2013
Mapping simple polygons: the power of telling convex from reflex. Zbl 1398.68616
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
3
2015
Robust routing in urban public transportation: how to find reliable journeys based on past observations. Zbl 1281.90005
Böhmová, Katerina; Mihalák, Matús; Pröger, Tobias; Srámek, Rastislav; Widmayer, Peter
3
2013
Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods. Zbl 1445.68158
Disser, Yann; Mihalák, Matúš; Montanari, Sandro; Widmayer, Peter
3
2014
Robust optimization in the presence of uncertainty. Zbl 1362.68256
Buhmann, Joachim M.; Mihalak, Matus; Sramek, Rastislav; Widmayer, Peter
3
2013
How to guard a graph? Zbl 1183.91021
Fomin, Fedor V.; Golovach, Petr A.; Hall, Alexander; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter
3
2008
Approximate discovery of random graphs. Zbl 1175.68030
Erlebach, Thomas; Hall, Alexander; Mihal’ák, Matúš
3
2007
Network discovery and verification with distance queries. Zbl 1183.68423
Erlebach, Thomas; Hall, Alexander; Hoffmann, Michael; Mihaák, Matúš
3
2006
Telling convex from reflex allows to map a polygon. Zbl 1230.68102
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
3
2011
Improved bounds for the conflict-free chromatic art gallery problem. Zbl 1395.68286
Bärtschi, Andreas; Ghosh, Subir Kumar; Mihalák, Matúš; Tschager, Thomas; Widmayer, Peter
2
2014
Prime factorization of the Kirchhoff polynomial: compact enumeration of arborescences. Zbl 1433.05161
Mihalák, Matúš; Uznański, Przemysław; Yordanov, Pencho
2
2016
How simple robots benefit from looking back. Zbl 1284.68587
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
2
2010
Reconstructing visibility graphs with simple robots. Zbl 1243.68286
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; Widmayer, P.
2
2012
Interval selection with machine-dependent intervals. Zbl 1391.90244
Böhmová, Kateřina; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
2
2013
Recurring comparison faults: sorting and finding the minimum. Zbl 1434.68746
Geissmann, Barbara; Mihalák, Matúš; Widmayer, Peter
2
2015
An \(H _{n/2}\) upper bound on the price of stability of undirected network design games. Zbl 1427.91062
Mamageishvili, Akaki; Mihalák, Matúš; Montemezzani, Simone
2
2014
Tree Nash equilibria in the network creation game. Zbl 1342.05169
Mamageishvili, Akaki; Mihalák, Matúš; Müller, Dominik
2
2013
Approximately counting approximately-shortest paths in directed acyclic graphs. Zbl 1332.05073
Mihalák, Matúš; Šrámek, Rastislav; Widmayer, Peter
2
2016
Computing and listing \(st\)-paths in public transportation networks. Zbl 1385.68058
Böhmová, Kateřina; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France
2
2016
How to guard a graph? Zbl 1233.91047
Fomin, Fedor V.; Golovach, Petr A.; Hall, Alex; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter
2
2011
On the complexity of the metric TSP under stability considerations. Zbl 1298.90088
Mihalák, Matúš; Schöngens, Marcel; Šrámek, Rastislav; Widmayer, Peter
2
2011
The price of anarchy in network creation games is (mostly) constant. Zbl 1310.91045
Mihalák, Matúš; Schlegel, Jan Christoph
2
2010
Improved bounds on equilibria solutions in the network design game. Zbl 1418.91101
Mamageishvili, Akaki; Mihalák, Matúš; Montemezzani, Simone
1
2018
Polygon-constrained motion planning problems. Zbl 1397.68196
Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal’ák, Matúš; Proietti, Guido; Widmayer, Peter
1
2014
Discovery of network properties with all-shortest-paths queries. Zbl 1191.68028
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2010
Simple agents learn to find their way: an introduction on mapping polygons. Zbl 1312.68211
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
1
2013
Track allocation in freight-train classification with mixed tracks. Zbl 1247.90028
Bohlin, Markus; Flier, Holger; Maue, Jens; Mihalák, Matús
1
2011
Multicast network design game on a ring. Zbl 06539331
Mamageishvili, Akaki; Mihalák, Matúš
1
2015
Bribeproof mechanisms for two-values domains. Zbl 1403.91179
Mihalák, Matúš; Penna, Paolo; Widmayer, Peter
1
2016
Mapping a polygon with holes using a compass. Zbl 1351.68291
Disser, Yann; Ghosh, Subir Kumar; Mihalák, Matúš; Widmayer, Peter
1
2013
An algorithmic view on OVSF code assignment. Zbl 1122.68457
Erlebach, Thomas; Jacob, Riko; Mihaľák, Matúš; Nunkesser, Marc; Szabó, Gábor; Widmayer, Peter
1
2004
Maximum independent set in 2-direction outersegment graphs. Zbl 1341.05186
Flier, Holger; Mihalák, Matúš; Widmayer, Peter; Zych, Anna
1
2011
Discovery of network properties with all-shortest-paths queries. Zbl 1143.68319
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2008
Angle optimization in target tracking. Zbl 1155.68537
Gfeller, Beat; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
1
2008
Computing and listing \(st\)-paths in public transportation networks. Zbl 1393.68194
Böhmová, Kateřina; Häfliger, Luca; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France
1
2018
Collaborative delivery with energy-constrained mobile robots. Zbl 1437.68034
Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Geissmann, Barbara; Graf, Daniel; Labourel, Arnaud; Mihalák, Matúš
4
2020
Improved bounds on equilibria solutions in the network design game. Zbl 1418.91101
Mamageishvili, Akaki; Mihalák, Matúš; Montemezzani, Simone
1
2018
Computing and listing \(st\)-paths in public transportation networks. Zbl 1393.68194
Böhmová, Kateřina; Häfliger, Luca; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France
1
2018
Collaborative delivery with energy-constrained mobile robots. Zbl 1437.68033
Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Geissmann, Barbara; Graf, Daniel; Labourel, Arnaud; Mihalák, Matúš
5
2016
Prime factorization of the Kirchhoff polynomial: compact enumeration of arborescences. Zbl 1433.05161
Mihalák, Matúš; Uznański, Przemysław; Yordanov, Pencho
2
2016
Approximately counting approximately-shortest paths in directed acyclic graphs. Zbl 1332.05073
Mihalák, Matúš; Šrámek, Rastislav; Widmayer, Peter
2
2016
Computing and listing \(st\)-paths in public transportation networks. Zbl 1385.68058
Böhmová, Kateřina; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France
2
2016
Bribeproof mechanisms for two-values domains. Zbl 1403.91179
Mihalák, Matúš; Penna, Paolo; Widmayer, Peter
1
2016
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games. Zbl 1303.91056
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Mihalák, Matúš
4
2015
Mapping simple polygons: the power of telling convex from reflex. Zbl 1398.68616
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
3
2015
Recurring comparison faults: sorting and finding the minimum. Zbl 1434.68746
Geissmann, Barbara; Mihalák, Matúš; Widmayer, Peter
2
2015
Multicast network design game on a ring. Zbl 06539331
Mamageishvili, Akaki; Mihalák, Matúš
1
2015
Data delivery by energy-constrained mobile agents. Zbl 1397.68006
Chalopin, Jérémie; Das, Shantanu; Mihal’ák, Matúš; Penna, Paolo; Widmayer, Peter
10
2014
Data delivery by energy-constrained mobile agents on a line. Zbl 1411.68157
Chalopin, Jérémie; Jacob, Riko; Mihalák, Matúš; Widmayer, Peter
9
2014
Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods. Zbl 1445.68158
Disser, Yann; Mihalák, Matúš; Montanari, Sandro; Widmayer, Peter
3
2014
Improved bounds for the conflict-free chromatic art gallery problem. Zbl 1395.68286
Bärtschi, Andreas; Ghosh, Subir Kumar; Mihalák, Matúš; Tschager, Thomas; Widmayer, Peter
2
2014
An \(H _{n/2}\) upper bound on the price of stability of undirected network design games. Zbl 1427.91062
Mamageishvili, Akaki; Mihalák, Matúš; Montemezzani, Simone
2
2014
Polygon-constrained motion planning problems. Zbl 1397.68196
Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal’ák, Matúš; Proietti, Guido; Widmayer, Peter
1
2014
The price of anarchy in network creation games is (mostly) constant. Zbl 1293.91031
Mihalák, Matúš; Schlegel, Jan Christoph
7
2013
Mapping simple polygons: how robots benefit from looking back. Zbl 1259.68189
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
4
2013
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games. Zbl 1382.91020
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Mihalák, Matúš
4
2013
Robust routing in urban public transportation: how to find reliable journeys based on past observations. Zbl 1281.90005
Böhmová, Katerina; Mihalák, Matús; Pröger, Tobias; Srámek, Rastislav; Widmayer, Peter
3
2013
Robust optimization in the presence of uncertainty. Zbl 1362.68256
Buhmann, Joachim M.; Mihalak, Matus; Sramek, Rastislav; Widmayer, Peter
3
2013
Interval selection with machine-dependent intervals. Zbl 1391.90244
Böhmová, Kateřina; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
2
2013
Tree Nash equilibria in the network creation game. Zbl 1342.05169
Mamageishvili, Akaki; Mihalák, Matúš; Müller, Dominik
2
2013
Simple agents learn to find their way: an introduction on mapping polygons. Zbl 1312.68211
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
1
2013
Mapping a polygon with holes using a compass. Zbl 1351.68291
Disser, Yann; Ghosh, Subir Kumar; Mihalák, Matúš; Widmayer, Peter
1
2013
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games. Zbl 1366.91037
Mihalák, Matúš; Schlegel, Jan Christoph
8
2012
Reconstructing visibility graphs with simple robots. Zbl 1243.68286
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; Widmayer, P.
2
2012
A polygon is determined by its angles. Zbl 1221.65062
Disser, Yann; Mihalák, Matúš; Widmayer, Peter
7
2011
Telling convex from reflex allows to map a polygon. Zbl 1230.68102
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
3
2011
How to guard a graph? Zbl 1233.91047
Fomin, Fedor V.; Golovach, Petr A.; Hall, Alex; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter
2
2011
On the complexity of the metric TSP under stability considerations. Zbl 1298.90088
Mihalák, Matúš; Schöngens, Marcel; Šrámek, Rastislav; Widmayer, Peter
2
2011
Track allocation in freight-train classification with mixed tracks. Zbl 1247.90028
Bohlin, Markus; Flier, Holger; Maue, Jens; Mihalák, Matús
1
2011
Maximum independent set in 2-direction outersegment graphs. Zbl 1341.05186
Flier, Holger; Mihalák, Matúš; Widmayer, Peter; Zych, Anna
1
2011
Vertex disjoint paths for dispatching in railways. Zbl 1247.90044
Flier, Holger; Mihalák, Matúš; Schöbel, Anita; Widmayer, Peter; Zych, Anna
7
2010
A \((4 + \epsilon )\)-approximation for the minimum-weight dominating set problem in unit disk graphs. Zbl 1284.68663
Erlebach, Thomas; Mihalák, Matúš
5
2010
Reconstructing a simple polygon from its angles. Zbl 1285.68196
Disser, Yann; Mihalák, Matúš; Widmayer, Peter
5
2010
Reconstructing visibility graphs with simple robots. Zbl 1274.68618
Bilò, Davide; Disser, Yann; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
4
2010
How simple robots benefit from looking back. Zbl 1284.68587
Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Mihalák, Matúš; Widmayer, Peter
2
2010
The price of anarchy in network creation games is (mostly) constant. Zbl 1310.91045
Mihalák, Matúš; Schlegel, Jan Christoph
2
2010
Discovery of network properties with all-shortest-paths queries. Zbl 1191.68028
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2010
Shunting for dummies: an introductory algorithmic survey. Zbl 1266.90042
Gatto, Michael; Maue, Jens; Mihalák, Matúš; Widmayer, Peter
8
2009
Computing minimum spanning trees with uncertainty. Zbl 1259.68161
Hoffmann, Michael; Erlebach, Thomas; Krizanc, Danny; Mihal’ák, Matúš; Raman, Rajeev
11
2008
How to guard a graph? Zbl 1183.91021
Fomin, Fedor V.; Golovach, Petr A.; Hall, Alexander; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter
3
2008
Discovery of network properties with all-shortest-paths queries. Zbl 1143.68319
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2008
Angle optimization in target tracking. Zbl 1155.68537
Gfeller, Beat; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
1
2008
An algorithmic view on OVSF code assignment. Zbl 1112.68137
Erlebach, Thomas; Jacob, Riko; Mihalák, Matúš; Nunkesser, Marc; Szabó, Gábor; Widmayer, Peter
6
2007
Approximate discovery of random graphs. Zbl 1175.68030
Erlebach, Thomas; Hall, Alexander; Mihal’ák, Matúš
3
2007
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. Zbl 1148.05308
Ambühl, Christoph; Erlebach, Thomas; Mihalák, Matúš; Nunkesser, Marc
28
2006
Network discovery and verification with distance queries. Zbl 1183.68423
Erlebach, Thomas; Hall, Alexander; Hoffmann, Michael; Mihaák, Matúš
3
2006
Network discovery and verification. Zbl 1171.68587
Beerliova, Zuzana; Eberhard, Felix; Erlebach, Thomas; Hall, Alexander; Hoffmann, Michael; Mihaák, Matúš; Ram, L. Shankar
19
2005
An algorithmic view on OVSF code assignment. Zbl 1122.68457
Erlebach, Thomas; Jacob, Riko; Mihaľák, Matúš; Nunkesser, Marc; Szabó, Gábor; Widmayer, Peter
1
2004
all top 5

Cited by 336 Authors

23 Mihalák, Matúš
10 Widmayer, Peter
9 Disser, Yann
8 Das, Shantanu
7 Chalopin, Jérémie
7 Wu, Weili
6 Czyzowicz, Jurek
6 Erlebach, Thomas
5 Chin, Francis Y. L.
5 Dereniowski, Dariusz
5 Zhang, Yong
4 Bärtschi, Andreas
4 Bilò, Davide
4 Böhmová, Kateřina
4 Graf, Daniel
4 Karthick, T.
4 Megow, Nicole
4 Meißner, Julie
4 Ting, Hing-Fung
3 Chan, Joseph Wun-Tat
3 Damaschke, Peter
3 Das, Gautam Kumar
3 Du, Ding-Zhu
3 Foucaud, Florent
3 Fukunaga, Takuro
3 Jaehn, Florian
3 Karousatou, Christina
3 Labourel, Arnaud
3 Mamageishvili, Akaki
3 Mustafa, Nabil Hassan
3 Parreau, Aline
3 Pröger, Tobias
3 Proietti, Guido
3 Ray, Saurabh
3 Rizzi, Romeo
3 Rytter, Wojciech
2 Aichholzer, Oswin
2 Aijaz, Malla
2 Bampas, Evangelos
2 Basappa, Manjanna
2 Bilò, Vittorio
2 Bus, Norbert
2 Christodoulou, George C.
2 Diks, Krzysztof
2 Du, Hongwei
2 Dürr, Christoph
2 Evans, William S.
2 Fekete, Sándor P.
2 Flammini, Michele
2 Fraser, Robert
2 Gao, Xiaofeng
2 Garg, Shashwat
2 Geissmann, Barbara
2 Goerigk, Marc
2 Gualà, Luciano
2 Gupta, Manoj Kumar
2 Harks, Tobias
2 Kaklamanis, Christos
2 Kanellopoulos, Panagiotis
2 Kranakis, Evangelos Konstantinou
2 Krizanc, Danny
2 Kusters, Vincent J. J.
2 Lenzner, Pascal
2 López-Ortiz, Alejandro
2 Maehara, Takanori
2 Maffray, Frédéric
2 Mertzios, George B.
2 Moscardelli, Luca
2 Moussi, Jean
2 Nagamochi, Hiroshi
2 Narayanan, Lata
2 Naserasr, Reza
2 Panagopoulou, Panagiota N.
2 Pardalos, Panos M.
2 Pelc, Andrzej
2 Penna, Paolo
2 Pirzada, Shariefuddin
2 Reyzin, Lev
2 Sacomoto, Gustavo
2 Sagot, Marie-France
2 Santhakumar, Samivel
2 Schedel, Anja
2 Schlegel, Jan Christoph
2 Sen, Sandeep
2 Sgouritsa, Alkmini
2 Shin, Chan-Su
2 Skutella, Martin
2 Spieksma, Frits C. R.
2 Šrámek, Rastislav
2 Surek, Manuel
2 Suri, Subhash
2 Tsokana, Sophia
2 Valicov, Petru
2 Wang, Wei
2 Wang, Zhong
2 Wu, Lidong
2 Zhang, Zhao
1 Acharyya, Rashmisnata
1 Adar, Ron
1 Akitaya, Hugo Alves
...and 236 more Authors

Citations by Year