Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

Authors:
Raphael Yuster
Affiliations:
Department of Mathematics, University of Haifa, Haifa 31905, Israel
Venue:
Computer Science Review
Year:
2007

Citing 32
Cited 5

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Generalized planar matching

Journal of Algorithms
Easy problems for tree-decomposable graphs

Journal of Algorithms
Matching and covering the vertices of a random graph by copies of a given graph

Discrete Mathematics
Maximum bounded H-matching is Max SNP-complete

Information Processing Letters
The algorithmic aspects of the regularity lemma

Journal of Algorithms
H-factors in dense graphs

Journal of Combinatorial Theory Series B
Nearly-perfect hypergraph packing is in NC

Information Processing Letters
Edge decomposition into isomorphic copies of sK1,2 is polynomial

Journal of Combinatorial Theory Series B
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
Tree decomposition of graphs

Random Structures & Algorithms
An algorithmic version of the blow-up lemma

Random Structures & Algorithms
Packing and decomposition of graphs with trees

Journal of Combinatorial Theory Series B
Proof of the Alon—Yuster conjecture

Discrete Mathematics
Packing triangles in bounded degree graphs

Information Processing Letters
The decomposition threshold for bipartite graphs with minimum degree one

Random Structures & Algorithms
On the completeness of a generalized matching problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An Optimal Algorithm for Checking Regularity

SIAM Journal on Computing
Triangle Factors in Random Graphs

Combinatorics, Probability and Computing
Families of Trees Decompose the Random Graph in an Arbitrary Way

Combinatorics, Probability and Computing
Maximum Matchings via Gaussian Elimination

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Integer and fractional packing of families of graphs

Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions

Journal of Combinatorial Theory Series B
Critical chromatic number and the complexity of perfect packings in graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Integer and fractional packings of hypergraphs

Journal of Combinatorial Theory Series B
On fractional K-factors of random graphs

Random Structures & Algorithms
Perfect packings with complete graphs minus an edge

European Journal of Combinatorics
Star-factors of tournaments

Journal of Graph Theory
K4--factor in a graph

Journal of Graph Theory
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
Approximation algorithms for NP-complete problems on planar graphs

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Triangle packings and 1-factors in oriented graphs

Journal of Combinatorial Theory Series B
Kernelization of packing problems

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A survey on Hamilton cycles in directed graphs

European Journal of Combinatorics
Note: On generalized Fibonacci numbers and k-distance Kp-matchings in graphs

Discrete Applied Mathematics
Minimum codegree threshold for (K43-e)-factors

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packing and decomposition of combinatorial objects such as graphs, digraphs, and hypergraphs by smaller objects are central problems in combinatorics and combinatorial optimization. Their study combines probabilistic, combinatorial, and algebraic methods. In addition to being among the most fascinating purely combinatorial problems, they are often motivated by algorithmic applications. There is a considerable number of intriguing fundamental problems and results in this area, and the goal of this paper is to survey the state-of-the-art.