Jan Matyás Kristan

Orcid: 0000-0001-6657-0020

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Decreasing verification radius in local certification.
CoRR, 2024

Brief Announcement: Decreasing Verification Radius in Local Certification.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Romeo and Juliet Is EXPTIME-Complete.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Constant factor approximation for tracking paths and fault tolerant feedback vertex set.
Discret. Optim., February, 2023

Polynomial kernels for tracking shortest paths.
Inf. Process. Lett., 2023

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

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

Shortest Dominating Set Reconfiguration Under Token Sliding.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Efficient attack sequences in m-eternal domination.
CoRR, 2022

2019
On the m-eternal Domination Number of Cactus Graphs.
Proceedings of the Reachability Problems - 13th International Conference, 2019


  Loading...