On the public citation graph
Vertex nomination via seeded graph matching
0 signed · 65 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/asi.10372openalex-snapshot
A graph model for E‐commerce recommender systems
inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1002/wics.1365openalex-snapshot
Bayesian Vertex Nomination Using Content and Context
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_11openalex-snapshot
Random Dot Product Graph Models for Social Networks
inferredcites →https://doi.org/10.1007/s10588-005-5378-zopenalex-snapshot
Scan Statistics on Enron Graphs
inferredcites →https://doi.org/10.1007/s11263-011-0442-2openalex-snapshot
Unsupervised Learning for Graph Matching
inferredcites →https://doi.org/10.1016/0378-8733(83)90021-7openalex-snapshot
Stochastic blockmodels: First steps
inferredcites →https://doi.org/10.1073/pnas.1400374111openalex-snapshot
Network histograms and universality of blockmodel approximation
inferredcites →https://doi.org/10.1073/pnas.1814462116openalex-snapshot
On a two-truths phenomenon in spectral graph clustering
inferredcites →https://doi.org/10.1080/01621459.2012.699795openalex-snapshot
A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
inferredcites →https://doi.org/10.1093/bioinformatics/btp196openalex-snapshot
Global alignment of protein–protein interaction networks by graph matching methods
inferredcites →https://doi.org/10.1093/bioinformatics/btr127openalex-snapshot
Integrative network alignment reveals large regions of global network similarity in yeast and human
inferredcites →https://doi.org/10.1109/34.598235openalex-snapshot
Face recognition by elastic bunch graph matching
inferredcites →https://doi.org/10.1109/allerton.2013.6736720openalex-snapshot
A Bayesian method for matching two similar graphs without seeds
inferredcites →https://doi.org/10.1109/allerton.2015.7446983openalex-snapshot
When can two unlabeled networks be aligned under partial overlap?
inferredcites →https://doi.org/10.1109/cvpr.2005.320openalex-snapshot
Shape Matching and Object Recognition Using Low Distortion Correspondences
inferredcites →https://doi.org/10.1109/cvpr.2008.4587500openalex-snapshot
Probabilistic graph and hypergraph matching
inferredcites →https://doi.org/10.1109/iccv.2013.207openalex-snapshot
Joint Optimization for Consistent Multiple Graph Matching
inferredcites →https://doi.org/10.1109/icmla.2012.72openalex-snapshot
A Comparison of Graph Embedding Methods for Vertex Nomination
inferredcites →https://doi.org/10.1109/infocom.2015.7218536openalex-snapshot
De-anonymizing scale-free social networks by percolation graph matching
inferredcites →https://doi.org/10.1109/infocom.2016.7524585openalex-snapshot
On the relative de-anonymizability of graph data: Quantification and evaluation
inferredcites →https://doi.org/10.1109/t-c.1975.224297openalex-snapshot
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
inferredcites →https://doi.org/10.1109/tpami.2008.245openalex-snapshot
A Path Following Algorithm for the Graph Matching Problem
inferredcites →https://doi.org/10.1109/tpami.2015.2424894openalex-snapshot
Graph Matching: Relax at Your Own Risk
inferredcites →https://doi.org/10.1109/tsmc.1985.6313426openalex-snapshot
A fuzzy K-nearest neighbor algorithm
inferredcites →https://doi.org/10.1109/tsp.2013.2294594openalex-snapshot
Locality Statistics for Anomaly Detection in Time Series of Graphs
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1142/s0218001414500013openalex-snapshot
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
inferredcites →https://doi.org/10.1145/1390156.1390201openalex-snapshot
Localized multiple kernel learning
inferredcites →https://doi.org/10.1201/9780203750520-11openalex-snapshot
Face Recognition by Elastic Bunch Graph Matching*†
inferredcites →https://doi.org/10.1214/11-aos887openalex-snapshot
Spectral clustering and the high-dimensional stochastic blockmodel
inferredcites →https://doi.org/10.1214/15-aoas834openalex-snapshot
Vertex nomination schemes for membership prediction
inferredcites →https://doi.org/10.1214/aos/1176343886openalex-snapshot
Consistent Nonparametric Regression
inferredcites →https://doi.org/10.1371/journal.pone.0121002openalex-snapshot
Fast Approximate Quadratic Programming for Graph Matching
inferredcites →https://doi.org/10.1371/journal.pone.0136497openalex-snapshot
Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys
inferredcites →https://doi.org/10.14778/2794367.2794371openalex-snapshot
Growing a graph matching from a handful of seeds
inferredcites →https://doi.org/10.1609/aimag.v29i3.2157openalex-snapshot
Collective Classification in Network Data
inferredcites →https://doi.org/10.4137/cin.s4744openalex-snapshot
Optimal Network Alignment with Graphlet Degree Vectors
inferredcites →https://doi.org/10.48550/arxiv.1201.4118openalex-snapshot
Vertex Nomination via Content and Context
inferredcites →https://doi.org/10.48550/arxiv.1304.7844openalex-snapshot
Seeded graph matching for correlated Erdős-Rényi graphs
inferredcites →https://doi.org/10.48550/arxiv.1311.6425openalex-snapshot
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
inferredcites →https://doi.org/10.48550/arxiv.1607.01369openalex-snapshot
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
inferredcites →https://doi.org/10.48550/arxiv.1608.01373openalex-snapshot
Matching Community Structure Across Online Social Networks
inferredcites →https://doi.org/10.5220/0001787803310340openalex-snapshot
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/widm.1454openalex-snapshot
Subgraph mining in a large graph: A review
inferred← citeshttps://doi.org/10.1007/s11222-023-10206-6openalex-snapshot
Subgraph nomination: query by example subgraph retrieval in networks
inferred← citeshttps://doi.org/10.1016/j.csda.2020.106916openalex-snapshot
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
inferred← citeshttps://doi.org/10.1016/j.csda.2024.108091openalex-snapshot
Lost in the shuffle: Testing power in the presence of errorful network vertex labels
inferred← citeshttps://doi.org/10.1016/j.patcog.2024.110797openalex-snapshot
Iterative active learning strategies for subgraph matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2019.05.008openalex-snapshot
Alignment strength and correlation for graphs
inferred← citeshttps://doi.org/10.1080/10618600.2022.2060238openalex-snapshot
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
inferred← citeshttps://doi.org/10.1080/10618600.2025.2544182openalex-snapshot
On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory
inferred← citeshttps://doi.org/10.1080/26939169.2026.2685694openalex-snapshot
Self-Regulated Learning in Data Science Education: Designing and Refining a Data Storytelling-Driven Approach through Students’ Perspectives
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9377988openalex-snapshot
Graph Adversarial Attacks and Defense: An Empirical Study on Citation Graph
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378273openalex-snapshot
Robust and Scalable Entity Alignment in Big Data
inferred← citeshttps://doi.org/10.1126/science.add9330openalex-snapshot
The connectome of an insect brain
inferred← citeshttps://doi.org/10.1214/20-ejs1744openalex-snapshot
Vertex nomination, consistent estimation, and adversarial modification
inferred← citeshttps://doi.org/10.1214/25-ejs2366openalex-snapshot
Novel network trimming for robust vertex nomination in contaminated networks
inferred← citeshttps://doi.org/10.48550/arxiv.1711.05610openalex-snapshot
On consistent vertex nomination schemes
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00163openalex-snapshot
The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05366openalex-snapshot
Graph Matching via Optimal Transport
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.