A parallel row-based algorithm for standard cell placement with integrated error control
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
A spectral technique for coloring random 3-colorable graphs (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A controller-based design-for-testability technique for controller-data path circuits
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
HERO: hierarchical EMC-constrained routing
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Coloration neighborhood structures for general graph coloring
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Generalized map coloring for use in geographical information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Graph Coloring with Adaptive Evolutionary Algorithms
Journal of Heuristics
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Join Order Selection - Good Enough Is Easy
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Algorithms for Colouring Random k-colourable Graphs
Combinatorics, Probability and Computing
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Metaheuristics can solve sudoku puzzles
Journal of Heuristics
On the futility of blind search: An algorithmic view of “no free lunch”
Evolutionary Computation
Complexity analysis of a decentralised graph colouring algorithm
Information Processing Letters
Computers and Operations Research
Almost all hypergraphs without Fano planes are bipartite
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithm for maximum edge coloring
Theoretical Computer Science
An analytic learning system for specializing heuristics
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Algorithms and experiments on colouring squares of planar graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Register allocation by optimal graph coloring
CC'03 Proceedings of the 12th international conference on Compiler construction
Approximation algorithms for maximum edge coloring problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On the combination of constraint programming and stochastic search: the Sudoku case
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
On the application of graph colouring techniques in round-robin sports scheduling
Computers and Operations Research
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Integrating heuristics for constraint satisfaction problems: a case study
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
On greedy graph coloring in the distributed model
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Coloring random 3-colorable graphs with non-uniform edge probabilities
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Coloring sparse random k-colorable graphs in polynomial expected time
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An empirical comparison of some approximate methods for graph coloring
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
A hybrid artificial bee colony algorithm for graph 3-coloring
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Computational Optimization and Applications
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
ColPack: Software for graph coloring and related problems in scientific computing
ACM Transactions on Mathematical Software (TOMS)
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |