Tsinghua University Press Ltd. - Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

Author(s): Henning Fernau ; Fedor V. Fomin ; Daniel Lokshtanov ; Matthias Mnich ; Geevarghese Philip ; Saket Saurabh
Publisher: Tsinghua University Press Ltd.
Publication Date: 1 August 2014
Volume: 19
Page(s): 374 - 386
ISSN (Electronic): 1007-0214
DOI: 10.1109/TST.2014.6867519
Regular:

We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and... View More

Advertisement