On the 2-Layer Window Width Minimization Problem
- 1 January 2023
- book chapter
- Published by Springer Nature
- p. 209-221
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams2015
- Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts2012
- Tanglegrams for rooted phylogenetic trees and networksBioinformatics, 2011
- Comparing trees via crossing minimizationJournal of Computer and System Sciences, 2010
- Drawing (Complete) Binary TanglegramsAlgorithmica, 2010
- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs2002
- 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
- The NP-Completeness of the bandwidth minimization problemComputing, 1976