List of publications

2024

Křišťan, J. M., & Sedláček, J. E. (2024). Brief Announcement: Decreasing verification radius in local certification. 38th International Symposium on Distributed Computing, DISC ’24.
Feuilloley, L., Janoušek, J., Křišťan, J. M., & Sedláček, J. E. (2024). Decreasing verification radius in local certification. 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN ’24.
Gahlawa, H., Křišťan, J. M., & Valla, T. (2024). Romeo and Juliet is EXPTIME-complete. In R. Královič & A. Kučera (Eds.), Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, MFCS ’24 (Vol. 306). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Fioravantes, F., Knop, D., Křišťan, J. M., Melissinos, N., & Opler, M. (2024). Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. In M. Wooldridge, J. Dy, & S. Natarajan (Eds.), Proceedings of the 38th AAAI Conference on Artificial Intelligence, AAAI ’24: Vol. 38, part 16 (pp. 17380–17388). AAAI Press. https://doi.org/10.1609/aaai.v38i16.29686

Křišťan, J. M., & Svoboda, J. (2023). Shortest Dominating Set Reconfiguration Under Token Sliding. In Fundamentals of Computation Theory (pp. 333–347). Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-43587-4_24
Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2023). Polynomial kernels for tracking shortest paths. Information Processing Letters, 179, 106315. https://doi.org/10.1016/j.ipl.2022.106315
Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2023). Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discrete Optimization, 47, 100756. https://doi.org/10.1016/j.disopt.2022.100756

Blažej, V., Křišt’an, J. M., & Valla, T. (2019). On the m-eternal Domination Number of Cactus Graphs. In Lecture Notes in Computer Science (pp. 33–47). Springer International Publishing. https://doi.org/10.1007/978-3-030-30806-3_4