Precoloring extension. I: Interval graphs
Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
Scheduling with incompatible jobs
Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
Invitation to data reduction and problem kernelization
ACM SIGACT News
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Incompressibility through Colors and IDs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On problems without polynomial kernels
Journal of Computer and System Sciences
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
Precoloring extension on unit interval graphs
Discrete Applied Mathematics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Modularity-driven clustering of dynamic graphs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Incremental list coloring of graphs, parameterized by conservation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science
Parameterized Complexity
Hi-index | 5.23 |
Incrementally k-list coloring a graph means that a graph is given by adding vertices step by step, and for each intermediate step we ask for a vertex coloring such that each vertex has one of the colors specified by its associated list containing some of in total k colors. We introduce the ''conservative version'' of this problem by adding a further parameter c@?N specifying the maximum number of vertices to be recolored between two subsequent graphs (differing by one vertex). The ''conservation parameter'' c models the natural quest for a modest evolution of the coloring in the course of the incremental process instead of performing radical changes. We show that even on bipartite graphs the problem is NP-hard for k=3 and W[1]-hard for an unbounded number of colors when parameterized by c. In contrast, also on general graphs the problem becomes fixed-parameter tractable with respect to the combined parameter (k,c). We prove that the problem has an exponential-size kernel with respect to (k,c) and there is no polynomial-size kernel unless NP@?coNP/poly. Furthermore, we investigate the parameterized complexity on various subclasses of perfect graphs. We show fixed-parameter tractability for the combined parameter treewidth and number k of colors. Finally, we provide empirical findings on the practical relevance of our approach in terms of an effective graph coloring heuristic.