Autor/in Mnich, Matthias Philip, Geevarghese Saurabh, Saket 3 Fernau, Henning 2 Fomin, Fedor V. 2 Lokshtanov, Daniel 2 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
Ranking and drawing in subexponential time Fernau, Henning Fomin, Fedor V. Lokshtanov, Daniel Mnich, Matthias Philip, Geevarghese Saurabh, Saket 2011 - TUHH Open Research