If you made any changes in Pure these will be visible here soon.

Research Output 2004 2018

  • 52 Conference article in proceeding
  • 21 Article
  • 2 Chapter
  • 1 Doctoral Thesis
2018

Collective Fast Delivery by Energy-Efficient Agents

Bärtschi, A., Graf, D. & Mihalák, M., 2018, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Potapov, I., Spirakis, P. & Worrell, J. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Vol. 117. p. 56:1-56:16 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Computing and Listing st-Paths in Public Transportation Networks

Böhmová, K., Häfliger, L., Mihalák, M., Pröger, T., Sacomoto, G. & Sagot, M-F., 1 Apr 2018, In : Theory of Computing Systems. 62, 3, p. 600-621 22 p.

Research output: Contribution to journalArticleAcademicpeer-review

Improved bounds on equilibria solutions in the network design game

Mamageishvili, A., Mihalak, M. & Montemezzani, S., 1 Nov 2018, In : International Journal of Game Theory. 47, 4, p. 1113-1135 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

On a Fixed Haplotype Variant of the Minimum Error Correction Problem

Goblet, A., Kelk, S., Mihalák, M. & Stamoulis, G., 29 Jun 2018, Computing and Combinatorics. COCOON 2018. Wang, L. & Zhu, D. (eds.). Springer Verlag, p. 554-566 (Lecture Notes in Computer Science, Vol. 10976).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm

Ficker, A. M. C., Erlebach, T., Mihalák, M. & Spieksma, F. C. R., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Hsu, W-L., Lee, D-T. & Liao, C-S. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Vol. 123. p. 45:1-45:12 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Robust optimization in the presence of uncertainty: A generic approach

Buhmann, J. M., Gronskiy, A. Y., Mihalák, M., Pröger, T., Šrámek, R. & Widmayer, P., Jun 2018, In : Journal of Computer and System Sciences. 94, p. 135-166 32 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access

Sequence Hypergraphs: Paths, Flows, and Cuts

Böhmová, K., Chalopin, J., Mihalák, M., Proietti, G. & Widmayer, P., 9 Aug 2018, Adventures Between Lower Bounds and Higher Altitudes. Böckenhauer, H. J., Komm, D. & Unger, W. (eds.). Springer, p. 191-215 (Lecture Notes in Computer Science,, Vol. 11011).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

2017

Collaborative delivery with energy-constrained mobile robots

Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A. & Mihalák, M., 2017, In : Theoretical Computer Science. in press

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
2016

Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs

Mihalák, M., Šrámek, R. & Widmayer, P., Jan 2016, In : Theory of Computing Systems. 58, 1, p. 45-59 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores

Böhmová, K., Kravina, E. & Mihalák, M., 2016, Proc. 4th International Symposium on Combinatorial Optimization (ISCO). Springer, p. 345-356 12 p. (Lecture Notes in Computer Science, Vol. 9849).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Bribeproof Mechanisms for Two-Values Domains

Mihalák, M., Penna, P. & Widmayer, P., 2016, Proc. 9th International Symposium on Algorithmic Game Theory (SAGT). Springer, p. 289-301 13 p. (Lecture Notes in Computer Science, Vol. 9928).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Collaborative Delivery with Energy-Constrained Mobile Robots

Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A. & Mihalák, M., 2016, Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO). Springer, p. 258-274 17 p. (Lecture Notes in Computer Science, Vol. 9988).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Computing and Listing st-Paths in Public Transportation Networks

Böhmová, K., Mihalák, M., Pröger, T., Sacomoto, G. & Sagot, M-F., 2016, Proc. 11th International Computer Science Symposium in Russia (CSR). p. 102-116 15 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Optimization Methods for Multistage Freight Train Formation

Bohlin, M., Gestrelius, S., Dahms, F., Mihalák, M. & Flier, H., Aug 2016, In : Transportation Science. 50, 3, p. 823-840 18 p.

Research output: Contribution to journalArticleAcademicpeer-review

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences

Mihalák, M., Uznanski, P. & Yordanov, P., 2016, Proc. Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, p. 93-105 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs

Böhmová, K., Disser, Y., Mihalák, M. & Šrámek, R., 2016, Proc. 12th Latin American Symposium on Theoretical Informatics (LATIN). Springer, p. 220-234 15 p. (Lecture Notes in Computer Science, Vol. 9644).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Sequence Hypergraphs

