Author of the publication

The Complexity of Transitively Orienting Temporal Graphs.

, , , , and . MFCS, volume 202 of LIPIcs, page 75:1-75:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Feedback Edge Sets in Temporal Graphs., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 200-212. Springer, (2020)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 49-77. Springer, (2020)Sharp Thresholds in Random Simple Temporal Graphs., , , and . FOCS, page 319-326. IEEE, (2021)Algorithmic and structural aspects of temporal graphs.. Technical University of Berlin, Germany, (2023)Sharp Thresholds in Random Simple Temporal Graphs, , , and . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), page 319-326. (February 2022)Enumerating Isolated Cliques in Temporal Networks., , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 519-531. Springer, (2019)Demand-Driven Line Planning with Selfish Routing., , , , and . OR, page 687-692. Springer, (2017)Two Influence Maximization Games on Graphs Made Temporal., , , , , and . IJCAI, page 45-51. ijcai.org, (2021)Using a Geometric Lens to Find k Disjoint Shortest Paths., , , and . ICALP, volume 198 of LIPIcs, page 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Temporal Reachability Minimization: Delaying vs. Deleting., , and . MFCS, volume 202 of LIPIcs, page 76:1-76:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)