Autor/in Mnich, Matthias Wiese, Andreas 2 Dvořák, Zdeněk 1 Fernau, Henning 1 Fomin, Fedor V. 1 Hermelin, Danny 1 Jacob, Riko 1 Leeuwen, Erik Jan van 1 Lieber, Tobias 1 Lokshtanov, Daniel 1 Niedermeier, Rolf 1 Philip, Geevarghese 1 Saurabh, Saket 1 Weller, Mathias 1 van Bevern, René 1 alle zeigenListe einklappen
Treewidth computation and kernelization in the parallel external memory model Jacob, Riko Lieber, Tobias Mnich, Matthias 2014 - TUHH Open Research
Interval scheduling and colorful independent sets van Bevern, René Mnich, Matthias Niedermeier, Rolf Weller, Mathias 2014 - TUHH Open Research
Social choice meets graph drawing : how to get subexponential time algorithms for ranking and drawing problems Fernau, Henning Fomin, Fedor V. Lokshtanov, Daniel Mnich, Matthias Philip, Geevarghese Saurabh, Saket 2014 - TUHH Open Research
Parameterized complexity of induced graph matching on claw-free graphs Hermelin, Danny Mnich, Matthias Leeuwen, Erik Jan van 2014 - TUHH Open Research
Large independent sets in triangle-free planar graphs Dvořák, Zdeněk Mnich, Matthias 2014 - TUHH Open Research