Autor/in Mnich, Matthias Saurabh, Saket Lokshtanov, Daniel 5 Philip, Geevarghese 3 Fernau, Henning 2 Fomin, Fedor V. 2 Fellows, Michael 1 Misra, Neeldhara 1 Rosamond, Frances 1 Suchý, Ondřej 1 alle zeigenListe einklappen
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
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound Mnich, Matthias Philip, Geevarghese Saurabh, Saket Suchý, Ondřej 2012 - TUHH Open Research
Planar $k$-path in subexponential time and polynomial space Lokshtanov, Daniel Mnich, Matthias Saurabh, Saket 2011 - TUHH Open Research
Ranking and drawing in subexponential time Fernau, Henning Fomin, Fedor V. Lokshtanov, Daniel Mnich, Matthias Philip, Geevarghese Saurabh, Saket 2011 - TUHH Open Research
The complexity ecology of parameters: An illustration using bounded max leaf number Fellows, Michael Lokshtanov, Daniel Misra, Neeldhara Mnich, Matthias Rosamond, Frances Saurabh, Saket 2009 - TUHH Open Research
Linear kernel for planar connected dominating set Lokshtanov, Daniel Mnich, Matthias Saurabh, Saket 2009 - TUHH Open Research