Lopsided Lova´sz Local Lemma and Latin transversals
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
SIAM Journal on Computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Colouring graphs when the number of colours is nearly the maximum degree
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Mathematics - Kleitman and combinatorics: a celebration
Asymptotically the list colouring constants are 1
Journal of Combinatorial Theory Series B
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Random Structures & Algorithms
Analysis of a heuristic for acyclic edge colouring
Information Processing Letters
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Combinatorics, Probability and Computing
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Acyclic Edge Colouring of Outerplanar Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
About acyclic edge colourings of planar graphs
Information Processing Letters
Properly 2-Colouring Linear Hypergraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Asymptotically optimal frugal colouring
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A constructive proof of the Lovász local lemma
Proceedings of the forty-first annual ACM symposium on Theory of computing
Note: Acyclic edge coloring of planar graphs with large girth
Theoretical Computer Science
Conflict-free colourings of graphs and hypergraphs
Combinatorics, Probability and Computing
A constructive proof of the general lovász local lemma
Journal of the ACM (JACM)
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory Series B
Proceedings of the forty-second ACM symposium on Theory of computing
Some results on acyclic edge coloring of plane graphs
Information Processing Letters
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Information Processing Letters
Note: Improved bounds for acyclic chromatic index of planar graphs
Discrete Applied Mathematics
On acyclic edge coloring of toroidal graphs
Information Processing Letters
Proceedings of the forty-third annual ACM symposium on Theory of computing
Acyclic chromatic indices of planar graphs with large girth
Discrete Applied Mathematics
An algorithm for optimal acyclic edge-colouring of cubic graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Acyclic chromatic indices of planar graphs with girth at least five
Journal of Combinatorial Optimization
Improved bounds on coloring of graphs
European Journal of Combinatorics
Optimal acyclic edge colouring of grid like graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Acyclic edge coloring of planar graphs with Δ colors
Discrete Applied Mathematics
Acyclic edge coloring of planar graphs without 5-cycles
Discrete Applied Mathematics
Acyclic edge colouring of plane graphs
Discrete Applied Mathematics
Acyclic chromatic indices of fully subdivided graphs
Information Processing Letters
On r-acyclic edge colorings of planar graphs
Discrete Applied Mathematics
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Journal of the ACM (JACM)
Optimal acyclic edge-coloring of cubic graphs
Journal of Graph Theory
Acyclic Edge Coloring of Triangle-Free Planar Graphs
Journal of Graph Theory
A new upper bound on the acyclic chromatic indices of planar graphs
European Journal of Combinatorics
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
Discrete Applied Mathematics
Acyclic edge coloring of planar graphs with girth at least 5
Discrete Applied Mathematics
Acyclic edge coloring of graphs
Discrete Applied Mathematics
Hi-index | 0.00 |