( en | de | ru )

 

Disambiguation of "Mnich, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Resolving Infeasibility of Linear Systems: A Parameterized Approach.

, , and . IPEC, volume 148 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Leonie Mnich

Jürgen Mnich

Robert Mnich

Franz Mnich

 

Other publications of authors with the same name

New algorithms for maximum disjoint paths based on tree-likeness, , and . Mathematical Programming, (Nov 14, 2017)Stable Matchings with Covering Constraints: A Complete Computational Trichotomy., and . Algorithmica, 82 (5): 1136-1188 (2020)Resolving Infeasibility of Linear Systems: A Parameterized Approach., , , and . CoRR, (2022)Induced Matchings in Subcubic Planar Graphs., , and . ESA (2), volume 6347 of Lecture Notes in Computer Science, page 112-122. Springer, (2010)Domination When the Stars Are Out., , , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 462-473. Springer, (2011)Linear Kernel for Planar Connected Dominating Set., , and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 281-290. Springer, (2009)Voting and Bribing in Single-Exponential Time., , and . STACS, volume 66 of LIPIcs, page 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots., , and . ESA, volume 274 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Hitting Long Directed Cycles Is Fixed-Parameter Tractable., , and . ICALP, volume 168 of LIPIcs, page 59:1-59:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines., , , , and . ISAAC, volume 283 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)