A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
Optimal numberings of an N N array
SIAM Journal on Algebraic and Discrete Methods
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
Theoretical Computer Science
Finding the minimum bandwidth of an interval graph
Information and Computation
Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
Min cut is NP-complete for edge weighted trees
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On minimizing width in linear layouts
Discrete Applied Mathematics
Computing the bandwidth of interval graphs
SIAM Journal on Discrete Mathematics
Layout permutation problems and well-partially-ordered sets
Proceedings of the fifth MIT conference on Advanced research in VLSI
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On finding the minimum bandwidth of interval graphs
Information and Computation
SIAM Journal on Computing
On well-partial-order theory and its application to combinatorial problems of VLSI design
SIAM Journal on Discrete Mathematics
Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width
Information Processing Letters
Comparing queues and stacks as mechanisms for laying out graphs
SIAM Journal on Discrete Mathematics
Laying out graphs using queues
SIAM Journal on Computing
Edge separators for graphs of bounded genus with applications
Theoretical Computer Science
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
Information Processing Letters
Edge separators of planar and outerplanar graphs with applications
Journal of Algorithms
On the bandwidth of graph products
Journal of Information Processing and Cybernetics
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
On the pathwidth of chordal graphs
Discrete Applied Mathematics - ARIDAM IV and V
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
The Profile Minimization Problem in Trees
SIAM Journal on Computing
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs
SIAM Journal on Discrete Mathematics
The vertex separation and search number of a graph
Information and Computation
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Single linkage clustering and continuum percolation
Journal of Multivariate Analysis
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Journal of Algorithms
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics
On bandwidth and edgesum for the composition of two graphs
Discrete Mathematics
Some results on tree decomposition of graphs
Journal of Graph Theory
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On intervalizing k-colored graphs for DNA physical mapping
Discrete Applied Mathematics - Special volume on computational molecular biology
On bandwidth for the tensor product of paths and cycles
Discrete Applied Mathematics
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Theoretical Computer Science - Special issue on computing and combinatorics
Paradigms for fast parallel approximability
Paradigms for fast parallel approximability
Bandwidth, edgesum and profile of graphs
Bandwidth, edgesum and profile of graphs
How Good is Recursive Bisection?
SIAM Journal on Scientific Computing
Harper-type lower bounds and the bandwidths of the compositions of graphs
Discrete Mathematics
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
The metropolis algorithm for graph bisection
Discrete Applied Mathematics
Bisecting de Bruijn and Kautz graphs
Discrete Applied Mathematics
Bisection width of transposition graphs
Discrete Applied Mathematics
Optimal embedding of complete binary trees into lines and grids
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Information Processing Letters
Path optimization for graph partitioning problems
Discrete Applied Mathematics - Special volume on VLSI
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
SIAM Journal on Computing
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
The congestion of n-cube layout on a rectangular grid
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Optimal linear arrangement of a rectangular grid
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
Approximating the bandwidth via volume respecting embeddings
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Bisecting sparse random graphs
Random Structures & Algorithms
Algorithms for graph partitioning on the planted partition model
Random Structures & Algorithms
Approximating layout problems on random geometric graphs
Journal of Algorithms
On weighted vs unweighted versions of combinatorial optimizationproblems
Information and Computation
Approximation algorithms
Improved bandwidth approximation for trees and chordal graphs
Journal of Algorithms
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
Minimizing the Profile of a Symmetric Matrix
SIAM Journal on Scientific Computing
Stack and Queue Layouts of Posets
SIAM Journal on Discrete Mathematics
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Communication Throughput of Interconnection Networks
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Linear Layouts of Generalized Hypercubes
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
DNA Physical Mapping: Three Ways Difficult
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
A Polyhedral Approach to Planar Augmentation and Related Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On partitioning a graph: a theoretical and empirical study.
On partitioning a graph: a theoretical and empirical study.
Topics in black-box combinatorial optimization
Topics in black-box combinatorial optimization
Bounded combinatorial width and forbidden substructures
Bounded combinatorial width and forbidden substructures
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
Journal of Graph Theory
Index assignment for multichannel communication under failure
IEEE Transactions on Information Theory
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Drawing Directed Graphs Using One-Dimensional Optimization
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Combining Hierarchy and Energy Drawing Directed Graphs
IEEE Transactions on Visualization and Computer Graphics
A two-way visualization method for clustered data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of Experimental Algorithmics (JEA)
ACM SIGGRAPH 2005 Papers
Cutwidth I: a linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Information Processing Letters
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
An Improved Vertex Caching Scheme for 3D Mesh Rendering
IEEE Transactions on Visualization and Computer Graphics
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
On the interval completion of chordal graphs
Discrete Applied Mathematics
Proceedings of the 20th annual international conference on Supercomputing
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
Graph bandwidth of weighted caterpillars
Theoretical Computer Science - Algorithmic applications in management
Edge-bandwidth of grids and tori
Theoretical Computer Science
Theoretical Computer Science
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
Memory management optimization problems for integrated circuit simulators
Discrete Applied Mathematics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms (TALG)
Graph parameters measuring neighbourhoods in graphs-Bounds and applications
Discrete Applied Mathematics
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Multilevel algorithms for linear ordering problems
Journal of Experimental Algorithmics (JEA)
Improved Layout of Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
Computing and Updating the Process Number in Trees
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Note: On explicit formulas for bandwidth and antibandwidth of hypercubes
Discrete Applied Mathematics
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Theoretical Computer Science
Techniques for efficient interactive configuration of distribution networks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
On the interval completion of chordal graphs
Discrete Applied Mathematics
Information Processing Letters
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Mixed search number and linear-width of interval and split graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Two models of two-dimensional bandwidth problems
Information Processing Letters
Index assignment optimization for joint source-channel MAP decoding
IEEE Transactions on Communications
Neighbor query friendly compression of social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science
Memetic algorithm for the antibandwidth maximization problem
Journal of Heuristics
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Simple cuts are fast and good: optimum right-angled cuts in solid grids
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Decorous Lower Bounds for Minimum Linear Arrangement
INFORMS Journal on Computing
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
Low Distortion Maps Between Point Sets
SIAM Journal on Computing
Novel algorithm for enhancing database access in interactive applications: performance evaluation
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
An O(n4) time algorithm to compute the bisection width of solid grid graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
A refined evaluation function for the MinLA problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Memetic algorithms for the MinLA problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Which sort orders are interesting?
The VLDB Journal — The International Journal on Very Large Data Bases
Graph bandwidth of weighted caterpillars
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Centrality measures based on current flow
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A comparison of memetic recombination operators for the MinLA problem
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Optimal distortion embedding of complete binary trees into lines
Information Processing Letters
Spectral sequencing based on graph distance
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Computer Science Review
SIAM Journal on Discrete Mathematics
Branch and bound for the cutwidth minimization problem
Computers and Operations Research
A branch-and-bound algorithm for the minimum cut linear arrangement problem
Journal of Combinatorial Optimization
A decentralized solution for locating mobile agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Variable neighborhood search with ejection chains for the antibandwidth problem
Journal of Heuristics
Spectral Image Segmentation Using Image Decomposition and Inner Product-Based Metric
Journal of Mathematical Imaging and Vision
Topology aware process mapping
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Variable Formulation Search for the Cutwidth Minimization Problem
Applied Soft Computing
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Surface- and volume-based techniques for shape modeling and analysis
SIGGRAPH Asia 2013 Courses
A hybrid metaheuristic for the cyclic antibandwidth problem
Knowledge-Based Systems
The Journal of Supercomputing
| Hi-index | 0.01 |
Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. This survey considers their motivation, complexity, approximation properties, upper and lower bounds, heuristics and probabilistic analysis on random graphs. The result is a complete view of the current state of the art with respect to layout problems from an algorithmic point of view.