Ranking and Drawing in Subexponential Time
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 337-348
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Fast FAST2009
- Fixed-Parameter Algorithms for Kemeny ScoresLecture Notes in Computer Science, 2007
- On the Parameterized Complexity of Layered Graph DrawingAlgorithmica, 2007
- A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical InformationIEEE Transactions on Visualization and Computer Graphics, 2007
- Subexponential Parameterized AlgorithmsLecture Notes in Computer Science, 2007
- Crossing Minimization in Weighted Bipartite Graphs2007
- A Fixed-Parameter Approach to 2-Layer PlanarizationAlgorithmica, 2006
- Crossings and Permutations2006
- Parameterized complexity: exponential speed-up for planar graph problemsJournal of Algorithms, 2004
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989