A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
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
The algorithmic aspects of the regularity lemma
Journal of Algorithms
On the integral dicycle packings and covers and the linear ordering polytope
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Nearly-perfect hypergraph packing is in NC
Information Processing Letters
Constructive Quasi-Ramsey Numbers and Tournament Ranking
SIAM Journal on Discrete Mathematics
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Packing Digraphs with Directed Closed Trails
Combinatorics, Probability and Computing
Approximation algorithms for cycle packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
| Hi-index | 0.04 |
Let G be a simple digraph. The dicycle packing number of G, denoted @n"c(G), is the maximum size of a set of arc-disjoint directed cycles in G. Let G be a digraph with a nonnegative arc-weight function w. A function @j from the set C of directed cycles in G to R"+ is a fractional dicycle packing of G if @?"e"@?"C"@?"C@j(C)=