Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On semidefinite programming relaxations for graph coloring and vertex cover
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Inferring a Union of Halfspaces from Examples
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating Min-sum Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '99 Proceedings of the 7th 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
Approximating Minimum Cocolourings
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Information and Computation
Computing
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
Theoretical Computer Science
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The hardness of cache conscious data placement
Nordic Journal of Computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
An improved algorithm for approximating the chromatic number of Gn,p
Information Processing Letters
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
Radiocoloring in planar graphs: complexity and approximations
Theoretical Computer Science - Mathematical foundations of computer science 2000
IEEE/ACM Transactions on Networking (TON)
On the complexity of deriving position specific score matrices from positive and negative sequences
Discrete Applied Mathematics
The complexity of non-hierarchical clustering with instance and cluster level constraints
Data Mining and Knowledge Discovery
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Intractability and clustering with constraints
Proceedings of the 24th international conference on Machine learning
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fractionally total colouring Gn,p
Discrete Applied Mathematics
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
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On the tractability of coloring semirandom graphs
Information Processing Letters
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
On approximating four covering and packing problems
Journal of Computer and System Sciences
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Exponential-time approximation of weighted set cover
Information Processing Letters
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Priority algorithms for graph optimization problems
Theoretical Computer Science
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Note: A simple algorithm for 4-coloring 3-colorable planar graphs
Theoretical Computer Science
On injective colourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A novel frequency planning algorithm for mitigating unfairness in wireless LANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of system throughput derivation for static 802.11 networks
IEEE Communications Letters
Distributed game-theoretic vertex coloring
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Finding small OBDDs for incompletely specified truth tables is hard
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Coloring random graphs online without creating monochromatic subgraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Complexity of minimal tree routing and coloring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Coloring sparse random k-colorable graphs in polynomial expected time
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
The hypocoloring problem: complexity and approximability results when the chromatic number is small
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Tight results on minimum entropy set cover
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the chromatic number of random graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved exact algorithms for counting 3- and 4-colorings
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
| Hi-index | 0.01 |