Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Matús Mihalák
@inproceedings{DBLP:conf/icores/BoomMTW24, author = {Erik Boom and Mat{\'{u}}s Mihal{\'{a}}k and Frank Thuijsman and Mark H. M. Winands}, editor = {Federico Liberatore and Slawo Wesolkowski and Greg H. Parlier}, title = {Scheduling Single {AGV} in Blocking Flow-Shop with Identical Jobs}, booktitle = {Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, {ICORES} 2024, Rome, Italy, February 24-26, 2024}, pages = {325--332}, publisher = {{SCITEPRESS}}, year = {2024}, url = {https://doi.org/10.5220/0012398200003639}, doi = {10.5220/0012398200003639}, timestamp = {Fri, 22 Mar 2024 11:22:30 +0100}, biburl = {https://dblp.org/rec/conf/icores/BoomMTW24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/MartinezCKMMS24, author = {Ard{\'{e}}vol Mart{\'{\i}}nez, Virginia and Steven Chaplick and Steven Kelk and Ruben Meuwese and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, editor = {Henning Fernau and Serge Gaspers and Ralf Klasing}, title = {Relaxed Agreement Forests}, booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, {SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14519}, pages = {40--54}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-52113-3\_3}, doi = {10.1007/978-3-031-52113-3\_3}, timestamp = {Sun, 25 Feb 2024 15:20:57 +0100}, biburl = {https://dblp.org/rec/conf/sofsem/MartinezCKMMS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2403-10868, author = {Steven Chaplick and Martin Frohn and Steven Kelk and Johann Lottermoser and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs}, journal = {CoRR}, volume = {abs/2403.10868}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.10868}, doi = {10.48550/ARXIV.2403.10868}, eprinttype = {arXiv}, eprint = {2403.10868}, timestamp = {Mon, 08 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-10868.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/ChaplickKMMS23, author = {Steven Chaplick and Steven Kelk and Ruben Meuwese and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Snakes and Ladders: {A} Treewidth Story}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {187--200}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_14}, doi = {10.1007/978-3-031-43380-1\_14}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/ChaplickKMMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-10662, author = {Steven Chaplick and Steven Kelk and Ruben Meuwese and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, title = {Snakes and Ladders: a Treewidth Story}, journal = {CoRR}, volume = {abs/2302.10662}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.10662}, doi = {10.48550/ARXIV.2302.10662}, eprinttype = {arXiv}, eprint = {2302.10662}, timestamp = {Thu, 23 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-10662.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2309-01110, author = {Virginia Aardevol Martinez and Steven Chaplick and Steven Kelk and Ruben Meuwese and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, title = {Relaxed Agreement Forests}, journal = {CoRR}, volume = {abs/2309.01110}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2309.01110}, doi = {10.48550/ARXIV.2309.01110}, eprinttype = {arXiv}, eprint = {2309.01110}, timestamp = {Mon, 11 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-01110.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2212-07543, author = {Florian Wimmenauer and Mat{\'{u}}s Mihal{\'{a}}k and Mark H. M. Winands}, title = {Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics}, journal = {CoRR}, volume = {abs/2212.07543}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2212.07543}, doi = {10.48550/ARXIV.2212.07543}, eprinttype = {arXiv}, eprint = {2212.07543}, timestamp = {Mon, 02 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2212-07543.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BartschiBC0KM21, author = {Andreas B{\"{a}}rtschi and Evangelos Bampas and J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Christina Karousatou and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Near-gathering of energy-constrained mobile agents}, journal = {Theor. Comput. Sci.}, volume = {849}, pages = {35--46}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2020.10.008}, doi = {10.1016/J.TCS.2020.10.008}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BartschiBC0KM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChalopinDDLM21, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Arnaud Labourel and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Collaborative delivery on a fixed path with homogeneous energy-constrained agents}, journal = {Theor. Comput. Sci.}, volume = {868}, pages = {87--96}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.04.004}, doi = {10.1016/J.TCS.2021.04.004}, timestamp = {Sun, 16 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ChalopinDDLM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BartschiCDDGGLM20, author = {Andreas B{\"{a}}rtschi and J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Barbara Geissmann and Daniel Graf and Arnaud Labourel and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Collaborative delivery with energy-constrained mobile robots}, journal = {Theor. Comput. Sci.}, volume = {810}, pages = {2--14}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2017.04.018}, doi = {10.1016/J.TCS.2017.04.018}, timestamp = {Sat, 16 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BartschiCDDGGLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/ChenGMMP20, author = {Cong Chen and Paul Giessler and Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Paolo Penna}, editor = {Xujin Chen and Nikolai Gravin and Martin Hoefer and Ruta Mehta}, title = {Sequential Solutions in Machine Scheduling Games}, booktitle = {Web and Internet Economics - 16th International Conference, {WINE} 2020, Beijing, China, December 7-11, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12495}, pages = {309--322}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-64946-3\_22}, doi = {10.1007/978-3-030-64946-3\_22}, timestamp = {Fri, 26 Mar 2021 08:28:34 +0100}, biburl = {https://dblp.org/rec/conf/wine/ChenGMMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/MihalakP19, author = {Mat{\'{u}}s Mihal{\'{a}}k and Marc Pont}, editor = {Valentina Cacchiani and Alberto Marchetti{-}Spaccamela}, title = {On Sorting with a Network of Two Stacks}, booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2019, September 12-13, 2019, Munich, Germany}, series = {OASIcs}, volume = {75}, pages = {3:1--3:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2019.3}, doi = {10.4230/OASICS.ATMOS.2019.3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/atmos/MihalakP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/BartschiBC0KM19, author = {Andreas B{\"{a}}rtschi and Evangelos Bampas and J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Christina Karousatou and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Keren Censor{-}Hillel and Michele Flammini}, title = {Near-Gathering of Energy-Constrained Mobile Agents}, booktitle = {Structural Information and Communication Complexity - 26th International Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11639}, pages = {52--65}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24922-9\_4}, doi = {10.1007/978-3-030-24922-9\_4}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/BartschiBC0KM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/Chalopin0DLM19, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Arnaud Labourel and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Keren Censor{-}Hillel and Michele Flammini}, title = {Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents}, booktitle = {Structural Information and Communication Complexity - 26th International Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11639}, pages = {139--153}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24922-9\_10}, doi = {10.1007/978-3-030-24922-9\_10}, timestamp = {Mon, 15 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/Chalopin0DLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijgt/MamageishviliMM18, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Simone Montemezzani}, title = {Improved bounds on equilibria solutions in the network design game}, journal = {Int. J. Game Theory}, volume = {47}, number = {4}, pages = {1113--1135}, year = {2018}, url = {https://doi.org/10.1007/s00182-017-0600-z}, doi = {10.1007/S00182-017-0600-Z}, timestamp = {Tue, 08 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijgt/MamageishviliMM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BuhmannGMPSW18, author = {Joachim M. Buhmann and Alexey Gronskiy and Mat{\'{u}}s Mihal{\'{a}}k and Tobias Pr{\"{o}}ger and Rastislav Sr{\'{a}}mek and Peter Widmayer}, title = {Robust optimization in the presence of uncertainty: {A} generic approach}, journal = {J. Comput. Syst. Sci.}, volume = {94}, pages = {135--166}, year = {2018}, url = {https://doi.org/10.1016/j.jcss.2017.10.004}, doi = {10.1016/J.JCSS.2017.10.004}, timestamp = {Fri, 31 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BuhmannGMPSW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BohmovaHMPSS18, author = {Katerina B{\"{o}}hmov{\'{a}} and Luca H{\"{a}}fliger and Mat{\'{u}}s Mihal{\'{a}}k and Tobias Pr{\"{o}}ger and Gustavo Sacomoto and Marie{-}France Sagot}, title = {Computing and Listing st-Paths in Public Transportation Networks}, journal = {Theory Comput. Syst.}, volume = {62}, number = {3}, pages = {600--621}, year = {2018}, url = {https://doi.org/10.1007/s00224-016-9747-4}, doi = {10.1007/S00224-016-9747-4}, timestamp = {Thu, 15 Mar 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/BohmovaHMPSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/BohmovaCMPW18, author = {Katerina B{\"{o}}hmov{\'{a}} and J{\'{e}}r{\'{e}}mie Chalopin and Mat{\'{u}}s Mihal{\'{a}}k and Guido Proietti and Peter Widmayer}, editor = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Walter Unger}, title = {Sequence Hypergraphs: Paths, Flows, and Cuts}, booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday}, series = {Lecture Notes in Computer Science}, volume = {11011}, pages = {191--215}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-98355-4\_12}, doi = {10.1007/978-3-319-98355-4\_12}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/birthday/BohmovaCMPW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/GobletKMS18, author = {Axel Goblet and Steven Kelk and Mat{\'{u}}s Mihal{\'{a}}k and Georgios Stamoulis}, editor = {Lusheng Wang and Daming Zhu}, title = {On a Fixed Haplotype Variant of the Minimum Error Correction Problem}, booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON} 2018, Qing Dao, China, July 2-4, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10976}, pages = {554--566}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-94776-1\_46}, doi = {10.1007/978-3-319-94776-1\_46}, timestamp = {Thu, 20 Aug 2020 16:02:36 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/GobletKMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FickerEMS18, author = {Annette M. C. Ficker and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Frits C. R. Spieksma}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {45:1--45:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.45}, doi = {10.4230/LIPICS.ISAAC.2018.45}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FickerEMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Bartschi0M18, author = {Andreas B{\"{a}}rtschi and Daniel Graf and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Igor Potapov and Paul G. Spirakis and James Worrell}, title = {Collective Fast Delivery by Energy-Efficient Agents}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}}, series = {LIPIcs}, volume = {117}, pages = {56:1--56:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.56}, doi = {10.4230/LIPICS.MFCS.2018.56}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Bartschi0M18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-01962, author = {Annette M. C. Ficker and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Frits C. R. Spieksma}, title = {Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}, journal = {CoRR}, volume = {abs/1807.01962}, year = {2018}, url = {http://arxiv.org/abs/1807.01962}, eprinttype = {arXiv}, eprint = {1807.01962}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-01962.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-00077, author = {Andreas B{\"{a}}rtschi and Daniel Graf and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Collective fast delivery by energy-efficient agents}, journal = {CoRR}, volume = {abs/1809.00077}, year = {2018}, url = {http://arxiv.org/abs/1809.00077}, eprinttype = {arXiv}, eprint = {1809.00077}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-00077.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/MihalakSW16, author = {Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Peter Widmayer}, title = {Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs}, journal = {Theory Comput. Syst.}, volume = {58}, number = {1}, pages = {45--59}, year = {2016}, url = {https://doi.org/10.1007/s00224-014-9571-7}, doi = {10.1007/S00224-014-9571-7}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/MihalakSW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/transci/BohlinGDMF16, author = {Markus Bohlin and Sara Gestrelius and Florian Dahms and Mat{\'{u}}s Mihal{\'{a}}k and Holger Flier}, title = {Optimization Methods for Multistage Freight Train Formation}, journal = {Transp. Sci.}, volume = {50}, number = {3}, pages = {823--840}, year = {2016}, url = {https://doi.org/10.1287/trsc.2014.0580}, doi = {10.1287/TRSC.2014.0580}, timestamp = {Tue, 08 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/transci/BohlinGDMF16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/analco/MihalakUY16, author = {Mat{\'{u}}s Mihal{\'{a}}k and Przemyslaw Uznanski and Pencho Yordanov}, editor = {James Allen Fill and Mark Daniel Ward}, title = {Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences}, booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11, 2016}, pages = {93--105}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974324.10}, doi = {10.1137/1.9781611974324.10}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/analco/MihalakUY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/BohmovaMPSS16, author = {Katerina B{\"{o}}hmov{\'{a}} and Mat{\'{u}}s Mihal{\'{a}}k and Tobias Pr{\"{o}}ger and Gustavo Sacomoto and Marie{-}France Sagot}, editor = {Alexander S. Kulikov and Gerhard J. Woeginger}, title = {Computing and Listing st-Paths in Public Transportation Networks}, booktitle = {Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9691}, pages = {102--116}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-34171-2\_8}, doi = {10.1007/978-3-319-34171-2\_8}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/BohmovaMPSS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/BohmovaKM16, author = {Katerina B{\"{o}}hmov{\'{a}} and Enrico Kravina and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Raffaele Cerulli and Satoru Fujishige and Ali Ridha Mahjoub}, title = {Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores}, booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9849}, pages = {345--356}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-45587-7\_30}, doi = {10.1007/978-3-319-45587-7\_30}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iscopt/BohmovaKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BohmovaDMS16, author = {Katerina B{\"{o}}hmov{\'{a}} and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek}, editor = {Evangelos Kranakis and Gonzalo Navarro and Edgar Ch{\'{a}}vez}, title = {Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs}, booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9644}, pages = {220--234}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49529-2\_17}, doi = {10.1007/978-3-662-49529-2\_17}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/latin/BohmovaDMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/MihalakPW16, author = {Mat{\'{u}}s Mihal{\'{a}}k and Paolo Penna and Peter Widmayer}, editor = {Martin Gairing and Rahul Savani}, title = {Bribeproof Mechanisms for Two-Values Domains}, booktitle = {Algorithmic Game Theory - 9th International Symposium, {SAGT} 2016, Liverpool, UK, September 19-21, 2016. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9928}, pages = {289--301}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53354-3\_23}, doi = {10.1007/978-3-662-53354-3\_23}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/sagt/MihalakPW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/BartschiC0DGGLM16, author = {Andreas B{\"{a}}rtschi and J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Barbara Geissmann and Daniel Graf and Arnaud Labourel and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Jukka Suomela}, title = {Collaborative Delivery with Energy-Constrained Mobile Robots}, booktitle = {Structural Information and Communication Complexity - 23rd International Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9988}, pages = {258--274}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-48314-6\_17}, doi = {10.1007/978-3-319-48314-6\_17}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/BartschiC0DGGLM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BohmovaCMPW16, author = {Katerina B{\"{o}}hmov{\'{a}} and J{\'{e}}r{\'{e}}mie Chalopin and Mat{\'{u}}s Mihal{\'{a}}k and Guido Proietti and Peter Widmayer}, editor = {Pinar Heggernes}, title = {Sequence Hypergraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9941}, pages = {282--294}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53536-3\_24}, doi = {10.1007/978-3-662-53536-3\_24}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BohmovaCMPW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BartschiC0DGGLM16, author = {Andreas B{\"{a}}rtschi and J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Barbara Geissmann and Daniel Graf and Arnaud Labourel and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Collaborative Delivery with Energy-Constrained Mobile Robots}, journal = {CoRR}, volume = {abs/1608.08500}, year = {2016}, url = {http://arxiv.org/abs/1608.08500}, eprinttype = {arXiv}, eprint = {1608.08500}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BartschiC0DGGLM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GiesslerMMP16, author = {Paul Giessler and Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Paolo Penna}, title = {Sequential Solutions in Machine Scheduling Games}, journal = {CoRR}, volume = {abs/1611.04159}, year = {2016}, url = {http://arxiv.org/abs/1611.04159}, eprinttype = {arXiv}, eprint = {1611.04159}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GiesslerMMP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/im/MamageishviliMM15, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Dominik M{\"{u}}ller}, title = {Tree Nash Equilibria in the Network Creation Game}, journal = {Internet Math.}, volume = {11}, number = {4-5}, pages = {472--486}, year = {2015}, url = {https://doi.org/10.1080/15427951.2015.1016248}, doi = {10.1080/15427951.2015.1016248}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/im/MamageishviliMM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FlierMWZKS15, author = {Holger Flier and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer and Anna Zych and Yusuke Kobayashi and Anita Sch{\"{o}}bel}, title = {Selecting vertex disjoint paths in plane graphs}, journal = {Networks}, volume = {66}, number = {2}, pages = {136--144}, year = {2015}, url = {https://doi.org/10.1002/net.21618}, doi = {10.1002/NET.21618}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FlierMWZKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/Chalopin0DMW15, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Mapping Simple Polygons: The Power of Telling Convex from Reflex}, journal = {{ACM} Trans. Algorithms}, volume = {11}, number = {4}, pages = {33:1--33:16}, year = {2015}, url = {https://doi.org/10.1145/2700223}, doi = {10.1145/2700223}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/Chalopin0DMW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DisserFKM15, author = {Yann Disser and Andreas Emil Feldmann and Max Klimm and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Improving the Hk-bound on the price of stability in undirected Shapley network design games}, journal = {Theor. Comput. Sci.}, volume = {562}, pages = {557--564}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2014.10.037}, doi = {10.1016/J.TCS.2014.10.037}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DisserFKM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/BohmovaMNPW15, author = {Katerina B{\"{o}}hmov{\'{a}} and Mat{\'{u}}s Mihal{\'{a}}k and Peggy Neubert and Tobias Pr{\"{o}}ger and Peter Widmayer}, editor = {Giuseppe F. Italiano and Marie Schmidt}, title = {Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2015, September 17, 2015, Patras, Greece}, series = {OASIcs}, volume = {48}, pages = {68--81}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2015.68}, doi = {10.4230/OASICS.ATMOS.2015.68}, timestamp = {Tue, 15 Feb 2022 09:40:04 +0100}, biburl = {https://dblp.org/rec/conf/atmos/BohmovaMNPW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/MihalakM15, author = {Mat{\'{u}}s Mihal{\'{a}}k and Sandro Montanari}, editor = {Giuseppe F. Italiano and Marie Schmidt}, title = {Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2015, September 17, 2015, Patras, Greece}, series = {OASIcs}, volume = {48}, pages = {82--94}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2015.82}, doi = {10.4230/OASICS.ATMOS.2015.82}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/atmos/MihalakM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoa/MamageishviliM15, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Zaixin Lu and Donghyun Kim and Weili Wu and Wei Li and Ding{-}Zhu Du}, title = {Multicast Network Design Game on a Ring}, booktitle = {Combinatorial Optimization and Applications - 9th International Conference, {COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9486}, pages = {439--451}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-26626-8\_32}, doi = {10.1007/978-3-319-26626-8\_32}, timestamp = {Thu, 02 Dec 2021 16:45:00 +0100}, biburl = {https://dblp.org/rec/conf/cocoa/MamageishviliM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/GeissmannMW15, author = {Barbara Geissmann and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Adrian Kosowski and Igor Walukiewicz}, title = {Recurring Comparison Faults: Sorting and Finding the Minimum}, booktitle = {Fundamentals of Computation Theory - 20th International Symposium, {FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9210}, pages = {227--239}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-22177-9\_18}, doi = {10.1007/978-3-319-22177-9\_18}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/GeissmannMW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MamageishviliM15, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Multicast Network Design Game on a Ring}, journal = {CoRR}, volume = {abs/1507.04222}, year = {2015}, url = {http://arxiv.org/abs/1507.04222}, eprinttype = {arXiv}, eprint = {1507.04222}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MamageishviliM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MihalakUY15, author = {Mat{\'{u}}s Mihal{\'{a}}k and Przemyslaw Uznanski and Pencho Yordanov}, title = {Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences}, journal = {CoRR}, volume = {abs/1507.07727}, year = {2015}, url = {http://arxiv.org/abs/1507.07727}, eprinttype = {arXiv}, eprint = {1507.07727}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MihalakUY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MihalakPW15, author = {Mat{\'{u}}s Mihal{\'{a}}k and Paolo Penna and Peter Widmayer}, title = {Bribeproof mechanisms for two-values domains}, journal = {CoRR}, volume = {abs/1512.04277}, year = {2015}, url = {http://arxiv.org/abs/1512.04277}, eprinttype = {arXiv}, eprint = {1512.04277}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MihalakPW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DisserGMW14, author = {Yann Disser and Subir Kumar Ghosh and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Mapping a polygon with holes using a compass}, journal = {Theor. Comput. Sci.}, volume = {553}, pages = {106--113}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.12.010}, doi = {10.1016/J.TCS.2013.12.010}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DisserGMW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/FunkeM14, author = {Stefan Funke and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Stefan Funke and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Frontmatter, Table of Contents, Preface, Workshop Organization}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2014, September 11, 2014, Wroclaw, Poland}, series = {OASIcs}, volume = {42}, pages = {i--ix}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2014.i}, doi = {10.4230/OASICS.ATMOS.2014.I}, timestamp = {Tue, 15 Feb 2022 09:40:04 +0100}, biburl = {https://dblp.org/rec/conf/atmos/FunkeM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/BartschiGMTW14, author = {Andreas B{\"{a}}rtschi and Subir Kumar Ghosh and Mat{\'{u}}s Mihal{\'{a}}k and Thomas Tschager and Peter Widmayer}, editor = {Siu{-}Wing Cheng and Olivier Devillers}, title = {Improved bounds for the conflict-free chromatic art gallery problem}, booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan, June 08 - 11, 2014}, pages = {144}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2582112.2582117}, doi = {10.1145/2582112.2582117}, timestamp = {Mon, 14 Jun 2021 16:39:30 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/BartschiGMTW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChalopinJMW14, author = {J{\'{e}}r{\'{e}}mie Chalopin and Riko Jacob and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Data Delivery by Energy-Constrained Mobile Agents on a Line}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8573}, pages = {423--434}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43951-7\_36}, doi = {10.1007/978-3-662-43951-7\_36}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChalopinJMW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/DisserMMW14, author = {Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Sandro Montanari and Peter Widmayer}, editor = {Pierre Fouilhoux and Luis Eduardo Neves Gouveia and Ali Ridha Mahjoub and Vangelis Th. Paschos}, title = {Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods}, booktitle = {Combinatorial Optimization - Third International Symposium, {ISCO} 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8596}, pages = {208--220}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-09174-7\_18}, doi = {10.1007/978-3-319-09174-7\_18}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iscopt/DisserMMW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/MamageishviliMM14, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Simone Montemezzani}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {An {H} n/2 Upper Bound on the Price of Stability of Undirected Network Design Games}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8635}, pages = {541--552}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8\_46}, doi = {10.1007/978-3-662-44465-8\_46}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MamageishviliMM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/atmos/2014, editor = {Stefan Funke and Mat{\'{u}}s Mihal{\'{a}}k}, title = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2014, September 11, 2014, Wroclaw, Poland}, series = {OASIcs}, volume = {42}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, isbn = {978-3-939897-75-0}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/atmos/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MamageishviliMM14, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Simone Montemezzani}, title = {An {\textdollar}H{\_}\{n/2\}{\textdollar} Upper Bound on the Price of Stability of Undirected Network Design Games}, journal = {CoRR}, volume = {abs/1406.3597}, year = {2014}, url = {http://arxiv.org/abs/1406.3597}, eprinttype = {arXiv}, eprint = {1406.3597}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MamageishviliMM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Chalopin0DMW13, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Mapping Simple Polygons: How Robots Benefit from Looking Back}, journal = {Algorithmica}, volume = {65}, number = {1}, pages = {43--59}, year = {2013}, url = {https://doi.org/10.1007/s00453-011-9572-8}, doi = {10.1007/S00453-011-9572-8}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Chalopin0DMW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Chalopin0DMW13, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Simple agents learn to find their way: An introduction on mapping polygons}, journal = {Discret. Appl. Math.}, volume = {161}, number = {10-11}, pages = {1287--1307}, year = {2013}, url = {https://doi.org/10.1016/j.dam.2013.01.006}, doi = {10.1016/J.DAM.2013.01.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Chalopin0DMW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/MihalakS13, author = {Mat{\'{u}}s Mihal{\'{a}}k and Jan Christoph Schlegel}, title = {The Price of Anarchy in Network Creation Games Is (Mostly) Constant}, journal = {Theory Comput. Syst.}, volume = {53}, number = {1}, pages = {53--72}, year = {2013}, url = {https://doi.org/10.1007/s00224-013-9459-y}, doi = {10.1007/S00224-013-9459-Y}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/MihalakS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/algosensors/BiloDGMPW13, author = {Davide Bil{\`{o}} and Yann Disser and Luciano Gual{\`{a}} and Mat{\'{u}}s Mihal{\'{a}}k and Guido Proietti and Peter Widmayer}, editor = {Paola Flocchini and Jie Gao and Evangelos Kranakis and Friedhelm Meyer auf der Heide}, title = {Polygon-Constrained Motion Planning Problems}, booktitle = {Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8243}, pages = {67--82}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45346-5\_6}, doi = {10.1007/978-3-642-45346-5\_6}, timestamp = {Sun, 12 Mar 2023 00:57:49 +0100}, biburl = {https://dblp.org/rec/conf/algosensors/BiloDGMPW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/algosensors/Chalopin0MPW13, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Mat{\'{u}}s Mihal{\'{a}}k and Paolo Penna and Peter Widmayer}, editor = {Paola Flocchini and Jie Gao and Evangelos Kranakis and Friedhelm Meyer auf der Heide}, title = {Data Delivery by Energy-Constrained Mobile Agents}, booktitle = {Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8243}, pages = {111--122}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45346-5\_9}, doi = {10.1007/978-3-642-45346-5\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/algosensors/Chalopin0MPW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/BohmovaMPSW13, author = {Katerina B{\"{o}}hmov{\'{a}} and Mat{\'{u}}s Mihal{\'{a}}k and Tobias Pr{\"{o}}ger and Rastislav Sr{\'{a}}mek and Peter Widmayer}, editor = {Daniele Frigioni and Sebastian Stiller}, title = {Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations}, booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2013, September 5, 2013, Sophia Antipolis, France}, series = {OASIcs}, volume = {33}, pages = {27--41}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2013}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2013.27}, doi = {10.4230/OASICS.ATMOS.2013.27}, timestamp = {Tue, 15 Feb 2022 09:40:04 +0100}, biburl = {https://dblp.org/rec/conf/atmos/BohmovaMPSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/DisserFKM13, author = {Yann Disser and Andreas Emil Feldmann and Max Klimm and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Paul G. Spirakis and Maria J. Serna}, title = {Improving the \emph{H} \({}_{\mbox{ \emph{k} }}\)-Bound on the Price of Stability in Undirected Shapley Network Design Games}, booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013, Barcelona, Spain, May 22-24, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7878}, pages = {158--169}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38233-8\_14}, doi = {10.1007/978-3-642-38233-8\_14}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/DisserFKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BuhmannMSW13, author = {Joachim M. Buhmann and Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Peter Widmayer}, editor = {Robert D. Kleinberg}, title = {Robust optimization in the presence of uncertainty}, booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley, CA, USA, January 9-12, 2013}, pages = {505--514}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2422436.2422491}, doi = {10.1145/2422436.2422491}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BuhmannMSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BohmovaDMW13, author = {Katerina B{\"{o}}hmov{\'{a}} and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Frank Dehne and Roberto Solis{-}Oba and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Interval Selection with Machine-Dependent Intervals}, booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS} 2013, London, ON, Canada, August 12-14, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8037}, pages = {170--181}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40104-6\_15}, doi = {10.1007/978-3-642-40104-6\_15}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/BohmovaDMW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/MihalakSW13, author = {Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Peter Widmayer}, editor = {Christos Kaklamanis and Kirk Pruhs}, title = {Counting Approximately-Shortest Paths in Directed Acyclic Graphs}, booktitle = {Approximation and Online Algorithms - 11th International Workshop, {WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8447}, pages = {156--167}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-08001-7\_14}, doi = {10.1007/978-3-319-08001-7\_14}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/waoa/MihalakSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waw/MamageishviliMM13, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Dominik M{\"{u}}ller}, editor = {Anthony Bonato and Michael Mitzenmacher and Pawel Pralat}, title = {Tree Nash Equilibria in the Network Creation Game}, booktitle = {Algorithms and Models for the Web Graph - 10th International Workshop, {WAW} 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8305}, pages = {118--129}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03536-9\_10}, doi = {10.1007/978-3-319-03536-9\_10}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/waw/MamageishviliMM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-6707, author = {Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek}, title = {Counting approximately-shortest paths in directed acyclic graphs}, journal = {CoRR}, volume = {abs/1304.6707}, year = {2013}, url = {http://arxiv.org/abs/1304.6707}, eprinttype = {arXiv}, eprint = {1304.6707}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-6707.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MamageishviliMM13, author = {Akaki Mamageishvili and Mat{\'{u}}s Mihal{\'{a}}k and Dominik M{\"{u}}ller}, title = {Tree Nash Equilibria in the Network Creation Game}, journal = {CoRR}, volume = {abs/1310.8245}, year = {2013}, url = {http://arxiv.org/abs/1310.8245}, eprinttype = {arXiv}, eprint = {1310.8245}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MamageishviliMM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BiloDMSVW12, author = {Davide Bil{\`{o}} and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Subhash Suri and Elias Vicari and Peter Widmayer}, title = {Reconstructing visibility graphs with simple robots}, journal = {Theor. Comput. Sci.}, volume = {444}, pages = {52--59}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.01.008}, doi = {10.1016/J.TCS.2012.01.008}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BiloDMSVW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/algosensors/DisserGMW12, author = {Yann Disser and Subir Kumar Ghosh and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Amotz Bar{-}Noy and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Mapping a Polygon with Holes Using a Compass}, booktitle = {Algorithms for Sensor Systems, 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, {ALGOSENSORS} 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {7718}, pages = {78--89}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-36092-3\_9}, doi = {10.1007/978-3-642-36092-3\_9}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/algosensors/DisserGMW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/MihalakS12, author = {Mat{\'{u}}s Mihal{\'{a}}k and Jan Christoph Schlegel}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, title = {Asymmetric Swap-Equilibrium: {A} Unifying Equilibrium Concept for Network Creation Games}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, pages = {693--704}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32589-2\_60}, doi = {10.1007/978-3-642-32589-2\_60}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MihalakS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wafr/DisserMW12, author = {Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Emilio Frazzoli and Tom{\'{a}}s Lozano{-}P{\'{e}}rez and Nicholas Roy and Daniela Rus}, title = {Mapping Polygons with Agents That Measure Angles}, booktitle = {Algorithmic Foundations of Robotics {X} - Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2012, MIT, Cambridge, Massachusetts, USA, June 13-15 2012}, series = {Springer Tracts in Advanced Robotics}, volume = {86}, pages = {415--425}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-36279-8\_25}, doi = {10.1007/978-3-642-36279-8\_25}, timestamp = {Fri, 19 May 2017 01:26:04 +0200}, biburl = {https://dblp.org/rec/conf/wafr/DisserMW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-3850, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons}, journal = {CoRR}, volume = {abs/1204.3850}, year = {2012}, url = {http://arxiv.org/abs/1204.3850}, eprinttype = {arXiv}, eprint = {1204.3850}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-3850.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-2090, author = {Yann Disser and Andreas Emil Feldmann and Max Klimm and Mat{\'{u}}s Mihal{\'{a}}k}, title = {Improving the {\textdollar}H{\_}k{\textdollar}-Bound on the Price of Stability in Undirected Shapley Network Design Games}, journal = {CoRR}, volume = {abs/1211.2090}, year = {2012}, url = {http://arxiv.org/abs/1211.2090}, eprinttype = {arXiv}, eprint = {1211.2090}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-2090.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGHMVW11, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, title = {How to Guard a Graph?}, journal = {Algorithmica}, volume = {61}, number = {4}, pages = {839--856}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9382-4}, doi = {10.1007/S00453-009-9382-4}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGHMVW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/DisserMW11, author = {Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {A polygon is determined by its angles}, journal = {Comput. Geom.}, volume = {44}, number = {8}, pages = {418--426}, year = {2011}, url = {https://doi.org/10.1016/j.comgeo.2011.04.003}, doi = {10.1016/J.COMGEO.2011.04.003}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/DisserMW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/BohlinFMM11, author = {Markus Bohlin and Holger Flier and Jens Maue and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Alberto Caprara and Spyros C. Kontogiannis}, title = {Track Allocation in Freight-Train Classification with Mixed Tracks}, booktitle = {{ATMOS} 2011 - 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Saarbr{\"{u}}cken, Germany, September 8, 2011}, series = {OASIcs}, volume = {20}, pages = {38--51}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany}, year = {2011}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2011.38}, doi = {10.4230/OASICS.ATMOS.2011.38}, timestamp = {Fri, 05 Apr 2024 10:04:16 +0200}, biburl = {https://dblp.org/rec/conf/atmos/BohlinFMM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/MihalakSSW11, author = {Mat{\'{u}}s Mihal{\'{a}}k and Marcel Sch{\"{o}}ngens and Rastislav Sr{\'{a}}mek and Peter Widmayer}, editor = {Ivana Cern{\'{a}} and Tibor Gyim{\'{o}}thy and Juraj Hromkovic and Keith G. Jeffery and Rastislav Kr{\'{a}}lovic and Marko Vukolic and Stefan Wolf}, title = {On the Complexity of the Metric {TSP} under Stability Considerations}, booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 22-28, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6543}, pages = {382--393}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-18381-2\_32}, doi = {10.1007/978-3-642-18381-2\_32}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/MihalakSSW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChalopinDDMW11, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Thomas Schwentick and Christoph D{\"{u}}rr}, title = {Telling convex from reflex allows to map a polygon}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2011, March 10-12, 2011, Dortmund, Germany}, series = {LIPIcs}, volume = {9}, pages = {153--164}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.STACS.2011.153}, doi = {10.4230/LIPICS.STACS.2011.153}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/ChalopinDDMW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FlierMWZ11, author = {Holger Flier and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer and Anna Zych}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Maximum Independent Set in 2-Direction Outersegment Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {155--166}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_15}, doi = {10.1007/978-3-642-25870-1\_15}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FlierMWZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BiloEMW10, author = {Davide Bil{\`{o}} and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, title = {Discovery of network properties with all-shortest-paths queries}, journal = {Theor. Comput. Sci.}, volume = {411}, number = {14-15}, pages = {1626--1637}, year = {2010}, url = {https://doi.org/10.1016/j.tcs.2010.01.010}, doi = {10.1016/J.TCS.2010.01.010}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BiloEMW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atmos/FlierMSWZ10, author = {Holger Flier and Mat{\'{u}}s Mihal{\'{a}}k and Anita Sch{\"{o}}bel and Peter Widmayer and Anna Zych}, editor = {Thomas Erlebach and Marco E. L{\"{u}}bbecke}, title = {Vertex Disjoint Paths for Dispatching in Railways}, booktitle = {{ATMOS} 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010}, series = {OASIcs}, volume = {14}, pages = {61--73}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany}, year = {2010}, url = {https://doi.org/10.4230/OASIcs.ATMOS.2010.61}, doi = {10.4230/OASICS.ATMOS.2010.61}, timestamp = {Fri, 05 Apr 2024 10:04:16 +0200}, biburl = {https://dblp.org/rec/conf/atmos/FlierMSWZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/ChalopinDDMW10, author = {J{\'{e}}r{\'{e}}mie Chalopin and Shantanu Das and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Tiziana Calamoneri and Josep D{\'{\i}}az}, title = {How Simple Robots Benefit from Looking Back}, booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010, Rome, Italy, May 26-28, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6078}, pages = {229--239}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13073-1\_21}, doi = {10.1007/978-3-642-13073-1\_21}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/ChalopinDDMW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/MihalakS10, author = {Mat{\'{u}}s Mihal{\'{a}}k and Jan Christoph Schlegel}, editor = {Spyros C. Kontogiannis and Elias Koutsoupias and Paul G. Spirakis}, title = {The Price of Anarchy in Network Creation Games Is (Mostly) Constant}, booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010, Athens, Greece, October 18-20, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6386}, pages = {276--287}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16170-4\_24}, doi = {10.1007/978-3-642-16170-4\_24}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/sagt/MihalakS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/DisserMW10, author = {Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Haim Kaplan}, title = {Reconstructing a Simple Polygon from Its Angles}, booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6139}, pages = {13--24}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13731-0\_2}, doi = {10.1007/978-3-642-13731-0\_2}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/DisserMW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/BiloDMSVW09, author = {Davide Bil{\`{o}} and Yann Disser and Mat{\'{u}}s Mihal{\'{a}}k and Subhash Suri and Elias Vicari and Peter Widmayer}, editor = {Shay Kutten and Janez Zerovnik}, title = {Reconstructing Visibility Graphs with Simple Robots}, booktitle = {Structural Information and Communication Complexity, 16th International Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5869}, pages = {87--99}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11476-2\_8}, doi = {10.1007/978-3-642-11476-2\_8}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/BiloDMSVW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sss/KomuravelliM09, author = {Anvesh Komuravelli and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Rachid Guerraoui and Franck Petit}, title = {Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision}, booktitle = {Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, {SSS} 2009, Lyon, France, November 3-6, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5873}, pages = {458--471}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-05118-0\_32}, doi = {10.1007/978-3-642-05118-0\_32}, timestamp = {Wed, 07 Dec 2022 23:13:25 +0100}, biburl = {https://dblp.org/rec/conf/sss/KomuravelliM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/ErlebachM09, author = {Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Evripidis Bampis and Klaus Jansen}, title = {A {(4} + \emph{epsilon})-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs}, booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA} 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5893}, pages = {135--146}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-12450-1\_13}, doi = {10.1007/978-3-642-12450-1\_13}, timestamp = {Thu, 23 Sep 2021 11:48:40 +0200}, biburl = {https://dblp.org/rec/conf/waoa/ErlebachM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:series/lncs/GattoMMW09, author = {Michael Gatto and Jens Maue and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Ravindra K. Ahuja and Rolf H. M{\"{o}}hring and Christos D. Zaroliagis}, title = {Shunting for Dummies: An Introductory Algorithmic Survey}, booktitle = {Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems}, series = {Lecture Notes in Computer Science}, volume = {5868}, pages = {310--337}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-05465-5\_13}, doi = {10.1007/978-3-642-05465-5\_13}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/series/lncs/GattoMMW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/algosensors/BrunnerMSVW08, author = {Jan Brunner and Mat{\'{u}}s Mihal{\'{a}}k and Subhash Suri and Elias Vicari and Peter Widmayer}, editor = {S{\'{a}}ndor P. Fekete}, title = {Simple Robots in Polygonal Environments: {A} Hierarchy}, booktitle = {Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, {ALGOSENSORS} 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5389}, pages = {111--124}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92862-1\_10}, doi = {10.1007/978-3-540-92862-1\_10}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/algosensors/BrunnerMSVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGHMVW08, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, editor = {Seok{-}Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, title = {How to Guard a Graph?}, booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC} 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5369}, pages = {318--329}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92182-0\_30}, doi = {10.1007/978-3-540-92182-0\_30}, timestamp = {Thu, 27 Apr 2023 14:57:19 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGHMVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/DasMSVW08, author = {Shantanu Das and Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Elias Vicari and Peter Widmayer}, editor = {Theodore P. Baker and Alain Bui and S{\'{e}}bastien Tixeuil}, title = {Rendezvous of Mobile Agents When Tokens Fail Anytime}, booktitle = {Principles of Distributed Systems, 12th International Conference, {OPODIS} 2008, Luxor, Egypt, December 15-18, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5401}, pages = {463--480}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92221-6\_29}, doi = {10.1007/978-3-540-92221-6\_29}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/opodis/DasMSVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/BiloEMW08, author = {Davide Bil{\`{o}} and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Peter Widmayer}, editor = {Alexander A. Shvartsman and Pascal Felber}, title = {Discovery of Network Properties with All-Shortest-Paths Queries}, booktitle = {Structural Information and Communication Complexity, 15th International Colloquium, {SIROCCO} 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5058}, pages = {89--103}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-69355-0\_9}, doi = {10.1007/978-3-540-69355-0\_9}, timestamp = {Thu, 23 Jun 2022 19:57:45 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/BiloEMW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HoffmannEKMR08, author = {Michael Hoffmann and Thomas Erlebach and Danny Krizanc and Mat{\'{u}}s Mihal{\'{a}}k and Rajeev Raman}, editor = {Susanne Albers and Pascal Weil}, title = {Computing Minimum Spanning Trees with Uncertainty}, booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings}, series = {LIPIcs}, volume = {1}, pages = {277--288}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1358}, doi = {10.4230/LIPICS.STACS.2008.1358}, timestamp = {Tue, 22 Jun 2021 15:44:08 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HoffmannEKMR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GfellerMSVW08, author = {Beat Gfeller and Mat{\'{u}}s Mihal{\'{a}}k and Subhash Suri and Elias Vicari and Peter Widmayer}, editor = {Joachim Gudmundsson}, title = {Angle Optimization in Target Tracking}, booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5124}, pages = {65--76}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-69903-3\_8}, doi = {10.1007/978-3-540-69903-3\_8}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/GfellerMSVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0802-2855, author = {Thomas Erlebach and Michael Hoffmann and Danny Krizanc and Mat{\'{u}}s Mihal{\'{a}}k and Rajeev Raman}, title = {Computing Minimum Spanning Trees with Uncertainty}, journal = {CoRR}, volume = {abs/0802.2855}, year = {2008}, url = {http://arxiv.org/abs/0802.2855}, eprinttype = {arXiv}, eprint = {0802.2855}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0802-2855.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ErlebachJMNSW07, author = {Thomas Erlebach and Riko Jacob and Mat{\'{u}}s Mihal{\'{a}}k and Marc Nunkesser and G{\'{a}}bor Szab{\'{o}} and Peter Widmayer}, title = {An Algorithmic View on {OVSF} Code Assignment}, journal = {Algorithmica}, volume = {47}, number = {3}, pages = {269--298}, year = {2007}, url = {https://doi.org/10.1007/s00453-006-0188-3}, doi = {10.1007/S00453-006-0188-3}, timestamp = {Thu, 26 Apr 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachJMNSW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/algosensors/GfellerMSVW07, author = {Beat Gfeller and Mat{\'{u}}s Mihal{\'{a}}k and Subhash Suri and Elias Vicari and Peter Widmayer}, editor = {Miroslaw Kutylowski and Jacek Cichon and Przemyslaw Kubiak}, title = {Counting Targets with Mobile Sensors in an Unknown Environment}, booktitle = {Algorithmic Aspects of Wireless Sensor Networks, Third International Workshop, {ALGOSENSORS} 2007, Wroclaw, Poland, July 14, 2007, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {4837}, pages = {32--45}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-77871-4\_5}, doi = {10.1007/978-3-540-77871-4\_5}, timestamp = {Mon, 23 Oct 2023 15:28:12 +0200}, biburl = {https://dblp.org/rec/conf/algosensors/GfellerMSVW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/ErlebachHM07, author = {Thomas Erlebach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Juraj Hromkovic and Richard Kr{\'{a}}lovic and Marc Nunkesser and Peter Widmayer}, title = {Approximate Discovery of Random Graphs}, booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4665}, pages = {82--92}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74871-7\_8}, doi = {10.1007/978-3-540-74871-7\_8}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/saga/ErlebachHM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsac/BeerliovaEEHHMR06, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, title = {Network Discovery and Verification}, journal = {{IEEE} J. Sel. Areas Commun.}, volume = {24}, number = {12}, pages = {2168--2181}, year = {2006}, url = {https://doi.org/10.1109/JSAC.2006.884015}, doi = {10.1109/JSAC.2006.884015}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsac/BeerliovaEEHHMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AmbuhlEMN06, author = {Christoph Amb{\"{u}}hl and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Marc Nunkesser}, editor = {Josep D{\'{\i}}az and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Uri Zwick}, title = {Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona, Spain, August 28-30 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4110}, pages = {3--14}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11830924\_3}, doi = {10.1007/11830924\_3}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/AmbuhlEMN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/ErlebachHHM06, author = {Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano}, title = {Network Discovery and Verification with Distance Queries}, booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome, Italy, May 29-31, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3998}, pages = {69--80}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11758471\_10}, doi = {10.1007/11758471\_10}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/ErlebachHHM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BeerliovaEEHHMR05, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, editor = {Dieter Kratsch}, title = {Network Discovery and Verification}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {127--138}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_12}, doi = {10.1007/11604686\_12}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/BeerliovaEEHHMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/BeerliovaEEHHMR05, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, editor = {Susanne Albers and Rolf H. M{\"{o}}hring and Georg Ch. Pflug and R{\"{u}}diger Schultz}, title = {Network Discovery and Verification}, booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January 2005}, series = {Dagstuhl Seminar Proceedings}, volume = {05031}, publisher = {IBFI, Schloss Dagstuhl, Germany}, year = {2005}, url = {http://drops.dagstuhl.de/opus/volltexte/2005/59}, timestamp = {Thu, 10 Jun 2021 13:02:06 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BeerliovaEEHHMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ErlebachJMNSW04, author = {Thomas Erlebach and Riko Jacob and Mat{\'{u}}s Mihal{\'{a}}k and Marc Nunkesser and G{\'{a}}bor Szab{\'{o}} and Peter Widmayer}, editor = {Volker Diekert and Michel Habib}, title = {An Algorithmic View on {OVSF} Code Assignment}, booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2996}, pages = {270--281}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-24749-4\_24}, doi = {10.1007/978-3-540-24749-4\_24}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ErlebachJMNSW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/ErlebachJMNSW04, author = {Thomas Erlebach and Riko Jacob and Mat{\'{u}}s Mihal{\'{a}}k and Marc Nunkesser and G{\'{a}}bor Szab{\'{o}} and Peter Widmayer}, editor = {Giuseppe Persiano and Roberto Solis{-}Oba}, title = {Joint Base Station Scheduling}, booktitle = {Approximation and Online Algorithms, Second International Workshop, {WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3351}, pages = {225--238}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-31833-0\_19}, doi = {10.1007/978-3-540-31833-0\_19}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/waoa/ErlebachJMNSW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.