Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A still better performance guarantee for approximate graph coloring
Information Processing Letters
Approximation results for the minimum graph coloring problem
Information Processing Letters
Maximizing the number of unused colors in the vertex coloring problem
Information Processing Letters
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Small Maximal Independent Sets and Faster Exact Graph Coloring
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Reducing to independent set structure: the case of k-internal spanning tree
Nordic Journal of Computing
Invitation to data reduction and problem kernelization
ACM SIGACT News
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Quadratic Kernel for 3-Set Packing
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Minimum leaf out-branching and related problems
Theoretical Computer Science
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
An improved kernelization algorithm for r-Set Packing
Information Processing Letters
Improved upper bounds for vertex cover
Theoretical Computer Science
Algorithms and theory of computation handbook
On problem kernels for possible winner determination under the k-approval protocol
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A note on vertex cover in graphs with maximum degree 3
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Further improvement on maximum independent set in degree-4 graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Kernelization of packing problems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the fixed-parameter enumerability of cluster editing
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance (Extended Abstract)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Linear-Time computation of a linear problem kernel for dominating set on planar graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernels for packing and covering problems
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
European Journal of Combinatorics
Theoretical Computer Science
Data reduction for graph coloring problems
Information and Computation
Hi-index | 0.00 |
This paper examines a parameterized problem that we refer to as n–kGraph Coloring, i.e., the problem of determining whether a graph G with n vertices can be colored using n–k colors. As the main result of this paper, we show that there exists a O(kn2 +k2 + 23.8161k)=O(n2) algorithm for n–kGraph Coloring for each fixed k. The core technique behind this new parameterized algorithm is kernalization via maximum (and certain maximal) matchings. The core technical content of this paper is a near linear-time kernelization algorithm for n–kClique Covering. The near linear-time kernelization algorithm that we present for n–kClique Covering produces a linear size (3k–3) kernel in O(k(n+m)) steps on graphs with n vertices and m edges. The algorithm takes an instance 〈G,k 〉 of Clique Covering that asks whether a graph G can be covered using |V|–k cliques and reduces it to the problem of determining whether a graph G′=(V′,E′) of size ≤ 3k–3 can be covered using |V′| – k′ cliques. We also present a similar near linear-time algorithm that produces a 3k kernel for Vertex Cover. This second kernelization algorithm is the crown reduction rule.