The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
Journal of the ACM (JACM)
Algorithm 286: Examination scheduling
Communications of the ACM
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Edge coloring planar graphs with two outerplanar subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Graph decomposition is NPC - a complete proof of Holyer's conjecture
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
3-D Shape Recovery Using Distributed Aspect Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
On the greedy heuristic for matchings
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Illuminating Both Sides of Line Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Improving effective bandwidth through compiler enhancement of global cache reuse
Journal of Parallel and Distributed Computing
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Theoretical Computer Science - Parameterized and exact computation
Computing phylogenetic roots with bounded degrees and errors is NP-complete
Theoretical Computer Science - Computing and combinatorics
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Parameterized Perspective on Packing Paths of Length Two
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Discrete Applied Mathematics
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
On a Labeled Vehicle Routing Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Differential approximation for some routing problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
RBG matching: an innovative combinatorial approach for OFDMA resource allocation
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Kernelization of packing problems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
High variation-tolerant obstacle-avoiding clock mesh synthesis with symmetrical driving trees
Proceedings of the International Conference on Computer-Aided Design
Treelike comparability graphs: characterization, recognition, and applications
WG'04 Proceedings of the 30th 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 path partition problem and related problems in bipartite graphs
Operations Research Letters
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
On the complexity of the k-customer vehicle routing problem
Operations Research Letters
Packing paths: Recycling saves time
Discrete Applied Mathematics
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
| Hi-index | 0.00 |
A perfect matching in a graph H may be viewed as a collection of subgraphs of H, each of which is isomorphic to K2, whose vertex sets partition the vertex set of H. This is naturally generalized by replacing K2 by an arbitrary graph G. We show that if G contains a component with at least three vertices then this generalized matching problem is NP-complete. These generalized matchings have numerous applications including the minimization of second-order conflicts in examination scheduling.