On the public citation graph

Binary Constraint Preserving Graph Matching

0 signed · 50 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/978-3-319-18224-7_22openalex-snapshot
Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization
inferredcites →https://doi.org/10.1007/978-3-540-88688-4_44openalex-snapshot
Feature Correspondence Via Graph Matching: Models and Global Optimization
inferredcites →https://doi.org/10.1007/978-3-642-15555-0_36openalex-snapshot
Reweighted Random Walks for Graph Matching
inferredcites →https://doi.org/10.1007/978-3-642-33712-3_59openalex-snapshot
On the Convergence of Graph Matching: Graduated Assignment Revisited
inferredcites →https://doi.org/10.1007/s11263-011-0439-xopenalex-snapshot
Discriminative Models for Multi-Class Object Layout
inferredcites →https://doi.org/10.1007/s11263-011-0442-2openalex-snapshot
Unsupervised Learning for Graph Matching
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/cvpr.2009.5206561openalex-snapshot
Fast normalized cut with linear constraints
inferredcites →https://doi.org/10.1109/cvpr.2012.6247667openalex-snapshot
Factorized graph matching
inferredcites →https://doi.org/10.1109/cvpr.2013.376openalex-snapshot
Deformable Graph Matching
inferredcites →https://doi.org/10.1109/cvpr.2015.7299164openalex-snapshot
A flexible tensor block coordinate ascent scheme for hypergraph matching
inferredcites →https://doi.org/10.1109/cvpr.2016.135openalex-snapshot
Pairwise Matching through Max-Weight Bipartite Belief Propagation
inferredcites →https://doi.org/10.1109/cvprw.2009.5206561openalex-snapshot
Fast normalized cut with linear constraints
inferredcites →https://doi.org/10.1109/iccv.2005.20openalex-snapshot
A spectral technique for correspondence problems using pairwise constraints
inferredcites →https://doi.org/10.1109/iccv.2009.5459319openalex-snapshot
Optimal correspondences from pairwise constraints
inferredcites →https://doi.org/10.1109/iccv.2015.21openalex-snapshot
Discrete Tabu Search for Graph Matching
inferredcites →https://doi.org/10.1109/icip.2010.5651903openalex-snapshot
Matching of interest point groups with pairwise spatial constraints
inferredcites →https://doi.org/10.1109/tpami.2004.95openalex-snapshot
A POCS-based graph matching algorithm
inferredcites →https://doi.org/10.1109/tpami.2007.41openalex-snapshot
Shape Classification Using the Inner-Distance
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.2009.28openalex-snapshot
Learning Graph Matching
inferredcites →https://doi.org/10.1109/tpami.2012.51openalex-snapshot
A Probabilistic Approach to Spectral Graph Matching
inferredcites →https://doi.org/10.1109/tpami.2013.223openalex-snapshot
GNCCP—Graduated NonConvexityand Concavity Procedure
inferredcites →https://doi.org/10.1109/tpami.2016.2574706openalex-snapshot
An Efficient Multilinear Optimization Framework for Hypergraph Matching
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1162/089976699300016034openalex-snapshot
Replicator Equations, Maximal Cliques, and Graph Isomorphism
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0044openalex-snapshot
Balanced Graph Matching

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-01270-0_38openalex-snapshot
Adaptively Transforming Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-04224-0_45openalex-snapshot
Graph Matching Based on Fast Normalized Cut
inferred← citeshttps://doi.org/10.1007/978-3-030-34110-7_13openalex-snapshot
Person Re-identification with Patch-Based Local Sparse Matching and Metric Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-42128-1_2openalex-snapshot
Unsupervised Learning of Graph and Hypergraph Matching
inferred← citeshttps://doi.org/10.1007/s11263-020-01359-2openalex-snapshot
Image Matching from Handcrafted to Deep Features: A Survey
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.03.021openalex-snapshot
Synchronisation of partial multi-matchings via non-negative factorisations
inferred← citeshttps://doi.org/10.1016/j.patcog.2020.107418openalex-snapshot
Fast matching via ergodic markov chain for super-large graphs
inferred← citeshttps://doi.org/10.1016/j.patcog.2021.108228openalex-snapshot
Graph matching based on fast normalized cut and multiplicative update mapping
inferred← citeshttps://doi.org/10.1109/3dv50981.2020.00068openalex-snapshot
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
inferred← citeshttps://doi.org/10.1109/access.2019.2908925openalex-snapshot
Progressively Decomposing Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00453openalex-snapshot
DS: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
inferred← citeshttps://doi.org/10.1109/cvpr.2019.01141openalex-snapshot
A Convex Relaxation for Multi-Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00715openalex-snapshot
Determinant Regularization for Gradient-Efficient Graph Matching
inferred← citeshttps://doi.org/10.1109/iccv.2019.01038openalex-snapshot
HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching
inferred← citeshttps://doi.org/10.1109/jas.2023.123774openalex-snapshot
Feature Matching via Topology-Aware Graph Interaction Model
inferred← citeshttps://doi.org/10.1109/tmm.2019.2957984openalex-snapshot
Guide to Match: Multi-Layer Feature Matching With a Hybrid Gaussian Mixture Model
inferred← citeshttps://doi.org/10.1109/tpami.2019.2919308openalex-snapshot
A Functional Representation for Graph Matching
inferred← citeshttps://doi.org/10.1145/3532213.3532318openalex-snapshot
Reinforcement Learning of Graph Matching
inferred← citeshttps://doi.org/10.1145/3711896.3736839openalex-snapshot
Alpine: Partial Unlabeled Graph Alignment
inferred← citeshttps://doi.org/10.3390/rs16101712openalex-snapshot
A Multiscale Attention Segment Network-Based Semantic Segmentation Model for Landslide Remote Sensing Images
inferred← citeshttps://doi.org/10.48550/arxiv.1811.10541openalex-snapshot
Higher-order Projected Power Iterations for Scalable Multi-Matching
inferred← citeshttps://doi.org/10.48550/arxiv.2107.04032openalex-snapshot
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
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.