Optimal numberings of an N N array
SIAM Journal on Algebraic and Discrete Methods
Optional linear arrangement of circuit components
Advances in VLSI and Computer Systems
Applications of the crossing number
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Faster minimization of linear wirelength for global placement
Proceedings of the 1997 international symposium on Physical design
Relaxation and clustering in a local search framework: application to linear placement
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
A Fixed-Parameter Approach to Two-Layer Planarization
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Linear ordering and application to placement
DAC '83 Proceedings of the 20th Design Automation Conference
Clustering and linear placement
DAC '72 Proceedings of the 9th Design Automation Workshop
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
A general data reduction scheme for domination in graphs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Searching paths of constant bandwidth
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
The linear arrangement problem parameterized above guaranteed value
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized Complexity
Minimum leaf out-branching and related problems
Theoretical Computer Science
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
| Hi-index | 0.05 |
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. Despite this simplicity, the analysis of the algorithms is often rather intricate. For the newly introduced problem linear arrangement by deleting edges, we also show how to derive a small problem kernel.