Author of the publication

How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?

, , , , , and . ICALP, volume 132 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Computing and counting longest paths on circular-arc graphs in polynomial time., and . Discret. Appl. Math., (2014)An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy.. SODA, page 1306-1317. SIAM, (2011)Stably Computing Order Statistics with Arithmetic Population Protocols., , , and . MFCS, volume 58 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Natural Models for Evolution on Networks., , , and . WINE, volume 7090 of Lecture Notes in Computer Science, page 290-301. Springer, (2011)The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial.. ESA, volume 8125 of Lecture Notes in Computer Science, page 719-730. Springer, (2013)Interference-free Walks in Time: Temporally Disjoint Paths., , , , and . IJCAI, page 4090-4096. ijcai.org, (2021)Sliding Window Temporal Graph Coloring., , and . AAAI, page 7667-7674. AAAI Press, (2019)Temporal Graph Realization from Fastest Paths., , , and . SAND, volume 292 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Graphs with minimum fractional domatic number., , , and . Discret. Appl. Math., (January 2024)On the intersection of tolerance and cocomparability graphs., and . Discret. Appl. Math., (2016)