Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

Henning Fernau^*, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Pages (from-to)	374-386
Journal	Tsinghua Science and Technology
Volume	19
Issue number	4
DOIs	https://doi.org/10.1109/TST.2014.6867519
Publication status	Published - 2014
Externally published	Yes

Access to Document

@article{6aa720434950413396d9b4f27a686e23,

title = "Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems",

author = "Henning Fernau and Fomin, {Fedor V.} and Daniel Lokshtanov and Matthias Mnich and Geevarghese Philip and Saket Saurabh",

year = "2014",

doi = "10.1109/TST.2014.6867519",

language = "English",

volume = "19",

pages = "374--386",

journal = "Tsinghua Science and Technology",

issn = "1007-0214",

publisher = "Tsing Hua University",

number = "4",

}

TY - JOUR

T1 - Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

AU - Fernau, Henning

AU - Fomin, Fedor V.

AU - Lokshtanov, Daniel

AU - Mnich, Matthias

AU - Philip, Geevarghese

AU - Saurabh, Saket

PY - 2014

Y1 - 2014

U2 - 10.1109/TST.2014.6867519

DO - 10.1109/TST.2014.6867519

M3 - Article

VL - 19

SP - 374

EP - 386

JO - Tsinghua Science and Technology

JF - Tsinghua Science and Technology

SN - 1007-0214

IS - 4

ER -