List of publications

2025

  1. Fioravantes, F., Knop, D., Křišťan, J. M., Melissinos, N., Opler, M., & Vu, T. A. (2025). Solving Multiagent Path Finding on Highly Centralized Networks. In J. Shah & Z. Kolter (Eds.), Proceedings of the 39th AAAI Conference on Artificial Intelligence, AAAI ’25 (pp. 23186–23193). AAAI Press. https://doi.org/10.1609/aaai.v39i22.34484
  2. Křišťan, J. M., & Svoboda, J. (2025). Reconfiguration Using Generalized Token Jumping. In S.-ichi Nakano & M. Xiao (Eds.), Proceedings of the 19th International Conference and Workshops on Algorithms and Computation, WALCOM ’25 (Vol. 15411, pp. 244–265). Springer. https://doi.org/10.1007/978-981-96-2845-2_16
  3. Fioravantes, F., Knop, D., Křišťan, J. M., Melissinos, N., & Opler, M. (2025). Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. In J. Shah & Z. Kolter (Eds.), Proceedings of the 39th AAAI Conference on Artificial Intelligence, AAAI ’25 (pp. 23177–23185). AAAI Press. https://doi.org/10.1609/aaai.v39i22.34483
  4. Feuilloley, L., Janoušek, J., Křišťan, J. M., & Sedláček, J. E. (2025). Decreasing verification radius in local certification. Theoretical Computer Science, 1056, 115520. https://doi.org/10.1016/j.tcs.2025.115520
  5. Cabello, S., Das, A. K., Křišťan, J. M., & Valla, T. (2025). Heterogeneous Facility Location Game with Discrete Utility. In I. Lynce, N. Murano, M. Vallati, S. Villata, F. Chesani, M. Milano, & A. Omicini (Eds.), Proceedings of the 28th European Conference on Artificial Intelligence, ECAI ’25 (Vol. 413, pp. 1342–1349). IOS Press.
  6. Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., & Yeo, M. (2025). Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection. In D. R. Kowalski (Ed.), Proceedings of the 39th International Symposium on Distributed Computing, DISC ’25 (Vol. 356, pp. 23:1–23:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2025.23

2024

  1. 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.
  2. 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.
  3. 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.
  4. 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

2023

  1. 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
  2. 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
  3. 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

2021

  1. Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2021). Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. Proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA ’21, 12982, 23–38. https://doi.org/10.1007/978-3-030-92702-8_2

2019

  1. 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