Researcher

Mihalák, Matúš

Assistant Professor

View graph of relations
  1. 2018
  2. Published
  3. Published
    Böhmová, K., Chalopin, J., Mihalák, M., Proietti, G., & Widmayer, P. (2018). Sequence Hypergraphs: Paths, Flows, and Cuts. In H. J. Böckenhauer, D. Komm, & W. Unger (Eds.), Adventures Between Lower Bounds and Higher Altitudes (pp. 191-215). (Lecture Notes in Computer Science,; Vol. 11011). Springer. https://doi.org/10.1007/978-3-319-98355-4_12
  4. Published
    Goblet, A., Kelk, S., Mihalák, M., & Stamoulis, G. (2018). On a Fixed Haplotype Variant of the Minimum Error Correction Problem. In L. Wang, & D. Zhu (Eds.), Computing and Combinatorics. COCOON 2018 (pp. 554-566). (Lecture Notes in Computer Science; Vol. 10976). Springer Verlag. https://doi.org/10.1007/978-3-319-94776-1_46
  5. Published
  6. Published
    Böhmová, K., Häfliger, L., Mihalák, M., Pröger, T., Sacomoto, G., & Sagot, M-F. (2018). Computing and Listing st-Paths in Public Transportation Networks. Theory of Computing Systems, 62(3), 600-621. https://doi.org/10.1007/s00224-016-9747-4
  7. Published
    Bärtschi, A., Graf, D., & Mihalák, M. (2018). Collective Fast Delivery by Energy-Efficient Agents. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, pp. 56:1-56:16). (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.56
  8. Published
    Ficker, A. M. C., Erlebach, T., Mihalák, M., & Spieksma, F. C. R. (2018). Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. In W-L. Hsu, D-T. Lee, & C-S. Liao (Eds.), 29th International Symposium on Algorithms and Computation (ISAAC 2018) (Vol. 123, pp. 45:1-45:12). (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.45
  9. 2017
  10. Published
  11. 2016
  12. Published
  13. Published
  14. Published
    Böhmová, K., Kravina, E., & Mihalák, M. (2016). Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. In Proc. 4th International Symposium on Combinatorial Optimization (ISCO) (pp. 345-356). (Lecture Notes in Computer Science; Vol. 9849). Springer. https://doi.org/10.1007/978-3-319-45587-7_30
  15. Published
    Mihalák, M., Penna, P., & Widmayer, P. (2016). Bribeproof Mechanisms for Two-Values Domains. In Proc. 9th International Symposium on Algorithmic Game Theory (SAGT) (pp. 289-301). (Lecture Notes in Computer Science; Vol. 9928). Springer. https://doi.org/10.1007/978-3-662-53354-3_23
  16. Published
    Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., ... Mihalák, M. (2016). Collaborative Delivery with Energy-Constrained Mobile Robots. In Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 258-274). (Lecture Notes in Computer Science; Vol. 9988). Springer. https://doi.org/10.1007/978-3-319-48314-6_17
  17. Published
    Böhmová, K., Mihalák, M., Pröger, T., Sacomoto, G., & Sagot, M-F. (2016). Computing and Listing st-Paths in Public Transportation Networks. In Proc. 11th International Computer Science Symposium in Russia (CSR) (pp. 102-116) https://doi.org/10.1007/978-3-319-34171-2_8
  18. Published
    Mihalák, M., Uznanski, P., & Yordanov, P. (2016). Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. In Proc. Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (pp. 93-105). SIAM. https://doi.org/10.1137/1.9781611974324.10
  19. Published
    Böhmová, K., Disser, Y., Mihalák, M., & Šrámek, R. (2016). Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. In Proc. 12th Latin American Symposium on Theoretical Informatics (LATIN) (pp. 220-234). (Lecture Notes in Computer Science; Vol. 9644). Springer. https://doi.org/10.1007/978-3-662-49529-2_17
  20. Published
    Böhmová, K., Chalopin, J., Mihalák, M., Proietti, G., & Widmayer, P. (2016). Sequence Hypergraphs. In Proc. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 282-294). (Lecture Notes in Computer Science; Vol. 9941). Springer. https://doi.org/10.1007/978-3-662-53536-3_24
  21. 2015
  22. Published
    Mihalák, M., & Montanari, S. (2015). Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. In Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) (pp. 82-94). (OpenAccess Series in Informatics (OASIcs); Vol. 48). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/OASIcs.ATMOS.2015.82
  23. Published
  24. Published
    Mamageishvili, A., & Mihalák, M. (2015). Multicast Network Design Game on a Ring. In Proc. 9th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 439-451). (Lecture Notes in Computer Science; Vol. 9486). Springer. https://doi.org/10.1007/978-3-319-26626-8_32
  25. Published
    Geissmann, B., Mihalák, M., & Widmayer, P. (2015). Recurring Comparison Faults: Sorting and Finding the Minimum. In Proc. of the 20th International Symposium on Fundamentals of Computation Theory (FCT) (pp. 227-239). (Lecture Notes in Computer Science; Vol. 9210). Springer. https://doi.org/10.1007/978-3-319-22177-9_18
  26. Published
    Böhmová, K., Mihalák, M., Neubert, P., Pröger, T., & Widmayer, P. (2015). Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. In Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) (pp. 68-81). (OpenAccess Series in Informatics (OASIcs); Vol. 48). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/OASIcs.ATMOS.2015.68
  27. Flier, H., Mihalák, M., Widmayer, P., Zych, A., Kobayashi, Y., & Schöbel, A. (2015). Selecting vertex disjoint paths in plane graphs. Networks, 66(2), 136-144. https://doi.org/10.1002/net.21618
  28. 2014
  29. Published
    Mamageishvili, A., Mihalák, M., & Montemezzani, S. (2014). An H_{n/2} Upper Bound on the Price of Stability of Undirected Network Design Games. In Proc. 39th International Symposium on Mathematical Foundations of Computer Science (MFCS) (pp. 541-552). (Lecture Notes in Computer Science; Vol. 8635). Springer. https://doi.org/10.1007/978-3-662-44465-8_46
  30. Published
    Chalopin, J., Jacob, R., Mihalák, M., & Widmayer, P. (2014). Data Delivery by Energy-Constrained Mobile Agents on a Line. In Proc. ICALP 2014 (pp. 423-434). (Lecture Notes in Computer Science; Vol. 8573). Springer.
  31. Published
    Bärtschi, A., Ghosh, S. K., Mihalák, M., Tschager, T., & Widmayer, P. (2014). Improved bounds for the conflict-free chromatic art gallery problem. In Proc. 30th Annual Symposium on Computational Geometry (SOCG) (pp. 144). ACM New York. https://doi.org/10.1145/2582112.2582117
  32. Published
  33. Published
    Disser, Y., Mihalák, M., Montanari, S., & Widmayer, P. (2014). Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. In Proc. Third International Symposium on Combinatorial Optimization (ISCO) (pp. 208-220). (Lecture Notes in Computer Science; Vol. 8596). Springer. https://doi.org/10.1007/978-3-319-09174-7_18
  34. 2013
  35. Published
  36. Published
    Mihalák, M., Šrámek, R., & Widmayer, P. (2013). Counting Approximately-Shortest Paths in Directed Acyclic Graphs. In Proc. 11th International Workshop on Approximation and Online Algorithms (WAOA) (pp. 156-167). (Lecture Notes in Computer Science; Vol. 8447). Springer Verlag. https://doi.org/10.1007/978-3-319-08001-7_14
  37. Published
    Chalopin, J., Das, S., Mihalák, M., Penna, P., & Widmayer, P. (2013). Data Delivery by Energy-Constrained Mobile Agents. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) (pp. 111-122). (Lecture Notes in Computer Science; Vol. 8243). Springer Verlag. https://doi.org/10.1007/978-3-642-45346-5_9
  38. Published
    Disser, Y., Feldmann, A. E., Klimm, M., & Mihalak, M. (2013). Improving the H_k Bound on the Price of Stability in Undirected Shapley Network Design Games. In Proc. Algorithms and Complexity, 8th International Conference (CIAC) (pp. 158-169). (Lecture Notes in Computer Science; Vol. 7878). Springer Verlag. https://doi.org/10.1007/978-3-642-38233-8_14
  39. Published
    Böhmová, K., Disser, Y., Mihalák, M., & Widmayer, P. (2013). Interval Selection with Machine-Dependent Intervals. In Proc. 13 th International Symposium on Algorithms and Data Structures (WADS) (pp. 170-181). (Lecture Notes in Computer Science; Vol. 8037). Springer Verlag. https://doi.org/10.1007/978-3-642-40104-6_15
  40. Published
  41. Published
    Bilò, D., Disser, Y., Gualà, L., Mihalák, M., Proietti, G., & Widmayer, P. (2013). Polygon-Constrained Motion Planning Problems. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) (pp. 67-82). (Lecture Notes in Computer Science; Vol. 8243). Springer Verlag. https://doi.org/10.1007/978-3-642-45346-5_6
  42. Published
    Buhmann, J. M., Mihalák, M., Šrámek, R., & Widmayer, P. (2013). Robust optimization in the presence of uncertainty. In Proc. Innovations in Theoretical Computer Science (ITCS) (pp. 505-514). ACM New York. https://doi.org/10.1145/2422436.2422491
  43. Published
    Böhmová, K., Mihalák, M., Pröger, T., Šrámek, R., & Widmayer, P. (2013). Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. In Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) (pp. 27-41). (OpenAccess Series in Informatics (OASIcs); Vol. 33). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/OASIcs.ATMOS.2013.27
  44. Published
  45. Published
  46. Published
    Mamageishvili, A., Mihalák, M., & Müller, D. (2013). Tree Nash Equilibria in the Network Creation Game. In Proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph (WAW) (pp. 118-129). (Lecture Notes in Computer Science ; Vol. 8305). Springer Verlag. https://doi.org/10.1007/978-3-319-03536-9_10
  47. 2012
  48. Published
    Mihalák, M., & Schlegel, J. C. (2012). Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS) (pp. 693-704). (Lecture Notes in Computer Science; Vol. 7464). Springer Verlag. https://doi.org/10.1007/978-3-642-32589-2_60
  49. Published
    Disser, Y., Mihalák, M., Ghosh, S. K., & Widmayer, P. (2012). Mapping a polygon with holes using a compass. In Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (Algosensors) (pp. 78-89). (Lecture Notes in Computer Science; Vol. 7718). Springer Verlag. https://doi.org/10.1007/978-3-642-36092-3_9
  50. Published
    Disser, Y., Mihalak, M., & Widmayer, P. (2012). Mapping polygons with agents that measure angles. In Proceedings of the Tenth International Workshop on the Algorithmic Foundations of Robotics (WAFR) (pp. 415-425). (Springer Tracts in Advanced Robotics; Vol. 86). Springer Verlag.
  51. Published
  52. 2011
  53. Published
  54. Published
    Fomin, F. V., Golovach, P. A., Hall, A., Mihalák, M., Vicari, E., & Widmayer, P. (2011). How to Guard a Graph? Algorithmica, 61(4), 839-856. https://doi.org/10.1007/s00453-009-9382-4
  55. Flier, H., Mihalák, M., Widmayer, P., & Zych, A. (2011). Maximum Independent Set in 2-Direction Outersegment Graphs. In Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 155-166) https://doi.org/10.1007/978-3-642-25870-1_15
  56. Mihalák, M., Schöngens, M., Šrámek, R., & Widmayer, P. (2011). On the Complexity of the Metric TSP under Stability Considerations. In Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) (pp. 382-393) https://doi.org/10.1007/978-3-642-18381-2_32
Previous 1 2 Next