Michal Dvorák

Orcid: 0000-0002-5048-773X

Affiliations:
  • Czech Technical University in Prague, Faculty of Information Technology, Prague, Czech Republic


According to our database1, Michal Dvorák authored at least 5 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Parameterized Complexity of Scheduling Problems in Robotic Process Automation.
CoRR, January, 2026

2025
Practical approach to <i>2</i>-Euclidean Preferences.
CoRR, February, 2025

Pathfinding in Self-Deleting Graphs.
Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024
On the Complexity of Target Set Selection in Simple Geometric Networks.
Discret. Math. Theor. Comput. Sci., 2024

2023
Establishing Herd Immunity is Hard Even in Simple Geometric Networks.
Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023


  Loading...