Joint Base Station Scheduling. - Thomas Erlebach; Riko Jacob; Matús Mihalák; Marc Nunkesser; Gábor Szabó 001; Peter Widmayer (WAOA, 2004)

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. - Christoph Ambühl; Thomas Erlebach; Matús Mihalák; Marc Nunkesser (APPROX-RANDOM, 2006)

Network Discovery and Verification with Distance Queries. - Thomas Erlebach; Alexander Hall; Michael Hoffmann 002; Matús Mihalák (CIAC, 2006)

Network Discovery and Verification. - Zuzana Beerliova; Felix Eberhard; Thomas Erlebach; Alexander Hall; Michael Hoffmann 002; Matús Mihalák; L. Shankar Ram (IEEE J. Sel. Areas Commun., 2006)

Counting Targets with Mobile Sensors in an Unknown Environment. - Beat Gfeller; Matús Mihalák; Subhash Suri; Elias Vicari; Peter Widmayer (ALGOSENSORS, 2007)

Approximate Discovery of Random Graphs. - Thomas Erlebach; Alexander Hall; Matús Mihalák (SAGA, 2007)

An Algorithmic View on OVSF Code Assignment. - Thomas Erlebach; Riko Jacob; Matús Mihalák; Marc Nunkesser; Gábor Szabó 001; Peter Widmayer (Algorithmica, 2007)

Simple Robots in Polygonal Environments: A Hierarchy. - Jan Brunner; Matús Mihalák; Subhash Suri; Elias Vicari; Peter Widmayer (ALGOSENSORS, 2008)

Rendezvous of Mobile Agents When Tokens Fail Anytime. - Shantanu Das 001; Matús Mihalák; Rastislav Srámek; Elias Vicari; Peter Widmayer (OPODIS, 2008)

Computing Minimum Spanning Trees with Uncertainty. - Michael Hoffmann 002; Thomas Erlebach; Danny Krizanc; Matús Mihalák; Rajeev Raman (STACS, 2008)

Angle Optimization in Target Tracking. - Beat Gfeller; Matús Mihalák; Subhash Suri; Elias Vicari; Peter Widmayer (SWAT, 2008)

Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. - Anvesh Komuravelli; Matús Mihalák (SSS, 2009)

A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. - Thomas Erlebach; Matús Mihalák (WAOA, 2009)

Shunting for Dummies: An Introductory Algorithmic Survey. - Michael Gatto; Jens Maue; Matús Mihalák; Peter Widmayer (Robust and Online Large-Scale Optimization, 2009)

Vertex Disjoint Paths for Dispatching in Railways. - Holger Flier; Matús Mihalák; Anita Schöbel; Peter Widmayer; Anna Zych (ATMOS, 2010)

How Simple Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (CIAC, 2010)

Reconstructing a Simple Polygon from Its Angles. - Yann Disser; Matús Mihalák; Peter Widmayer (SWAT, 2010)

Discovery of network properties with all-shortest-paths queries. - Davide Bilò; Thomas Erlebach; Matús Mihalák; Peter Widmayer (Theor. Comput. Sci., 2010)

Track Allocation in Freight-Train Classification with Mixed Tracks. - Markus Bohlin; Holger Flier; Jens Maue; Matús Mihalák (ATMOS, 2011)

On the Complexity of the Metric TSP under Stability Considerations. - Matús Mihalák; Marcel Schöngens; Rastislav Srámek; Peter Widmayer (SOFSEM, 2011)

Telling convex from reflex allows to map a polygon. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (STACS, 2011)

Maximum Independent Set in 2-Direction Outersegment Graphs. - Holger Flier; Matús Mihalák; Peter Widmayer; Anna Zych (WG, 2011)

How to Guard a Graph? - Fedor V. Fomin; Petr A. Golovach; Alexander Hall; Matús Mihalák; Elias Vicari; Peter Widmayer (Algorithmica, 2011)

A polygon is determined by its angles. - Yann Disser; Matús Mihalák; Peter Widmayer (Comput. Geom., 2011)

Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. - Matús Mihalák; Jan Christoph Schlegel (MFCS, 2012)

Mapping Polygons with Agents That Measure Angles. - Yann Disser; Matús Mihalák; Peter Widmayer (WAFR, 2012)

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CoRR, 2012)

Reconstructing visibility graphs with simple robots. - Davide Bilò; Yann Disser; Matús Mihalák; Subhash Suri; Elias Vicari; Peter Widmayer (Theor. Comput. Sci., 2012)

Polygon-Constrained Motion Planning Problems. - Davide Bilò; Yann Disser; Luciano Gualà; Matús Mihalák; Guido Proietti; Peter Widmayer (ALGOSENSORS, 2013)

Data Delivery by Energy-Constrained Mobile Agents. - Jérémie Chalopin; Shantanu Das 001; Matús Mihalák; Paolo Penna; Peter Widmayer (ALGOSENSORS, 2013)

Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. - Katerina Böhmová; Matús Mihalák; Tobias Pröger; Rastislav Srámek; Peter Widmayer (ATMOS, 2013)

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CIAC, 2013)

Robust optimization in the presence of uncertainty. - Joachim M. Buhmann; Matús Mihalák; Rastislav Srámek; Peter Widmayer (ITCS, 2013)

Interval Selection with Machine-Dependent Intervals. - Katerina Böhmová; Yann Disser; Matús Mihalák; Peter Widmayer (WADS, 2013)

Counting Approximately-Shortest Paths in Directed Acyclic Graphs. - Matús Mihalák; Rastislav Srámek; Peter Widmayer (WAOA, 2013)

Mapping Simple Polygons: How Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Algorithmica, 2013)

Counting approximately-shortest paths in directed acyclic graphs - Matús Mihalák; Rastislav Srámek (CoRR, 2013)

Simple agents learn to find their way: An introduction on mapping polygons. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Discret. Appl. Math., 2013)

The Price of Anarchy in Network Creation Games Is (Mostly) Constant. - Matús Mihalák; Jan Christoph Schlegel (Theory Comput. Syst., 2013)

Frontmatter, Table of Contents, Preface, Workshop Organization. - Stefan Funke; Matús Mihalák (ATMOS, 2014)

Improved bounds for the conflict-free chromatic art gallery problem. - Andreas Bärtschi; Subir Kumar Ghosh; Matús Mihalák; Thomas Tschager; Peter Widmayer (SoCG, 2014)

Data Delivery by Energy-Constrained Mobile Agents on a Line. - Jérémie Chalopin; Riko Jacob; Matús Mihalák; Peter Widmayer (ICALP (2), 2014)

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. - Yann Disser; Matús Mihalák; Sandro Montanari; Peter Widmayer (ISCO, 2014)

An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games. - Akaki Mamageishvili; Matús Mihalák; Simone Montemezzani (MFCS (2), 2014)

An $H_{n/2}$ Upper Bound on the Price of Stability of Undirected Network Design Games. - Akaki Mamageishvili; Matús Mihalák; Simone Montemezzani (CoRR, 2014)

Mapping a polygon with holes using a compass. - Yann Disser; Subir Kumar Ghosh; Matús Mihalák; Peter Widmayer (Theor. Comput. Sci., 2014)

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. - Katerina Böhmová; Matús Mihalák; Peggy Neubert; Tobias Pröger; Peter Widmayer (ATMOS, 2015)

Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. - Matús Mihalák; Sandro Montanari (ATMOS, 2015)

Multicast Network Design Game on a Ring. - Akaki Mamageishvili; Matús Mihalák (COCOA, 2015)

Recurring Comparison Faults: Sorting and Finding the Minimum. - Barbara Geissmann; Matús Mihalák; Peter Widmayer (FCT, 2015)

Tree Nash Equilibria in the Network Creation Game. - Akaki Mamageishvili; Matús Mihalák; Dominik Müller (Internet Math., 2015)

Selecting vertex disjoint paths in plane graphs. - Holger Flier; Matús Mihalák; Peter Widmayer; Anna Zych; Yusuke Kobayashi 001; Anita Schöbel (Networks, 2015)

Mapping Simple Polygons: The Power of Telling Convex from Reflex. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (ACM Trans. Algorithms, 2015)

