No article text was recorded for this version.
graph bandwidth minimization
Version 1 of 114 papers19 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Rectangular Layouts and Contact Graphs
- Blog: Unbent Collections of Orthogonal Drawings
- Blog: Inapproximability of Treewidth and Related Problems (Extended Abstract)
- Blog: An Exponential Time 2-Approximation Algorithm for Bandwidth
- Blog: Fixed-Parameter Complexity of Minimum Profile Problems
- Blog: Even Faster Exact Bandwidth
- Blog: Fixed-Parameter Complexity of Minimum Profile Problems
- Blog: Select Edges Wisely: Monotonic Path Aware Graph Layout Optimization for Disk-based ANN Search
- Blog: Moving Vertices to Make Drawings Plane
- Blog: Exact and approximate bandwidth
- Blog: The Linear Arrangement Problem Parameterized Above Guaranteed Value
- Blog: On Euclidean Embeddings and Bandwidth Minimization
- Blog: Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
- Blog: An exponential time 2-approximation algorithm for bandwidth
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_graph_bandwidth_minimization_bee79bcc,
title = {graph bandwidth minimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-bandwidth-minimization/rdr_bee79bcc178d4a8a8b64a4673fc77aed},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_graph_bandwidth_minimization_bee79bcc_v1,
title = {graph bandwidth minimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-bandwidth-minimization/rdr_bee79bcc178d4a8a8b64a4673fc77aed/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}