Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: a fast and provable method for estimating clique counts using turan ' s theorem .
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Computational Lower Bounds for Community Detection on Random Graphs
Efficient inference with cardinality-based clique potentials
The number and degree distribution of spanning trees in the Tower of Hanoi graph
A neural network model for finding a near-maximum clique
The geometry of graphs and some of its algorithmic applications
Smallest-last ordering and clustering and graph coloring algorithms
Finding Steiner forests in planar graphs
On Arithmetic Progressions of Cycle Lengths in Graphs
Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs
Approximations For The Maximum Acyclic Subgraph Problem
Unifying Maximum Cut and Minimum Cut of a Planar Graph
a constructive proof of vizing ' s theorem .
A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Efficient Enumeration of Chordless Cycles
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
Community detection thresholds and the weak Ramanujan property
Tighter Bounds for Graph Steiner Tree Approximation
ON THE CHROMATIC NUMBER OF SUBSETS OF THE EUCLIDEAN PLANE
On mining cross-graph quasi-cliques
ECF: An MPTCP Path Scheduler to Manage Heterogeneous Paths
Importance of debriefing following critical incidents.
Novel zero-voltage and zero-current-switching full bridge PWM converter using transformer auxiliary winding
proceedings of symposia in pure mathematics lectures on lyapunov exponents and smooth ergodic theory .
Repeated observation of breast tumor subtypes in independent gene expression data sets.