Parameterized complexity in multiple-interval graphs: domination

Authors:
Minghui Jiang;Yong Zhang
Affiliations:
Department of Computer Science, Utah State University, Logan, UT;Department of Computer Science, Kutztown University of PA, Kutztown, PA
Venue:
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Year:
2011

Citing 10
Cited 4

Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Perfect code is W[1]-complete

Information Processing Letters
Scheduling Split Intervals

SIAM Journal on Computing
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Optimization problems in multiple-interval graphs

ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the parameterized complexity of some optimization problems related to multiple-interval graphs

Theoretical Computer Science
Recognizing d-interval graphs and d-track interval graphs

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Parameterized Complexity

Parameterized Complexity

k-gap interval graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy

Theoretical Computer Science
Parameterized domination in circle graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Domination in Circle Graphs

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that several variants of the problem k-Dominating Set, including k-Connected Dominating Set, k-Independent Dominating Set, k-Dominating Clique, d-Distancek-Dominating Set, k-Perfect Code and d-Distancek-Perfect Code, when parameterized by the solution size k, remain W[1]-hard in either multiple-interval graphs or their complements or both.