Matús Mihalák

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 35

Top Venues

Publications

Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. SOFSEM (2024)
Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. CoRR (2024)
Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential solutions in machine scheduling games. J. Sched. 27 (4) (2024)
Erik Boom, Matús Mihalák, Frank Thuijsman, Mark H. M. Winands
Scheduling Single AGV in Blocking Flow-Shop with Identical Jobs. ICORES (2024)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: a Treewidth Story. CoRR (2023)
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. CoRR (2023)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: A Treewidth Story. WG (2023)
Florian Wimmenauer, Matús Mihalák, Mark H. M. Winands
Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics. CoRR (2022)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868 (2021)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849 (2021)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810 (2020)
Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential Solutions in Machine Scheduling Games. WINE (2020)
Matús Mihalák, Marc Pont
On Sorting with a Network of Two Stacks. ATMOS (2019)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO (2019)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO (2019)
Andreas Bärtschi, Daniel Graf, Matús Mihalák
Collective Fast Delivery by Energy-Efficient Agents. MFCS (2018)
Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. COCOON (2018)
Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot
Computing and Listing st-Paths in Public Transportation Networks. Theory Comput. Syst. 62 (3) (2018)
Andreas Bärtschi, Daniel Graf, Matús Mihalák
Collective fast delivery by energy-efficient agents. CoRR (2018)
Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani
Improved bounds on equilibria solutions in the network design game. Int. J. Game Theory 47 (4) (2018)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC (2018)
Joachim M. Buhmann, Alexey Gronskiy, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer
Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci. 94 (2018)
Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. ANALCO (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO (2016)
Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. LATIN (2016)
Markus Bohlin, Sara Gestrelius, Florian Dahms, Matús Mihalák, Holger Flier
Optimization Methods for Multistage Freight Train Formation. Transp. Sci. 50 (3) (2016)
Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot
Computing and Listing st-Paths in Public Transportation Networks. CSR (2016)
Matús Mihalák, Rastislav Srámek, Peter Widmayer
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst. 58 (1) (2016)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs. WG (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof Mechanisms for Two-Values Domains. SAGT (2016)
Katerina Böhmová, Enrico Kravina, Matús Mihalák
Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. ISCO (2016)
Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential Solutions in Machine Scheduling Games. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof mechanisms for two-values domains. CoRR (2015)
Akaki Mamageishvili, Matús Mihalák, Dominik Müller
Tree Nash Equilibria in the Network Creation Game. Internet Math. 11 (4-5) (2015)
Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel
Selecting vertex disjoint paths in plane graphs. Networks 66 (2) (2015)
Matús Mihalák, Sandro Montanari
Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. ATMOS (2015)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11 (4) (2015)
Akaki Mamageishvili, Matús Mihalák
Multicast Network Design Game on a Ring. COCOA (2015)
Katerina Böhmová, Matús Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer
Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. ATMOS (2015)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562 (2015)
Akaki Mamageishvili, Matús Mihalák
Multicast Network Design Game on a Ring. CoRR (2015)
Barbara Geissmann, Matús Mihalák, Peter Widmayer
Recurring Comparison Faults: Sorting and Finding the Minimum. FCT (2015)
Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. CoRR (2015)
Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer
Improved bounds for the conflict-free chromatic art gallery problem. SoCG (2014)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553 (2014)
Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani
An $H_{n/2}$ Upper Bound on the Price of Stability of Undirected Network Design Games. CoRR (2014)
Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) (2014)
Stefan Funke, Matús Mihalák
Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS (2014)
Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO (2014)
Akaki Mamageishvili, Matús Mihalák, Simone Montemezzani
An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games. MFCS (2) (2014)
Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
Interval Selection with Machine-Dependent Intervals. WADS (2013)
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) (2013)
Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer
Robust optimization in the presence of uncertainty. ITCS (2013)
Akaki Mamageishvili, Matús Mihalák, Dominik Müller
Tree Nash Equilibria in the Network Creation Game. CoRR (2013)
Matús Mihalák, Jan Christoph Schlegel
The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Theory Comput. Syst. 53 (1) (2013)
Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
Polygon-Constrained Motion Planning Problems. ALGOSENSORS (2013)
Matús Mihalák, Rastislav Srámek, Peter Widmayer
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. WAOA (2013)
Matús Mihalák, Rastislav Srámek
Counting approximately-shortest paths in directed acyclic graphs CoRR (2013)
Katerina Böhmová, Matús Mihalák, Tobias Pröger, Rastislav Srámek, Peter Widmayer
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. ATMOS (2013)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
-Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC (2013)
Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS (2013)
Akaki Mamageishvili, Matús Mihalák, Dominik Müller
Tree Nash Equilibria in the Network Creation Game. WAW (2013)
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. Discret. Appl. Math. 161 (10-11) (2013)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS (2012)
Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444 (2012)
Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Polygons with Agents That Measure Angles. WAFR (2012)
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 (2012)
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 (2012)
Matús Mihalák, Jan Christoph Schlegel
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. MFCS (2012)
Yann Disser, Matús Mihalák, Peter Widmayer
A polygon is determined by its angles. Comput. Geom. 44 (8) (2011)
Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer
On the Complexity of the Metric TSP under Stability Considerations. SOFSEM (2011)
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)
Markus Bohlin, Holger Flier, Jens Maue, Matús Mihalák
Track Allocation in Freight-Train Classification with Mixed Tracks. ATMOS (2011)
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
How to Guard a Graph? Algorithmica 61 (4) (2011)
Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych
Maximum Independent Set in 2-Direction Outersegment Graphs. WG (2011)
Matús Mihalák, Jan Christoph Schlegel
The Price of Anarchy in Network Creation Games Is (Mostly) Constant. SAGT (2010)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
How Simple Robots Benefit from Looking Back. CIAC (2010)
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) (2010)
Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych
Vertex Disjoint Paths for Dispatching in Railways. ATMOS (2010)
Yann Disser, Matús Mihalák, Peter Widmayer
Reconstructing a Simple Polygon from Its Angles. SWAT (2010)
Anvesh Komuravelli, Matús Mihalák
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. SSS (2009)
Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Reconstructing Visibility Graphs with Simple Robots. SIROCCO (2009)
Thomas Erlebach, Matús Mihalák
)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA (2009)
Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO (2008)
Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman
Computing Minimum Spanning Trees with Uncertainty. STACS (2008)
Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS (2008)
Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS (2008)
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
How to Guard a Graph?. ISAAC (2008)
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Angle Optimization in Target Tracking. SWAT (2008)
Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman
Computing Minimum Spanning Trees with Uncertainty CoRR (2008)
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) (2007)
Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS (2007)
Thomas Erlebach, Alexander Hall, Matús Mihalák
Approximate Discovery of Random Graphs. SAGA (2007)
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)
Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák
Network Discovery and Verification with Distance Queries. CIAC (2006)
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24 (12) (2006)
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
Network Discovery and Verification. WG (2005)

Matús Mihalák.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matús Mihalák