On the public citation graph
Strong simulation
0 signed · 167 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/3-540-55210-3_198openalex-snapshot
On the approximability of the maximum common subgraph problem
inferredcites →https://doi.org/10.1007/3-540-62222-5_33openalex-snapshot
Querying semi-structured data
inferredcites →https://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferredcites →https://doi.org/10.1007/978-3-642-17551-0_2openalex-snapshot
Massive Graph Management for the Web and Web 2.0
inferredcites →https://doi.org/10.1007/978-3-7091-0388-3_8openalex-snapshot
Finding Hidden Links in Terrorist Networks by Checking Indirect Links of Different Sub-Networks
inferredcites →https://doi.org/10.1007/s007780100054openalex-snapshot
Answering queries using views: A survey
inferredcites →https://doi.org/10.1016/0950-5849(91)90083-nopenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/j.jebo.2003.11.005openalex-snapshot
The boundaries of trust: own and others’ actions in the US and China
inferredcites →https://doi.org/10.1016/j.jpdc.2008.04.003openalex-snapshot
Distributed XML processing: Theory and applications
inferredcites →https://doi.org/10.1016/s0022-2836(03)00239-0openalex-snapshot
How Reliable are Experimental Protein–Protein Interaction Data?
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/asonam.2010.52openalex-snapshot
Detecting Social Positions Using Simulation
inferredcites →https://doi.org/10.1109/icde.2008.4497505openalex-snapshot
TALE: A Tool for Approximate Large Graph Matching
inferredcites →https://doi.org/10.1109/icde.2009.67openalex-snapshot
Querying Communities in Relational Databases
inferredcites →https://doi.org/10.1109/icde.2011.5767858openalex-snapshot
Adding regular expressions to graph reachability and pattern queries
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.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1247480.1247537openalex-snapshot
Distributed query evaluation with performance guarantees
inferredcites →https://doi.org/10.1145/1281192.1281271openalex-snapshot
Fast best-effort pattern matching in large attributed graphs
inferredcites →https://doi.org/10.1145/1331904.1331908openalex-snapshot
Information preserving XML schema embedding
inferredcites →https://doi.org/10.1145/1376616.1376678openalex-snapshot
Minimization of tree pattern queries with constraints
inferredcites →https://doi.org/10.1145/1804669.1804672openalex-snapshot
From polynomial time queries to graph structure theory
inferredcites →https://doi.org/10.1145/2187836.2187963openalex-snapshot
Distributed graph pattern matching
inferredcites →https://doi.org/10.1145/2213836.2213855openalex-snapshot
Query preserving graph compression
inferredcites →https://doi.org/10.1145/2213836.2213895openalex-snapshot
Towards effective partition management for large graphs
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/371578.371598openalex-snapshot
The state of the art in distributed query processing
inferredcites →https://doi.org/10.1145/956863.956972openalex-snapshot
The link prediction problem for social networks
inferredcites →https://doi.org/10.14778/1920841.1920986openalex-snapshot
Graph homomorphism revisited for graph matching
inferredcites →https://doi.org/10.14778/2095686.2095690openalex-snapshot
Capturing topology in graph pattern matching
inferredcites →https://doi.org/10.14778/2350229.2350248openalex-snapshot
Performance guarantees for distributed reachability queries
inferredcites →https://doi.org/10.14778/2536258.2536263openalex-snapshot
Diversified top-k graph pattern matching
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.4108/icst.collaboratecom.2012.250532openalex-snapshot
Towards Efficient Query Processing on Massive Time-Evolving Graphs
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-3-030-00856-7_17openalex-snapshot
Graph Pattern Matching Preserving Label-Repetition Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-05414-4_4openalex-snapshot
A General Powerful Graph Pattern Matching System for Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-33223-5_41openalex-snapshot
Modal Schema Graphs for Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-55814-7_26openalex-snapshot
Exploring Citation Networks with Hybrid Tree Pattern Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-62005-9_19openalex-snapshot
Leveraging Double Simulation to Efficiently Evaluate Hybrid Patterns on Data Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-71804-6_22openalex-snapshot
Conditional Graph Pattern Matching with a Basic Static Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-01866-4openalex-snapshot
Data Exploration Using Example-Based Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-44216-2_29openalex-snapshot
Event Association Analysis Using Graph Rules
inferred← citeshttps://doi.org/10.1007/978-3-319-32001-4_360-1openalex-snapshot
Graph-Theoretic Computations/Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-49340-4_15openalex-snapshot
Similarity Search in Large-Scale Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-63579-8_9openalex-snapshot
Time-Constrained Graph Pattern Matching in a Large Temporal Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_80-1openalex-snapshot
Graph Exploration and Search
inferred← citeshttps://doi.org/10.1007/978-3-319-69904-2_11openalex-snapshot
Querying Graph Databases: What Do Graph Patterns Mean?
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_80openalex-snapshot
Graph Exploration and Search
inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_20openalex-snapshot
A Privacy-Preserving Framework for Subgraph Pattern Matching in Cloud
inferred← citeshttps://doi.org/10.1007/978-3-319-96193-4_4openalex-snapshot
Applications of Flexible Querying to Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-319-98812-2_29openalex-snapshot
A Hybrid Approach of Subgraph Isomorphism and Graph Simulation for Graph Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-981-13-2922-7_16openalex-snapshot
A Vertex-Centric Graph Simulation Algorithm for Large Graphs
inferred← citeshttps://doi.org/10.1007/s00521-021-06590-7openalex-snapshot
Expressive top-k matching for conditional graph patterns
inferred← citeshttps://doi.org/10.1007/s00778-016-0429-2openalex-snapshot
Exemplar queries: a new way of searching
inferred← citeshttps://doi.org/10.1007/s00778-016-0447-0openalex-snapshot
PANDA: toward partial topology-based search on large networks in a single machine
inferred← citeshttps://doi.org/10.1007/s10586-019-02977-3openalex-snapshot
Graph pattern matching with counting quantifiers and label-repetition constraints
inferred← citeshttps://doi.org/10.1007/s10707-019-00381-yopenalex-snapshot
Graph simulation on large scale temporal graphs
inferred← citeshttps://doi.org/10.1007/s11227-025-08063-3openalex-snapshot
A scalable local-search approximation for diversity-aware querying in large graphs
inferred← citeshttps://doi.org/10.1007/s11280-019-00674-0openalex-snapshot
Distributed time-respecting flow graph pattern matching on temporal graphs
inferred← citeshttps://doi.org/10.1007/s11280-019-00714-9openalex-snapshot
Multi-fuzzy-objective graph pattern matching in big graph environments with reliability, trust and social relationship
inferred← citeshttps://doi.org/10.1007/s11280-019-00754-1openalex-snapshot
Cluster query: a new query pattern on temporal knowledge graph
inferred← citeshttps://doi.org/10.1007/s11280-020-00784-0openalex-snapshot
SGPM: a privacy protected approach of time-constrained graph pattern matching in cloud
inferred← citeshttps://doi.org/10.1007/s11280-024-01259-2openalex-snapshot
Towards Efficient Simulation-Based Constrained Temporal Graph Pattern Matching
inferred← citeshttps://doi.org/10.1007/s11390-014-1473-2openalex-snapshot
Querying Big Data: Bridging Theory and Practice
inferred← citeshttps://doi.org/10.1007/s11390-019-1969-xopenalex-snapshot
An Efficient Framework for Multiple Subgraph Pattern Matching Models
inferred← citeshttps://doi.org/10.1007/s11704-015-4515-1openalex-snapshot
Big graph search: challenges and techniques
inferred← citeshttps://doi.org/10.1007/s11704-026-52206-5openalex-snapshot
Temporal network motifs: concepts, algorithms, and applications
inferred← citeshttps://doi.org/10.1007/s13222-018-0286-9openalex-snapshot
Using Queries as Schema-Templates for Graph Databases
inferred← citeshttps://doi.org/10.1007/s13278-019-0599-1openalex-snapshot
Diversified top-k search with relaxed graph simulation
inferred← citeshttps://doi.org/10.1007/s41019-016-0025-xopenalex-snapshot
Big Graph Analyses: From Queries to Dependencies and Association Rules
inferred← citeshttps://doi.org/10.1016/j.datak.2018.09.003openalex-snapshot
INSiGHT: A system to detect violent extremist radicalization trajectories in dynamic graphs
inferred← citeshttps://doi.org/10.1016/j.eng.2023.07.014openalex-snapshot
A Survey of Tax Risk Detection Using Data Mining Techniques
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.11.007openalex-snapshot
Rough approximations based on bisimulations
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121571openalex-snapshot
Size-fixed group discovery via multi-constrained graph pattern matching
inferred← citeshttps://doi.org/10.1016/j.is.2023.102249openalex-snapshot
A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs
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.1016/j.knosys.2017.01.007openalex-snapshot
Design pattern detection based on the graph theory
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.04.003openalex-snapshot
A hierarchical model for label constraint reachability computation
inferred← citeshttps://doi.org/10.1016/j.websem.2016.08.001openalex-snapshot
Approximation and relaxation of semantic web path queries
inferred← citeshttps://doi.org/10.1093/comjnl/bxw063openalex-snapshot
Virtual Network Mapping in Cloud Computing: A Graph Pattern Matching Approach
inferred← citeshttps://doi.org/10.1109/aiccsa59173.2023.10479283openalex-snapshot
Diversified Top-k Answering of Cypher Queries over Large Data Graphs
inferred← citeshttps://doi.org/10.1109/asonam.2016.7752333openalex-snapshot
Investigative simulation: Towards utilizing graph pattern matching for investigative search
inferred← citeshttps://doi.org/10.1109/asonam.2018.8508283openalex-snapshot
Fast Top-k Search with Relaxed Graph Simulation
inferred← citeshttps://doi.org/10.1109/cbd54617.2021.00028openalex-snapshot
An Execution Cost Model for Aggregate Queries over Knowledge Graphs
inferred← citeshttps://doi.org/10.1109/ccaa.2016.7813689openalex-snapshot
Answering graph pattern query using incremental views
inferred← citeshttps://doi.org/10.1109/dsaa.2016.14openalex-snapshot
Pattern Matching Trajectories for Investigative Graph Searches
inferred← citeshttps://doi.org/10.1109/dsc59305.2023.00089openalex-snapshot
Graph Pattern Matching Based Intelligent Operation and Maintenance Method for Cloud Resource Operation
inferred← citeshttps://doi.org/10.1109/dta.2015.8openalex-snapshot
Graph Pattern Matching through Model Checking
inferred← citeshttps://doi.org/10.1109/fskd.2018.8687149openalex-snapshot
Efficient $K$-concern Matching in a Large Graph
inferred← citeshttps://doi.org/10.1109/gc46384.2019.00017openalex-snapshot
Investigative Graph Search using Graph Databases
inferred← citeshttps://doi.org/10.1109/icde.2018.00034openalex-snapshot
Incremental Graph Pattern Based Node Matching
inferred← citeshttps://doi.org/10.1109/icde.2018.00078openalex-snapshot
Multi-Example Search in Rich Information Graphs
inferred← citeshttps://doi.org/10.1109/icde.2019.00028openalex-snapshot
Scaling Up Subgraph Query Processing with Efficient Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde.2019.00029openalex-snapshot
Efficient Parallel Subgraph Enumeration on a Single Machine
inferred← citeshttps://doi.org/10.1109/icde.2019.00030openalex-snapshot
Fast Dual Simulation Processing of Graph Database Queries
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00045openalex-snapshot
Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00082openalex-snapshot
Efficient Team Formation in Social Networks based on Constrained Pattern Graph
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00117openalex-snapshot
A Framework to Quantify Approximate Simulation on Graph Data
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00133openalex-snapshot
Privacy Preserving Strong Simulation Queries on Large Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00052openalex-snapshot
Linking Entities across Relations and Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00068openalex-snapshot
Estimating Node Importance Values in Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00263openalex-snapshot
Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00093openalex-snapshot
Pilos: Scalable Large-Subgraph Matching by Online Spectral Filtering
inferred← citeshttps://doi.org/10.1109/icdis55630.2022.00054openalex-snapshot
Dynamic Graph Pattern Matching in Medical Knowledge Graphs
inferred← citeshttps://doi.org/10.1109/ickg52313.2021.00023openalex-snapshot
Intuitionistic Fuzzy Requirements Aggregation for Graph Pattern Matching with Group Decision Makers
inferred← citeshttps://doi.org/10.1109/icsai.2017.8248511openalex-snapshot
Querying big data from a database perspective
inferred← citeshttps://doi.org/10.1109/isi.2016.7745498openalex-snapshot
Detecting radicalization trajectories using graph pattern matching algorithms
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644869openalex-snapshot
Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine
inferred← citeshttps://doi.org/10.1109/pdgc.2016.7913116openalex-snapshot
MoVie: A scalable algorithm for answering graph pattern query using incremental views
inferred← citeshttps://doi.org/10.1109/scc49832.2020.00019openalex-snapshot
D-colSimulation: A Distributed Approach for Frequent Graph Pattern Mining based on colSimulation in a Single Large Graph
inferred← citeshttps://doi.org/10.1109/tcss.2019.2938787openalex-snapshot
Finding Emergent Patterns of Behaviors in Dynamic Heterogeneous Social Networks
inferred← citeshttps://doi.org/10.1109/tetci.2022.3141062openalex-snapshot
Interval-Valued Intuitionistic Fuzzy Decision With Graph Pattern in Big Graph
inferred← citeshttps://doi.org/10.1109/tetci.2024.3359096openalex-snapshot
Fuzzy Ranking-Based Preference Completion via Graph Pattern Matching and Rematching
inferred← citeshttps://doi.org/10.1109/tkde.2020.2968901openalex-snapshot
Time-Respecting Flow Graph Pattern Matching on Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2025.3538514openalex-snapshot
Discovery of Temporal Network Motifs
inferred← citeshttps://doi.org/10.1109/tkde.2026.3718737openalex-snapshot
PMatch: A Secure Framework for Querying Private Localized Graph Patterns
inferred← citeshttps://doi.org/10.1109/tsc.2021.3073145openalex-snapshot
Enhancing Investigative Pattern Detection via Inexact Matching and Graph Databases
inferred← citeshttps://doi.org/10.1142/s0218001421500117openalex-snapshot
Graph Pattern Matching: Capturing Bisimilar Subgraph
inferred← citeshttps://doi.org/10.1145/3132847.3132992openalex-snapshot
Relaxing Graph Pattern Matching With Explanations
inferred← citeshttps://doi.org/10.1145/3318464.3384401openalex-snapshot
Simulation-based Approximate Graph Pattern Matching
inferred← citeshttps://doi.org/10.1145/3394486.3403247openalex-snapshot
Neural Subgraph Isomorphism Counting
inferred← citeshttps://doi.org/10.1145/3447879.3447883openalex-snapshot
Approximate computation for big data analytics
inferred← citeshttps://doi.org/10.1145/3481640openalex-snapshot
Social Group Query Based on Multi-Fuzzy-Constrained Strong Simulation
inferred← citeshttps://doi.org/10.1145/3508397.3564851openalex-snapshot
Towards a Strong Containment for Efficient Matching of Expressive Graph Patterns
inferred← citeshttps://doi.org/10.1145/3532623openalex-snapshot
Semi-Supervised Graph Pattern Matching and Rematching for Expert Community Location
inferred← citeshttps://doi.org/10.1145/3589274openalex-snapshot
A Framework for Privacy Preserving Localized Graph Pattern Query Processing
inferred← citeshttps://doi.org/10.1145/3711896.3737006openalex-snapshot
Improving Subgraph Matching by Combining Algorithms and Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3725323openalex-snapshot
MatCo: Computing Match Cover of Subgraph Query over Graph Data
inferred← citeshttps://doi.org/10.1145/3769806openalex-snapshot
MAVIS: Materialized View for Subgraph Matching
inferred← citeshttps://doi.org/10.1162/dint_a_00153openalex-snapshot
Fuzzy-Constrained Graph Pattern Matching in Medical Knowledge Graphs
inferred← citeshttps://doi.org/10.13140/rg.2.1.1402.6644openalex-snapshot
Graph Pattern Matching: A Brief Survey of Challenges and Research Directions
inferred← citeshttps://doi.org/10.14778/3654621.3654641openalex-snapshot
Extending Graph Rules with Oracles
inferred← citeshttps://doi.org/10.2200/s00881ed1v01y201810dtm053openalex-snapshot
Data Exploration Using Example-Based Methods
inferred← citeshttps://doi.org/10.26599/bdma.2025.9020012openalex-snapshot
Anomaly Detection Using Graph Anomaly Rules
inferred← citeshttps://doi.org/10.3233/ida-194653openalex-snapshot
Multi-fuzzy-constrained graph pattern matching with big graph data
inferred← citeshttps://doi.org/10.3390/math11183908openalex-snapshot
Efficient Complex Aggregate Queries with Accuracy Guarantee Based on Execution Cost Model over Knowledge Graphs
inferred← citeshttps://doi.org/10.3390/math11224672openalex-snapshot
Logical–Mathematical Foundations of a Graph Query Framework for Relational Learning
inferred← citeshttps://doi.org/10.3390/sym17101659openalex-snapshot
A Logical Characterization for Approximate Matching of Pattern Graphs with Regular Expressions
inferred← citeshttps://doi.org/10.4018/jdm.2019100102openalex-snapshot
Multi-Fuzzy-Objective Graph Pattern Matching with Big Graph Data
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06264openalex-snapshot
Foundations of Modern Query Languages for Graph Databases
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07404openalex-snapshot
Vertex-Centric Graph Processing: Good, Bad, and the Ugly
inferred← citeshttps://doi.org/10.48550/arxiv.1801.01012openalex-snapshot
Graph Pattern Matching for Dynamic Team Formation
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09355openalex-snapshot
Fast Dual Simulation Processing of Graph Database Queries (Supplement)
inferred← citeshttps://doi.org/10.48550/arxiv.2012.06802openalex-snapshot
Deep Analysis on Subgraph Isomorphism
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.