Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: clique is hard to approximate within n 1 - c .
Interactive proofs and the hardness of approximating cliques
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
a fast and provable method for estimating clique counts using turan ' s theorem .
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
Approximating maximum independent set in bounded degree graphs
Optimal algorithms and inapproximability results for every CSP?
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
New Algorithms for Enumerating All Maximal Cliques
A scalable, parallel algorithm for maximal clique enumeration
Finding Maximal Clique In A Graph
Clique-cutsets beyond chordal graphs
The Parameterized Complexity of k-Biclique
The worst-case time complexity for generating all maximal cliques and computational experiments
handbook of combinatorial optimization the maximum clique problem .
o ( sqrt ( log n ) ) approximation algorithms for min uncut , min 2cnf deletion , and directed cut problems .
Approximation algorithms and hardness results for cycle packing problems
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
A reproducing kernel Hilbert space framework for pairwise time series distances
Every Prime Has a Succinct Certificate
The Ignorant Led by the Blind: A Hybrid Human–Machine Vision System for Fine-Grained Categorization
Investigation of electrical field grading of bushings with microvaristor filled epoxy resin components
Intercarrier interference self-cancellation scheme for OFDM mobile communication systems