Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Algorithm and Experiments in Testing Planar Graphs for Isomorphism
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Circle Planarity of Level Graphs
Efficient subgraphisomorphism detection: a decomposition approach
Concept of fuzzy planar graphs
Finding Steiner forests in planar graphs
LOCALLY PLANAR GRAPHS ARE 5-CHOOSABLE
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases
Multi-Query Optimization for Subgraph Isomorphism Search
Grid Drawings of Four-Connected Plane Graphs
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
on a new graph invariant and a criterion for planarity .
a linear algorithm for embedding planar graphs using pq - trees .
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Geodetic Graphs Homeomorphic to a Given Geodetic Graph
Planar 3-colorability is polynomial complete
The Relative Neighbourhood Graph of a Finite Planar Set
Canonical labeling of graphs
Small sets supporting fary embeddings of planar graphs
Certifying and constructing minimally rigid graphs in the plane
accurate phase noise prediction in pll synthesizers .
Acquired clitoral enlargement. Diagnosis and treatment.
Towards Seamless Tracking-Free Web: Improved Detection of Trackers via One-class Learning
Best Practices for Machine Learning Applications
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph