66 citations · 154 across the 32 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.DS2009★ 1 cited
Betweenness Parameterized Above Tight Lower Bound
Gregory Gutin, Eun Jung Kim, Matthias Mnich +1
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…
cs.DM2009
Feedback Vertex Sets in Tournaments
Serge Gaspers, Matthias Mnich
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the…
cs.DM2009
Computing Rooted and Unrooted Maximum Consistent Supertrees
Leo van Iersel, Matthias Mnich
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted b…