#### Filter Results:

- Full text PDF available (29)

#### Publication Year

1999

2019

- This year (4)
- Last 5 years (47)
- Last 10 years (82)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leo van Iersel, Steven Kelk, Matthias Mnich
- J. Bioinformatics and Computational Biology
- 2007

Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal… (More)

- Matthias Mnich, Andreas Wiese
- Math. Program.
- 2015

Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though… (More)

- René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
- J. Scheduling
- 2015

Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an integer $$k$$k,… (More)

- Robert Crowston, Michael Peyton Jones, Matthias Mnich
- ICALP
- 2012

We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the Edwards-Erdős bound is fixed-parameter tractable: we give an algorithm that for… (More)

- Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
- J. Comput. Syst. Sci.
- 2009

We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the {\sc Betweenness} problem parameterized above its tight lower… (More)

- Dusan Knop, Martin Koutecký, Matthias Mnich
- STACS
- 2017

We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate wins the manipulated… (More)

- Zdenek Dvorak, Matthias Mnich
- ESA
- 2013

Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n… (More)

- Michael Etscheid, Matthias Mnich
- Algorithmica
- 2017

The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit… (More)

- Matthias Mnich, Erik Jan van Leeuwen
- Discrete Optimization
- 2017

Abstract We consider the problem to find a set X of vertices (or arcs) with | X | ≤ k in a given digraph G such that D = G − X is an acyclic digraph. In its generality, this is Directed Feedback… (More)

- Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
- Algorithmica
- 2012

The Induced Graph Matching problem asks to find $$k$$k disjoint induced subgraphs isomorphic to a given graph $$H$$H in a given graph $$G$$G such that there are no edges between vertices of different… (More)