Fixed Parameter Algorithms for one-sided crossing minimization Revisited
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing MinimizationLecture Notes in Computer Science, 2002
- One Sided Crossing Minimization Is NP-Hard for Sparse GraphsLecture Notes in Computer Science, 2002
- A Fixed-Parameter Approach to Two-Layer PlanarizationLecture Notes in Computer Science, 2002
- On the Parameterized Complexity of Layered Graph DrawingLecture Notes in Computer Science, 2001
- A general method to speed up fixed-parameter-tractable algorithmsInformation Processing Letters, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic AlgorithmsJournal of Graph Algorithms and Applications, 1997
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981