Böhmová, K., Chalopin, J., Mihalák, M., Proietti, G. & Widmayer, P., 2016, Proc. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Springer, p. 282-294 13 p. (Lecture Notes in Computer Science, Vol. 9941).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

2015

Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks

Mihalák, M. & Montanari, S., 2015, Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 82-94 13 p. (OpenAccess Series in Informatics (OASIcs), Vol. 48).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Improving the Hk-bound on the price of stability in undirected Shapley network design games

Disser, Y., Feldmann, A. E., Klimm, M. & Mihalák, M., 2015, In : Theoretical Computer Science. 562, p. 557-564 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Mapping Simple Polygons: The Power of Telling Convex from Reflex

Chalopin, J., Das, S., Disser, Y., Mihalák, M. & Widmayer, P., 2015, In : ACM Transactions on Algorithms. 11, 4, p. 33.1-33.16

Research output: Contribution to journalArticleAcademicpeer-review

Multicast Network Design Game on a Ring

Mamageishvili, A. & Mihalák, M., 2015, Proc. 9th International Conference on Combinatorial Optimization and Applications (COCOA). Springer, p. 439-451 13 p. (Lecture Notes in Computer Science, Vol. 9486).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Recurring Comparison Faults: Sorting and Finding the Minimum

Geissmann, B., Mihalák, M. & Widmayer, P., 2015, Proc. of the 20th International Symposium on Fundamentals of Computation Theory (FCT). Springer, p. 227-239 13 p. (Lecture Notes in Computer Science, Vol. 9210).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past

Böhmová, K., Mihalák, M., Neubert, P., Pröger, T. & Widmayer, P., 2015, Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 68-81 14 p. (OpenAccess Series in Informatics (OASIcs), Vol. 48).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Selecting vertex disjoint paths in plane graphs

Flier, H., Mihalák, M., Widmayer, P., Zych, A., Kobayashi, Y. & Schöbel, A., 2015, In : Networks. 66, 2, p. 136-144 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

Tree Nash Equilibria in the Network Creation Game

Mamageishvili, A., Mihalák, M. & Müller, D., 2015, In : Internet Mathematics. 11, 4-5, p. 472-486 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

2014

An H_{n/2} Upper Bound on the Price of Stability of Undirected Network Design Games

Mamageishvili, A., Mihalák, M. & Montemezzani, S., 2014, Proc. 39th International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer, p. 541-552 12 p. (Lecture Notes in Computer Science, Vol. 8635).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Data Delivery by Energy-Constrained Mobile Agents on a Line

Chalopin, J., Jacob, R., Mihalák, M. & Widmayer, P., 2014, Proc. ICALP 2014. Springer, p. 423-434 12 p. (Lecture Notes in Computer Science, Vol. 8573).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Improved bounds for the conflict-free chromatic art gallery problem

Bärtschi, A., Ghosh, S. K., Mihalák, M., Tschager, T. & Widmayer, P., 2014, Proc. 30th Annual Symposium on Computational Geometry (SOCG). ACM New York, p. 144 1 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Mapping a polygon with holes using a compass

Disser, Y., Ghosh, S. K., Mihalák, M. & Widmayer, P., 2014, In : Theoretical Computer Science. 553, p. 106-113 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods

Disser, Y., Mihalák, M., Montanari, S. & Widmayer, P., 2014, Proc. Third International Symposium on Combinatorial Optimization (ISCO). Springer, p. 208-220 13 p. (Lecture Notes in Computer Science, Vol. 8596).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

2013

Counting approximately-shortest paths in directed acyclic graphs

Mihalák, M., Šrámek, R. & Widmayer, P., 24 Apr 2013, In : arXiv .

Research output: Contribution to journalArticleAcademic

Counting Approximately-Shortest Paths in Directed Acyclic Graphs

Mihalák, M., Šrámek, R. & Widmayer, P., 2013, Proc. 11th International Workshop on Approximation and Online Algorithms (WAOA). Springer Verlag, p. 156-167 12 p. (Lecture Notes in Computer Science, Vol. 8447).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Data Delivery by Energy-Constrained Mobile Agents

