( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Feedback Edge Sets in Temporal Graphs.

, , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 200-212. Springer, (2020)

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.

Hildegard Renken

Michael Renken

Petra Renken

Christian Renken

Anja Renken

 

Другие публикации лиц с тем же именем

Feedback Edge Sets in Temporal Graphs., , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 200-212. Springer, (2020)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , и . Treewidth, Kernels, and Algorithms, том 12160 из Lecture Notes in Computer Science, стр. 49-77. Springer, (2020)Sharp Thresholds in Random Simple Temporal Graphs., , , и . FOCS, стр. 319-326. IEEE, (2021)Sharp Thresholds in Random Simple Temporal Graphs, , , и . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), стр. 319-326. (февраля 2022)Algorithmic and structural aspects of temporal graphs.. Technical University of Berlin, Germany, (2023)Sharp Thresholds in Random Simple Temporal Graphs., , , и . CoRR, (2020)https://arxiv.org/abs/2011.03738.Enumerating Isolated Cliques in Temporal Networks., , и . COMPLEX NETWORKS (2), том 882 из Studies in Computational Intelligence, стр. 519-531. Springer, (2019)Using a Geometric Lens to Find k Disjoint Shortest Paths., , , и . ICALP, том 198 из LIPIcs, стр. 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Temporal Reachability Minimization: Delaying vs. Deleting., , и . MFCS, том 202 из LIPIcs, стр. 76:1-76:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Two Influence Maximization Games on Graphs Made Temporal., , , , , и . IJCAI, стр. 45-51. ijcai.org, (2021)