A Fixed-Parameter Approach to Two-Layer Planarization
- 21 February 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-15
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On Bipartite Drawings and the Linear Arrangement ProblemSIAM Journal on Computing, 2001
- An Alternative Method to Crossing Minimization on Hierarchical GraphsSIAM Journal on Optimization, 2001
- Parameterized Complexity1999
- Two-Layer Planarization in Graph Drawing1998
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic AlgorithmsJournal of Graph Algorithms and Applications, 1997
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphsEuropean Journal of Operational Research, 1996
- Drawing graphs in two layersTheoretical Computer Science, 1994
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- Crossing Number is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1983
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981