Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mnich, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parameterized complexity dichotomy for Steiner multicut
Karl Bringmann
,
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 157-170
Large independent sets in triangle-free planar graphs
Zdenȇk Dvoȓák
,
Matthias Mnich
Lecture Notes in Computer Science
8737
, 2014, pp. 346-357
Parameterized complexity of induced graph matching on claw-free graphs
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Algorithmica
70
(3), 2014, pp. 513-560
Beyond Max-Cut:
\lambda
-extendible properties parameterized above the Poljak-Turzík bound
Matthias Mnich
,
Geevarghese Philip
,
Saket Saurabh
,
Ondȓej Suchý
Journal of Computer and System Sciences
80
(7), 2014, pp. 1384-1403
Scheduling and fixed-parameter tractability
Matthias Mnich
,
Andreas Wiese
Lecture Notes in Computer Science
8494
, 2014, pp. 381-392
Feedback vertex sets in tournaments
Serge Gaspers
,
Matthias Mnich
Journal of Graph Theory
72
(1), 2013, pp. 72-89
Kernel and fast algorithm for dense triplet inconsistency
Sylvain Guillemot
,
Matthias Mnich
Theoretical Computer Science
494
, 2013, pp. 134-143
Max-cut parameterized above the Edwards-Erdŏs bound
Robert Crowston
,
Mark Jones
,
Matthias Mnich
Lecture Notes in Computer Science
7391
, 2012, pp. 242-253
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
Gregory Gutin
,
Leo van Iersel
,
Matthias Mnich
,
Anders Yeo
Journal of Computer and System Sciences
78
(1), 2012, pp. 151-163
Parameterized complexity of induced
H
-matching on claw-free graphs
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
7501
, 2012, pp. 624-635
Induced matchings in subcubic planar graphs
Ross J. Kang
,
Matthias Mnich
,
Tobias Müller
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1383-1411
Beyond Max-Cut: Lambda-extendible properties parameterized above the Poljak-Turzik bound
Matthias Mnich
,
Geevarghese Philip
,
Saket Saurabh
,
Ondrej Suchy
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 412-423
Bisections above tight lower bounds
Matthias Mnich
,
Rico Zenklusen
Lecture Notes in Computer Science
7551
, 2012, pp. 184-193
Bisections above tight lower bounds
Matthias Mnich
,
Rico Zenklusen
Lecture Notes in Computer Science
7551
, 2012, pp. 184-193
Interval scheduling and colorful independent sets
René van Bevern
,
Matthias Mnich
,
Rolf Niedermeier
,
Mathias Weller
Lecture Notes in Computer Science
7676
, 2012, pp. 247-256
Domination when the stars are out
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
6755
, 2011, pp. 462-473
Planar
k
-path in subexponential time and polynomial space
Daniel Lokshtanov
,
Matthias Mnich
,
Saket Saurabh
Lecture Notes in Computer Science
6986
, 2011, pp. 262-270
A linear kernel for a planar connected dominating set
Daniel Lokshtanov
,
Matthias Mnich
,
Saket Saurabh
Theoretical Computer Science
412
(23), 2011, pp. 2536-2543
Feedback vertex sets in tournaments
Serge Gaspers
,
Matthias Mnich
Lecture Notes in Computer Science
6346
, 2010, pp. 267-277
Betweenness parameterized above tight lower bound
Gregory Gutin
,
Eun Jung Kim
,
Matthias Mnich
,
Anders Yeo
Journal of Computer and System Sciences
76
(8), 2010, pp. 872-878
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
Gregory Gutin
,
Leo van Iersel
,
Matthias Mnich
,
Anders Yeo
Lecture Notes in Computer Science
6346
, 2010, pp. 326-337
Induced matchings in subcubic planar graphs
Ross J. Kang
,
Matthias Mnich
,
Tobias Müller
Lecture Notes in Computer Science
6347
, 2010, pp. 112-122
The complexity ecology of parameters: An illustration using bounded max leaf number
Michael Fellows
,
Daniel Lokshtanov
,
Neeldhara Misra
,
Matthias Mnich
,
Frances Rosamond
,
Saket Saurabh
Theory of Computing Systems
45
(4), 2009, pp. 822-848