Author of the publication

Quantifying Degrees of Controllability in Temporal Networks with Uncertainty.

, , , and . ICAPS, page 22-30. AAAI Press, (2019)

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.

 

Other publications of authors with the same name

Improved Approximation for Longest Common Subsequence over Small Alphabets., and . ICALP, volume 198 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Faster Algorithms for Bounded Tree Edit Distance., and . ICALP, volume 198 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)MAJORITY-3SAT (and Related Problems) in Polynomial Time., and . FOCS, page 1033-1043. IEEE, (2021)Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity., , , , and . ITCS, volume 215 of LIPIcs, page 3:1-3:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Near-Optimal Quantum Algorithms for String Problems., and . CoRR, (2021)An Efficient Algorithm for All-Pairs Bounded Edge Connectivity., and . ICALP, volume 261 of LIPIcs, page 11:1-11:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Quantifying Degrees of Controllability in Temporal Networks with Uncertainty., , , and . ICAPS, page 22-30. AAAI Press, (2019)An Efficient Algorithm for All-Pairs Bounded Edge Connectivity., and . Algorithmica, 86 (5): 1623-1656 (May 2024)Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity., , , , and . Algorithmica, 85 (8): 2395-2426 (August 2023)Faster Detours in Undirected Graphs., , , and . ESA, volume 274 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)