Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing H/D-exchange speeds of single residues from data of peptic fragments
Proceedings of the 2008 ACM symposium on Applied computing
Approximating the Interval Constrained Coloring Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
3-coloring in time O (1.3289n)
Journal of Algorithms
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
The interval constrained 3-coloring problem
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complexity of splits reconstruction for low-degree trees
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
| Hi-index | 0.00 |
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer intervals in the range 1 to n and a set of m associated multisets of colors (specifying for each interval the colors to be used for its elements), one asks whether there is a "consistent" coloring for all integer points from { 1, ..., n } that complies with the constraints specified by the color multisets. We initiate a study of Interval Constrained Coloring from the viewpoint of combinatorial algorithmics, trying to avoid polyhedral and randomized rounding methods as used in previous work. To this end, we employ the method of systematically deconstructing intractability. It is based on a thorough analysis of the known NP-hardness proof for Interval Constrained Coloring . In particular, we identify numerous parameters that naturally occur in the problem and strongly influence the problem's practical solvability. Thus, we present several positive (fixed-parameter) tractability results and, moreover, identify a large spectrum of combinatorial research challenges for Interval Constrained Coloring .