Jan Matyás Kristan

According to our database, Jan Matyás Kristan authored at least 14 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Solving Multiagent Path Finding on Highly Centralized Networks.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu

CoRR, 2024

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

CoRR, 2024

Reconfiguration Using Generalized Token Jumping.

Jan Matyás Kristan, Jakub Svoboda

CoRR, 2024

Brief Announcement: Decreasing Verification Radius in Local Certification.

Jan Matyás Kristan, Josef Erik Sedlácek

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Romeo and Juliet Is EXPTIME-Complete.

Harmender Gahlawat, Jan Matyás Kristan, Tomás Valla

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Decreasing Verification Radius in Local Certification.

Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek

Proceedings of the Algorithmics of Wireless Networks - 20th International Symposium, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Constant factor approximation for tracking paths and fault tolerant feedback vertex set.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Discret. Optim., February, 2023

Polynomial kernels for tracking shortest paths.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Inf. Process. Lett., 2023

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

CoRR, 2023

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

CoRR, 2023

Shortest Dominating Set Reconfiguration Under Token Sliding.

Jan Matyás Kristan, Jakub Svoboda

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Efficient attack sequences in m-eternal domination.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

CoRR, 2022

2019

On the m-eternal Domination Number of Cactus Graphs.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

Proceedings of the Reachability Problems - 13th International Conference, 2019