Author of the publication

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

, , and . IPEC, volume 285 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

On Critical Node Problems with Vulnerable Vertices., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 494-508. Springer, (2022)Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study., and . CoRR, (2024)Destroying Bicolored P3s by Deleting Few Edges., , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 193-204. Springer, (2019)On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem., , , and . CPM, volume 259 of LIPIcs, page 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model., , and . IPEC, volume 285 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks., and . IPEC, volume 285 of LIPIcs, page 30:1-30:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Finding Degree-Constrained Acyclic Orientations., , , and . IPEC, volume 285 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead., and . CoRR, (2024)On Critical Node Problems with Vulnerable Vertices., , , and . J. Graph Algorithms Appl., 28 (1): 1-26 (2024)