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
NP-Completeness of Some Tree-Clustering Problems
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
Mutual exclusion scheduling with interval graphs or related classes. Part II
Discrete Applied Mathematics
Mutual exclusion scheduling with interval graphs or related classes, Part I
Discrete Applied Mathematics
Scheduling jobs on identical machines with agreement graph
Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
Hi-index | 0.00 |