Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Theoretical Computer Science
On Bipartite Drawings and the Linear Arrangement Problem
SIAM Journal on Computing
An Alternative Method to Crossing Minimization on Hierarchical Graphs
SIAM Journal on Optimization
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Layered graph drawing
On the Parameterized Complexity of Layered Graph Drawing
Algorithmica - Parameterized and Exact Algorithms
Graph Layout Problems Parameterized by Vertex Cover
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
Combinatorial Algorithms
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 5.23 |
Given an undirected graph G and an integer k=0, the NP-hard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by removing at most k edges. 2-Layer Planarization was known to be fixed-parameter tractable with respect to the parameter k. The state of the art is an O(3.562^k@?k+|G|)-time search tree algorithm and an O(k)-size problem kernel. Since transforming G into a forest of caterpillar trees requires breaking every cycle, the size f of a minimum feedback edge set is a natural parameter with f@?k. We improve on previous fixed-parameter tractability results with respect to k by presenting new polynomial-time data reduction rules leading to a problem kernel with O(f) vertices and edges and a new search-tree based algorithm. We expect f to be significantly smaller than k for a wide range of input instances.