An Augmentation Algorithm for the Maximum Weighted Stable Set Problem
Computational Optimization and Applications
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
Journal of Heuristics
Finding independent sets in a graph using continuous multivariable polynomial formulations
Journal of Global Optimization
Fast Winner-Takes-All Networks for the Maximum Clique Problem
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Modelling competitive Hopfield networks for the maximum clique problem
Computers and Operations Research
Using symbolic techniques to find the maximum clique in very large sparse graphs
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Variable neighborhood search for the maximum clique
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Approximating the maximum vertex/edge weighted clique using local search
Journal of Heuristics
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
Median graphs: A genetic approach based on new theoretical properties
Pattern Recognition
Multi-hop scatternet formation and routing for large scale Bluetooth networks
International Journal of Ad Hoc and Ubiquitous Computing
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
On the complexity of some subgraph problems
Discrete Applied Mathematics
Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Logic programming for combinatorial problems
Artificial Intelligence Review
A comparison of three maximum common subgraph algorithms on a large database of labeled graphs
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
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
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
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An exact approach to the problem of extracting an embedded network matrix
Computers and Operations Research
Cooperating local search for the maximum clique problem
Journal of Heuristics
A Branch and Cut solver for the maximum stable set problem
Journal of Combinatorial Optimization
Safe lower bounds for graph coloring
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
CP models for maximum common subgraph problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A complete resolution of the Keller maximum clique problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding top-k similar graphs in graph databases
Proceedings of the 15th International Conference on Extending Database Technology
A branch-and-price approach for the partition coloring problem
Operations Research Letters
A combinatorial column generation algorithm for the maximum stable set problem
Operations Research Letters
Solving hard set covering problems
Operations Research Letters
An algorithm for finding a maximum clique in a graph
Operations Research Letters
A branch-and-cut algorithm for the maximum cardinality stable set problem
Operations Research Letters
An exact algorithm for the maximum clique problem
Operations Research Letters
Finding top-n colossal patterns based on clique search with dynamic update of graph
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Breakout Local Search for maximum clique problems
Computers and Operations Research
Subgraph extraction and metaheuristics for the maximum clique problem
Journal of Heuristics
An adaptive multistart tabu search approach to solve the maximum clique problem
Journal of Combinatorial Optimization
Computational Optimization and Applications
Improvements to MCS algorithm for the maximum clique problem
Journal of Combinatorial Optimization
Speeding up branch and bound algorithms for solving the maximum clique problem
Journal of Global Optimization
| Hi-index | 0.00 |