Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Journal of the ACM (JACM)
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Dotted interval graphs and high throughput genotyping
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
Rapid ab initio RNA folding including pseudoknots via graph tree decomposition
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Approximating the 2-interval pattern problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Rounding to an integral program
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Parameterized complexity of independence and domination on geometric graphs
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Improved complexity bounds for location problems on the real line
Operations Research Letters
Parameterized Complexity
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The parameterized complexity of some minimum label problems
Journal of Computer and System Sciences
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
On the parameterized complexity of some optimization problems related to multiple-interval graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The min-power multicast problems in wireless ad hoc networks: a parameterized view
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Journal of Computer and System Sciences
Incremental list coloring of graphs, parameterized by conservation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Parameterized algorithms for inclusion of linear matchings
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The parameterized complexity of local search for TSP, more refined
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Journal of Discrete Algorithms
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity in multiple-interval graphs: domination
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Increasing the minimum degree of a graph by contractions
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Treewidth governs the complexity of target set selection
Discrete Optimization
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
Minimizing rosenthal potential in multicast games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Selective graph coloring in some special classes of graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Theoretical Computer Science
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
Parameterized complexity of induced h-matching on claw-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Parameterized domination in circle graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
FO model checking of interval graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science
Kernel bounds for path and cycle problems
Theoretical Computer Science
Parameterized Domination in Circle Graphs
Theory of Computing Systems
Hi-index | 5.23 |
Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many applications of interval graphs also generalize to multiple-interval graphs, often allowing for more robustness in the modeling of the specific application. With this motivation in mind, a recent systematic study of optimization problems in multiple-interval graphs was initiated. In this sequel, we study multiple-interval graph problems from the perspective of parameterized complexity. The problems under consideration are k-Independent Set, k-Dominating Set, and k-Clique, which are all known to be W[1]-hard for general graphs, and NP-complete for multiple-interval graphs. We prove that k-Clique is in FPT, while k-Independent Set and k-Dominating Set are both W[1]-hard. We also prove that k-Independent Dominating Set, a hybrid of the two above problems, is also W[1]-hard. Our hardness results hold even when each vertex is associated with at most two intervals, and all intervals have unit length. Furthermore, as an interesting byproduct of our hardness results, we develop a useful technique for showing W[1]-hardness via a reduction from the k-Multicolored Clique problem, a variant of k-Clique. We believe this technique has interest in its own right, as it should help in simplifying W[1]-hardness results which are notoriously hard to construct and technically tedious.