Graph Layout Problems Parameterized by Vertex Cover

Authors:
Michael R. Fellows;Daniel Lokshtanov;Neeldhara Misra;Frances A. Rosamond;Saket Saurabh
Affiliations:
University of Newcastle, Newcastle, Australia;Department of Informatics, University of Bergen, Bergen, Norway N-5020;The Institute of Mathematical Sciences, Chennai, India 600 017;University of Newcastle, Newcastle, Australia;Department of Informatics, University of Bergen, Bergen, Norway N-5020
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 14

Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Algorithmic meta-theorems for restrictions of treewidth

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

Journal of Discrete Algorithms
Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science
Parameterized complexity results for 1-safe Petri nets

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On Bounded-Degree Vertex Deletion parameterized by treewidth

Discrete Applied Mathematics
On cutwidth parameterized by vertex cover

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Twin-Cover: beyond vertex cover in parameterized algorithmics

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Cluster vertex deletion: a parameterization between vertex cover and clique-width

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Two-Layer Planarization parameterized by feedback edge set

Theoretical Computer Science
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Maximum common induced subgraph parameterized by vertex cover

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this talk I will present a new direction of algorithms whichdo not use any extra working array. More formally, we want todesign efficient algorithms which require no extra array of sizedepending on input size n but use only constant ...