On the public citation graph
The Subgraph Similarity Problem
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-49257-7_18openalex-snapshot
Index Structures for Path Expressions
inferredcites →https://doi.org/10.1007/3-540-55015-1_6openalex-snapshot
G-Log: A declarative graphical query language
inferredcites →https://doi.org/10.1007/3-540-62222-5_55openalex-snapshot
Adding structure to unstructured data
inferredcites →https://doi.org/10.1016/b978-012722442-8/50023-9openalex-snapshot
Covering Indexes for XML Queries
inferredcites →https://doi.org/10.1109/69.390249openalex-snapshot
G-Log: a graph-based query language
inferredcites →https://doi.org/10.1109/icde.2002.994703openalex-snapshot
Exploiting local similarity for indexing paths in graph-structured data
inferredcites →https://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferredcites →https://doi.org/10.1109/tkde.2003.1209024openalex-snapshot
The Subgraph Bisimulation Problem
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11229-012-0215-7openalex-snapshot
Exploring the tractability border in epistemic tasks
inferred← citeshttps://doi.org/10.1007/s11390-014-1473-2openalex-snapshot
Querying Big Data: Bridging Theory and Practice
inferred← citeshttps://doi.org/10.1007/s13222-018-0286-9openalex-snapshot
Using Queries as Schema-Templates for Graph Databases
inferred← citeshttps://doi.org/10.1016/j.cose.2021.102282openalex-snapshot
Threat detection and investigation with system-level provenance graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.datak.2011.02.004openalex-snapshot
A log-linear approach to mining significant graph-relational patterns
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.11.007openalex-snapshot
Rough approximations based on bisimulations
inferred← citeshttps://doi.org/10.1016/j.knosys.2016.07.009openalex-snapshot
Efficient pattern matching for graphs with multi-Labeled nodes
inferred← citeshttps://doi.org/10.1109/iccea62105.2024.10603935openalex-snapshot
An Apriori Knowledge-based Negative Sampling Method for APT Detection
inferred← citeshttps://doi.org/10.1109/icde.2012.143openalex-snapshot
Emerging Graph Queries in Linked Data
inferred← citeshttps://doi.org/10.1109/icnas68168.2025.11298075openalex-snapshot
ThreatsMaps: Automatic adjustment of CTI with the Running System
inferred← citeshttps://doi.org/10.1145/1989323.1989420openalex-snapshot
Incremental graph pattern matching
inferred← citeshttps://doi.org/10.1145/2274576.2274578openalex-snapshot
Graph pattern matching revised for social network analysis
inferred← citeshttps://doi.org/10.1145/3213891openalex-snapshot
Top-k User-Defined Vertex Scoring Queries in Edge-Labeled Graph Databases
inferred← citeshttps://doi.org/10.1145/3424978.3425119openalex-snapshot
Text Detection of Clinical Medical Documents Based on SWT Algorithm
inferred← citeshttps://doi.org/10.1145/3746252.3761209openalex-snapshot
Masked Graph Distance Network for Accurate Subgraph Similarity Computation
inferred← citeshttps://doi.org/10.70675/91aa1991zb8c8z4910z834cz672d31a2b86eopenalex-snapshot
Search and Aggregation in Big Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.