Improving the Hk-bound on the price of stability in undirected Shapley network design games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (Theor. Comput. Sci., 2015)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. - Matús Mihalák; Przemyslaw Uznanski; Pencho Yordanov (ANALCO, 2016)

Computing and Listing st-Paths in Public Transportation Networks. - Katerina Böhmová; Matús Mihalák; Tobias Pröger; Gustavo Sacomoto; Marie-France Sagot (CSR, 2016)

Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. - Katerina Böhmová; Enrico Kravina; Matús Mihalák (ISCO, 2016)

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. - Katerina Böhmová; Yann Disser; Matús Mihalák; Rastislav Srámek (LATIN, 2016)

Bribeproof Mechanisms for Two-Values Domains. - Matús Mihalák; Paolo Penna; Peter Widmayer (SAGT, 2016)

Sequence Hypergraphs. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (WG, 2016)

Sequential Solutions in Machine Scheduling Games. - Paul Giessler; Akaki Mamageishvili; Matús Mihalák; Paolo Penna (CoRR, 2016)

Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. - Matús Mihalák; Rastislav Srámek; Peter Widmayer (Theory Comput. Syst., 2016)

Optimization Methods for Multistage Freight Train Formation. - Markus Bohlin; Sara Gestrelius; Florian Dahms; Matús Mihalák; Holger Flier (Transp. Sci., 2016)

Sequence Hypergraphs: Paths, Flows, and Cuts. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (Adventures Between Lower Bounds and Higher Altitudes, 2018)

On a Fixed Haplotype Variant of the Minimum Error Correction Problem. - Axel Goblet; Steven Kelk; Matús Mihalák; Georgios Stamoulis (COCOON, 2018)

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. - Annette M. C. Ficker; Thomas Erlebach; Matús Mihalák; Frits C. R. Spieksma (ISAAC, 2018)

Collective Fast Delivery by Energy-Efficient Agents. - Andreas Bärtschi; Daniel Graf 001; Matús Mihalák (MFCS, 2018)

Improved bounds on equilibria solutions in the network design game. - Akaki Mamageishvili; Matús Mihalák; Simone Montemezzani (Int. J. Game Theory, 2018)

Robust optimization in the presence of uncertainty: A generic approach. - Joachim M. Buhmann; Alexey Gronskiy; Matús Mihalák; Tobias Pröger; Rastislav Srámek; Peter Widmayer (J. Comput. Syst. Sci., 2018)

Computing and Listing st-Paths in Public Transportation Networks. - Katerina Böhmová; Luca Häfliger; Matús Mihalák; Tobias Pröger; Gustavo Sacomoto; Marie-France Sagot (Theory Comput. Syst., 2018)

On Sorting with a Network of Two Stacks. - Matús Mihalák; Marc Pont (ATMOS, 2019)

Collaborative delivery with energy-constrained mobile robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2020)

Near-gathering of energy-constrained mobile agents. - Andreas Bärtschi; Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Christina Karousatou; Matús Mihalák (Theor. Comput. Sci., 2021)

Collaborative delivery on a fixed path with homogeneous energy-constrained agents. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2021)

Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics. - Florian Wimmenauer; Matús Mihalák; Mark H. M. Winands (CoRR, 2022)

Snakes and Ladders: A Treewidth Story. - Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (WG, 2023)

Relaxed Agreement Forests. - Virginia Aardevol Martinez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (CoRR, 2023)

Scheduling Single AGV in Blocking Flow-Shop with Identical Jobs. - Erik Boom; Matús Mihalák; Frank Thuijsman; Mark H. M. Winands (ICORES, 2024)

Relaxed Agreement Forests. - Virginia Ardévol Martínez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (SOFSEM, 2024)

Sequential solutions in machine scheduling games. - Cong Chen 004; Paul Giessler; Akaki Mamageishvili; Matús Mihalák; Paolo Penna (J. Sched., 2024)

Deep Learning Methods for Detecting Thermal Runaway Events in Battery Production Lines. - Athanasios Athanasopoulos; Matús Mihalák; Marcin Pietrasik (ICPS, 2025)

Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. - Steven Chaplick; Martin Frohn; Steven Kelk; Johann Lottermoser; Matús Mihalák (Discret. Appl. Math., 2025)