( en | de | ru )

 

Disambiguation of "Mnich, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized complexity dichotomy for Steiner Multicut.

, , , and . J. Comput. Syst. Sci., 82 (6): 1020-1043 (2016)

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.

Joachim Mnich

Jürgen Mnich

Leonie Mnich

Robert Mnich

Peter Mnich

 

Other publications of authors with the same name

On Feedback Vertex Sets in Tournaments, and . CoRR, (2009)Bisections above Tight Lower Bounds., and . WG, volume 7551 of Lecture Notes in Computer Science, page 184-193. Springer, (2012)Feedback Vertex Sets in Tournaments., and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 267-277. Springer, (2010)Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set., , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 249-261. Springer, (2019)When Does Schwartz Conjecture Hold?, , and . IJCAI, page 603-609. AAAI Press, (2015)Dynamic Parameterized Problems and Algorithms., , and . ICALP, volume 80 of LIPIcs, page 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Dense Steiner problems: Approximation algorithms and inapproximability., , , and . CoRR, (2020)Engineering Kernelization for Maximum Cut., , , , , and . CoRR, (2019)Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter, , , , , and . ACM Transactions on Algorithms, (2024)to appear.New Support Size Bounds and Proximity Bounds for Integer Linear Programming., , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 82-95. Springer, (2024)