Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
Dynamic Local Search for the Maximum Clique Problem
A tutorial on branch and cut algorithms for the maximum stable set problem
Finding maximal cliques in massive networks
on effectively finding maximal quasi - cliques in graphs .
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
A neural network model for finding a near-maximum clique
Diversified Top-k Partial MaxSAT Solving
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
A simple parallel algorithm for the maximal independent set problem
The Maximum Independent Set Problem in Planar Graphs
SATzilla: Portfolio-based Algorithm Selection for SAT
Interactive proofs and the hardness of approximating cliques
Approximating maximum independent set in bounded degree graphs
Algorithms column: the vertex cover problem
A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks
BerkMin: A Fast and Robust Sat-Solver
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms
The Maximum Clique Problem
Parallel and Integrative Processing Through the Basal Ganglia Reward Circuit: Lessons from Addiction
Patent issues of embedded fan-out wafer/panel level packaging
Benchmarking NFV Software Dataplanes
A Strategy to Improve The Usage of ICT in The Kingdom of Saudi Arabia Primary School