( en | de | ru )

 

Disambiguation of "Komusiewicz, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

, , , and . STACS, volume 219 of LIPIcs, page 42:1-42:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Martin Komusiewicz

 

Other publications of authors with the same name

Destroying Bicolored P3s by Deleting Few Edges., , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 193-204. Springer, (2019)Tight Running Time Lower Bounds for Vertex Deletion Problems.. CoRR, (2015)Can Local Optimality Be Used for Efficient Data Reduction?, and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 354-366. Springer, (2021)The Parameterized Complexity of s-Club with Triangle and Seed Constraints., , and . Theory Comput. Syst., 67 (5): 1050-1081 (October 2023)On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics., , and . ACDA, page 13-24. SIAM, (2023)On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure., , and . CPM, volume 105 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Critical Node Problems with Vulnerable Vertices., , , and . J. Graph Algorithms Appl., 28 (1): 1-26 (2024)On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric., , , and . MFCS, volume 272 of LIPIcs, page 54:1-54:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)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)String Factorizations Under Various Collision Constraints., , , and . CPM, volume 161 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)