Chalopin, J., Das, S., Mihalák, M., Penna, P. & Widmayer, P., 2013, Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS). Springer Verlag, p. 111-122 12 p. (Lecture Notes in Computer Science, Vol. 8243).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Improving the H_k Bound on the Price of Stability in Undirected Shapley Network Design Games

Disser, Y., Feldmann, A. E., Klimm, M. & Mihalak, M., 2013, Proc. Algorithms and Complexity, 8th International Conference (CIAC). Springer Verlag, p. 158-169 12 p. (Lecture Notes in Computer Science, Vol. 7878).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Interval Selection with Machine-Dependent Intervals

Böhmová, K., Disser, Y., Mihalák, M. & Widmayer, P., 2013, Proc. 13 th International Symposium on Algorithms and Data Structures (WADS). Springer Verlag, p. 170-181 12 p. (Lecture Notes in Computer Science, Vol. 8037).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Mapping Simple Polygons: How Robots Benefit from Looking Back

Chalopin, J., Das, S., Disser, Y., Mihalák, M. & Widmayer, P., 2013, In : Algorithmica. 65, 1, p. 43-59 17 p.

Research output: Contribution to journalArticleAcademicpeer-review

Polygon-Constrained Motion Planning Problems

Bilò, D., Disser, Y., Gualà, L., Mihalák, M., Proietti, G. & Widmayer, P., 2013, Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS). Springer Verlag, p. 67-82 16 p. (Lecture Notes in Computer Science, Vol. 8243).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Robust optimization in the presence of uncertainty

Buhmann, J. M., Mihalák, M., Šrámek, R. & Widmayer, P., 2013, Proc. Innovations in Theoretical Computer Science (ITCS). ACM New York, p. 505-514 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations

Böhmová, K., Mihalák, M., Pröger, T., Šrámek, R. & Widmayer, P., 2013, Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 27-41 15 p. (OpenAccess Series in Informatics (OASIcs), Vol. 33).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Simple agents learn to find their way: An introduction on mapping polygons

Chalopin, J., Das, S., Disser, Y., Mihalák, M. & Widmayer, P., 2013, In : Discrete Applied Mathematics. 161, 10--11, p. 1287-1307 21 p.

Research output: Contribution to journalArticleAcademicpeer-review

The Price of Anarchy in Network Creation Games Is (Mostly) Constant

Mihalák, M. & Schlegel, J. C., 2013, In : Theory of Computing Systems. 53, 1, p. 53-72 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

Tree Nash Equilibria in the Network Creation Game

Mamageishvili, A., Mihalák, M. & Müller, D., 2013, Proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph (WAW). Springer Verlag, p. 118-129 12 p. (Lecture Notes in Computer Science, Vol. 8305).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

2012

Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games

Mihalák, M. & Schlegel, J. C., 2012, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer Verlag, p. 693-704 12 p. (Lecture Notes in Computer Science, Vol. 7464).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Mapping a polygon with holes using a compass

Disser, Y., Mihalák, M., Ghosh, S. K. & Widmayer, P., 2012, Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (Algosensors). Springer Verlag, p. 78-89 12 p. (Lecture Notes in Computer Science, Vol. 7718).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Mapping polygons with agents that measure angles

Disser, Y., Mihalak, M. & Widmayer, P., 2012, Proceedings of the Tenth International Workshop on the Algorithmic Foundations of Robotics (WAFR). Springer Verlag, p. 415-425 (Springer Tracts in Advanced Robotics, Vol. 86).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Reconstructing visibility graphs with simple robots

Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. & Widmayer, P., 2012, In : Theoretical Computer Science. 444, p. 52-59 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

2011

A polygon is determined by its angles

Disser, Y., Mihalák, M. & Widmayer, P., 2011, In : Computational Geometry-Theory and Applications. 44, 8, p. 418-426 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

How to Guard a Graph?

Fomin, F. V., Golovach, P. A., Hall, A., Mihalák, M., Vicari, E. & Widmayer, P., 2011, In : Algorithmica. 61, 4, p. 839-856 18 p.

Research output: Contribution to journalArticleAcademicpeer-review

Maximum Independent Set in 2-Direction Outersegment Graphs

Flier, H., Mihalák, M., Widmayer, P. & Zych, A., 2011, Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). p. 155-166 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

On the Complexity of the Metric TSP under Stability Considerations

Mihalák, M., Schöngens, M., Šrámek, R. & Widmayer, P., 2011, Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). p. 382-393 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review