Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems
| Image |  |
|---|---|
| Description | |
| Author/s |
author: Matthias Mnich Henning Fernau Daniel Lokshtanov Fedor Fomin Saket Saurabh |
| Publication date | August 2014 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |