On the public citation graph
Circinus: Fast Redundancy-Reduced Subgraph Matching
0 signed · 69 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.1016/j.dam.2018.02.018openalex-snapshot
VF2++—An improved subgraph isomorphism algorithm
inferredcites →https://doi.org/10.1109/icde48307.2020.00122openalex-snapshot
G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph
inferredcites →https://doi.org/10.1109/sc41405.2020.00104openalex-snapshot
GraphPi: High Performance Graph Pattern Matching through Effective Redundancy Elimination
inferredcites →https://doi.org/10.1109/tkde.2020.3035564openalex-snapshot
Exploiting Reuse for GPU Subgraph Enumeration
inferredcites →https://doi.org/10.1145/2882903.2915236openalex-snapshot
Efficient Subgraph Matching by Postponing Cartesian Products
inferredcites →https://doi.org/10.1145/3186728.3164139openalex-snapshot
The ubiquity of large graphs and surprising challenges of graph processing
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
inferredcites →https://doi.org/10.1145/3318464.3389699openalex-snapshot
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs
inferredcites →https://doi.org/10.1145/3448016.3457237openalex-snapshot
HUGE: An Efficient and Scalable Subgraph Enumeration System
inferredcites →https://doi.org/10.1145/3448016.3457265openalex-snapshot
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot
Taming verification hardness
inferredcites →https://doi.org/10.14778/1920841.1920873openalex-snapshot
High-performance dynamic pattern matching over disordered streams
inferredcites →https://doi.org/10.14778/1920841.1920887openalex-snapshot
On graph query optimization in large networks
inferredcites →https://doi.org/10.14778/2735479.2735493openalex-snapshot
Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs
inferredcites →https://doi.org/10.14778/3021924.3021937openalex-snapshot
Scalable distributed subgraph enumeration
inferredcites →https://doi.org/10.14778/3184470.3184473openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-95-7996-9_5openalex-snapshot
Efficient Subgraph Matching with Adaptive Filtering and Core-Set Prioritization
inferred← citeshttps://doi.org/10.1007/978-981-96-0567-5_26openalex-snapshot
Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation
inferred← citeshttps://doi.org/10.1007/s13278-023-01157-xopenalex-snapshot
An adaptive graph sampling framework for graph analytics
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00231openalex-snapshot
Large Subgraph Matching: A Comprehensive and Efficient Approach for Heterogeneous Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00250openalex-snapshot
Efficient Multi-Query Oriented Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00082openalex-snapshot
TeMatch: A Fast Temporal Subgraph Matching Framework with Temporal-Aware Subgraph Matching Algorithms
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00188openalex-snapshot
On Temporal-Constraint Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00304openalex-snapshot
OptMatch: An Efficient and Generic Neural Network-Assisted Subgraph Matching Approach
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00248openalex-snapshot
Efficient Graph Matching with Pattern Reduction
inferred← citeshttps://doi.org/10.1109/msn63567.2024.00093openalex-snapshot
AnchorMine: An Efficient Graph Pattern Matching System for Specific Vertex Matching
inferred← citeshttps://doi.org/10.1109/sc41404.2022.00057openalex-snapshot
VSGM: View-Based GPU-Accelerated Subgraph Matching on Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2025.3624574openalex-snapshot
BLITZ: A Flexible and Efficient Graph Mining System
inferred← citeshttps://doi.org/10.1109/tkde.2026.3700606openalex-snapshot
Fragmented Graph Pattern Matching on Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2026.3702627openalex-snapshot
Accelerating Top-K Subgraph Matching With Topology-Aware Pruning and Parallel Processing
inferred← citeshttps://doi.org/10.1109/tkde.2026.3721816openalex-snapshot
Efficient Multi-Query Optimization for Continuous Subgraph Matching Over Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3627673.3679790openalex-snapshot
Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds
inferred← citeshttps://doi.org/10.1145/3637528.3671997openalex-snapshot
DiffusionE: Reasoning on Knowledge Graphs via Diffusion-based Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3639315openalex-snapshot
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
inferred← citeshttps://doi.org/10.1145/3677129openalex-snapshot
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching
inferred← citeshttps://doi.org/10.1145/3709665openalex-snapshot
BⓈ X : Subgraph Matching with Batch Backtracking Search
inferred← citeshttps://doi.org/10.1145/3725398openalex-snapshot
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
inferred← citeshttps://doi.org/10.1145/3725404openalex-snapshot
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
inferred← citeshttps://doi.org/10.1145/3749159openalex-snapshot
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3771791openalex-snapshot
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3786697openalex-snapshot
SG-Serve: Efficient Model Serving for Subgraph-based Graph Representation Learning
inferred← citeshttps://doi.org/10.1145/3802022openalex-snapshot
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3659437.3659451openalex-snapshot
Fast Local Subgraph Counting
inferred← citeshttps://doi.org/10.14778/3681954.3681963openalex-snapshot
TC-Match: Fast Time-Constrained Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3749646.3749662openalex-snapshot
Accelerating Subgraph Matching through Fine-Grained and Powerful Equivalences
inferred← citeshttps://doi.org/10.14778/3749646.3749693openalex-snapshot
Subgraph Matching: A New Decomposition Based Approach
inferred← citeshttps://doi.org/10.14778/3801059.3801070openalex-snapshot
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
inferred← citeshttps://doi.org/10.14778/3819518.3819552openalex-snapshot
Subgraph Enumeration: Beyond Tree Decomposition
inferred← citeshttps://doi.org/10.3390/electronics13214191openalex-snapshot
Categorical Multi-Query Subgraph Matching on Labeled Graph
inferred← citeshttps://doi.org/10.37394/23209.2024.21.32openalex-snapshot
Edge Deletion based Subgraph Hiding
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.