( en | de | ru )

 

Disambiguation of "Kristan, Jan Matyás"

Author of the publication

copydeleteadd this publication to your clipboard
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.

, , , , , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 23-38. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jan Matyas

Heribert Kristan

Jörg Kristan

Dorothea Matyas

Georg Kristan

 

Other publications of authors with the same name

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time., , and . CoRR, (2023)Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set., , , , , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 23-38. Springer, (2021)On the m-eternal Domination Number of Cactus Graphs., , and . RP, volume 11674 of Lecture Notes in Computer Science, page 33-47. Springer, (2019)Polynomial kernels for tracking shortest paths., , , , , and . Inf. Process. Lett., (2023)Polynomial Kernels for Tracking Shortest Paths., , , , , and . CoRR, (2022)Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology., , , , and . CoRR, (2023)Shortest Dominating Set Reconfiguration Under Token Sliding., and . FCT, volume 14292 of Lecture Notes in Computer Science, page 333-347. Springer, (2023)Efficient attack sequences in m-eternal domination., , and . CoRR, (2022)Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology., , , , and . AAAI, page 17380-17388. AAAI Press, (2024)Constant factor approximation for tracking paths and fault tolerant feedback vertex set., , , , , and . Discret. Optim., (February 2023)