RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation
Computational Optimization and Applications
Comparing Structures Using a Hopfield-Style Neural Network
Applied Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A complete adaptive algorithm for propositional satisfiability
Discrete Applied Mathematics
Parallelizing local search for CNF satisfiability using vectorization and PVM
Journal of Experimental Algorithmics (JEA)
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Variable neighborhood search for the maximum clique
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
Neural Computation
The resolution complexity of random graphk-colorability
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
A branch-and-cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
An agent-based algorithm for generalized graph colorings
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Incomplete solution approach for the maximum clique finding in the real time systems
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
Different Aspects of Social Network Analysis
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
On places suitable for applying AI principles in NP-hard graph problems' algorithms
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Collective adaptation: The exchange of coding segments
Evolutionary Computation
An ant-based algorithm for coloring graphs
Discrete Applied Mathematics
A logical approach to efficient Max-SAT solving
Artificial Intelligence
A guide to statistical analysis for single criteria heuristics evaluation
International Journal of Innovative Computing and Applications
A new group mobility model for mobile adhoc network based on unified relationship matrix
WSEAS TRANSACTIONS on COMMUNICATIONS
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms (TALG)
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
Extended and discretized formulations for the maximum clique problem
Computers and Operations Research
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Real-time systems: incomplete solution approach for the maximum-weighted clique problem
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Complementary approaches for the computation of the independent number of a graph
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
Iterated k-opt local search for the maximum clique problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Linear linkage encoding in grouping problems: applications on graph coloring and timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
An efficient branch-and-bound algorithm for finding a maximum clique
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Parallel simulated annealing algorithm for graph coloring problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Fast local search for the maximum independent set problem
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Advanced generic neighborhood heuristics for VNS
Engineering Applications of Artificial Intelligence
A neuro-GA approach for the maximum fuzzy clique problem
ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Improving the maximum-weight clique algorithm for the dense graphs
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Memetic algorithm with strategic controller for the maximum clique problem
Proceedings of the 2011 ACM Symposium on Applied Computing
Population-based and learning-based metaheuristic algorithms for the graph coloring problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Graph coloring with a distributed hybrid quantum annealing algorithm
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Mini-bucket elimination with bucket propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Heuristic colour assignment strategies for merge models in graph colouring
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
An analysis of heuristics for vertex colouring
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A complete resolution of the Keller maximum clique problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Using hajós' construction to generate hard graph 3-colorability instances
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
A simple and faster branch-and-bound algorithm for finding a maximum clique
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Improving graph colouring algorithms and heuristics using a novel representation
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
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
On the efficiency of an order-based representation in the clique covering problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Rainbow Induced Subgraphs in Proper Vertex Colorings
Fundamenta Informaticae
Bounded Model Checking for the Universal Fragment of CTL
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Subgraph extraction and metaheuristics for the maximum clique problem
Journal of Heuristics
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Computational Optimization and Applications
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
An adaptive multistart tabu search approach to solve the maximum clique problem
Journal of Combinatorial Optimization
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
| Hi-index | 0.00 |