Combinatorial n-fold integer programming and applications von Knop, Dušan, Koutecký, Martin, Mnich, Matthias

Volltext

Approximations for many-visits multiple traveling salesman problems von Bérczi, Kristóf, Mnich, Matthias, Vincze, Roland

Volltext

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy von Mnich, Matthias, Schlotter, Ildikó

Volltext

High-multiplicity N-fold IP via configuration LP von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

Volltext

Max-Cut Parameterized Above the Edwards-Erdős Bound von Crowston, Robert, Jones, Mark, Mnich, Matthias

Volltext

REACHABILITY SWITCHING GAMES von Fearnley, John, Gairing, Martin, Mnich, Matthias, Savani, Rahul

Volltext

Scheduling and fixed-parameter tractability von Mnich, Matthias, Wiese, Andreas

Volltext

Parameterized complexity of machine scheduling: 15 open problems von Mnich, Matthias, van Bevern, René

Volltext

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts von Etscheid, Michael, Mnich, Matthias

Volltext

Social Choice Meets Graph Drawing： How to Get Subexponential Time Algorithms for Ranking and Drawing Problems von Fernau, Henning, Fomin, Fedor V., Lokshtanov, Daniel, Mnich, Matthias, Philip, Geevarghese, Saurabh, Saket

Volltext

Serial batching to minimize the weighted number of tardy jobs von Hermelin, Danny, Mnich, Matthias, Omlor, Simon

Volltext

Dynamic Parameterized Problems and Algorithms von Alman, Josh, Mnich, Matthias, Williams, Virginia Vassilevska

Volltext

New algorithms for maximum disjoint paths based on tree-likeness von Fleszar, Krzysztof, Mnich, Matthias, Spoerhase, Joachim

Volltext

Kernel and fast algorithm for dense triplet inconsistency von Guillemot, Sylvain, Mnich, Matthias

Volltext

Feedback Vertex Sets in Tournaments von Gaspers, Serge, Mnich, Matthias

Volltext

Improved integrality gap upper bounds for traveling salesperson problems with distances one and two von Mnich, Matthias, Mömke, Tobias

Volltext

ODD MULTIWAY CUT IN DIRECTED ACYCLIC GRAPHS von Chandrasekaran, Karthekeyan, Mnich, Matthias, Mozaffari, Sahand

Volltext

A 3/2-Approximation for the Metric Many-Visits Path TSP von Bérczi, Kristóf, Mnich, Matthias, Vincze, Roland

Volltext

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter von Chalermsook, Parinya, Kaul, Matthias, Mnich, Matthias, Spoerhase, Joachim, Uniyal, Sumedha, Vaz, Daniel

Volltext

Parameterized algorithms for generalizations of Directed Feedback Vertex Set von Göke, Alexander, Marx, Dániel, Mnich, Matthias

Volltext