Matús Mihalák

109 papers A* 1A 4B 24C 23Misc 2Journal 43Unranked 11

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