New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Exact coloring of real-life graphs is easy
DAC '97 Proceedings of the 34th annual Design Automation Conference
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient coloring of a large spectrum of graphs
DAC '98 Proceedings of the 35th annual Design Automation Conference
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Coloring k-colorable graphs using smaller palettes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Survey of Automated Timetabling
Artificial Intelligence Review
Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Scatter Search for Graph Coloring
Selected Papers from the 5th European Conference on Artificial Evolution
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
Approximate coloring of uniform hypergraphs
Journal of Algorithms
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
An agent-based algorithm for generalized graph colorings
Proceedings of the 8th annual conference on Genetic and evolutionary computation
The hardness of cache conscious data placement
Nordic Journal of Computing
Information Sciences: an International Journal
An ant-based algorithm for coloring graphs
Discrete Applied Mathematics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the L(h, k)-labelling problem
International Journal of Mobile Network Design and Innovation
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters
Multiagent graph coloring: Pareto efficiency, fairness and individual rationality
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Priority algorithms for graph optimization problems
Theoretical Computer Science
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Distributed game-theoretic vertex coloring
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Complexity of minimal tree routing and coloring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Survey: Distributed algorithm engineering for networks of tiny artifacts
Computer Science Review
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Metaheuristics for robust graph coloring
Journal of Heuristics
Approximation algorithms for B 1-EPG graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Experiment selection for causal discovery
The Journal of Machine Learning Research
| Hi-index | 0.89 |