Author of the publication

Feedback Edge Sets in Temporal Graphs.

, , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 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. 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 Maximum Matchings in Temporal Graphs., , , , and . STACS, volume 154 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Equitable scheduling on a single machine., , , , , and . J. Sched., 26 (2): 209-225 (2023)Enumerating Isolated Cliques in Temporal Networks., , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 519-531. Springer, (2019)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)Assessing the computational complexity of multilayer subgraph detection., , , , , and . Network Science, 7 (2): 215-241 (2019)Realizing temporal transportation trees., , and . CoRR, (2024)On the parameterized complexity of interval scheduling with eligible machine sets., , , and . J. Comput. Syst. Sci., (2024)The Complexity of Finding Small Separators in Temporal Graphs., , , and . MFCS, volume 117 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient algorithms for measuring the funnel-likeness of DAGs., , , and . J. Comb. Optim., 39 (1): 216-245 (2020)Listing All Maximal k-Plexes in Temporal Graphs., , , , , and . ASONAM, page 41-46. IEEE Computer Society, (2018)