On the public citation graph
Computation and Monitoring of Exclusive Closest Pairs
0 signed · 47 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/nav.20053openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/net.3230110407openalex-snapshot
A shortest augmenting path method for solving minimal perfect matching problems
inferredcites →https://doi.org/10.1007/978-3-540-73540-3_1openalex-snapshot
Continuous Monitoring of Exclusive Closest Pairs
inferredcites →https://doi.org/10.1007/s10115-003-0122-9openalex-snapshot
The k-Nearest Neighbour Join: Turbo Charging the KDD Process
inferredcites →https://doi.org/10.1007/s10707-005-4576-7openalex-snapshot
Continuous Query Processing of Spatio-Temporal Data Streams in PLACE
inferredcites →https://doi.org/10.1016/b978-012722442-8/50060-4openalex-snapshot
Supporting Frequent Updates in R-Trees
inferredcites →https://doi.org/10.1016/c2013-0-06161-0openalex-snapshot
Cluster Analysis for Applications
inferredcites →https://doi.org/10.1080/00029890.1962.11989827openalex-snapshot
College Admissions and the Stability of Marriage
inferredcites →https://doi.org/10.1109/50.4033openalex-snapshot
Spatial mode matching efficiencies for heterodyned GaAlAs semiconductor lasers
inferredcites →https://doi.org/10.1109/icde.1998.655809openalex-snapshot
High dimensional similarity joins: algorithms and performance evaluation
inferredcites →https://doi.org/10.1109/icde.2005.128openalex-snapshot
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
inferredcites →https://doi.org/10.1109/icde.2005.92openalex-snapshot
Monitoring k-Nearest Neighbor Queries over Moving Objects
inferredcites →https://doi.org/10.1109/ideas.2002.1029666openalex-snapshot
An index structure for improving closest pairs and related join queries in spatial databases
inferredcites →https://doi.org/10.1109/ssdbm.2004.12openalex-snapshot
All-nearest-neighbors queries in spatial databases
inferredcites →https://doi.org/10.1109/ssdm.2004.1311221openalex-snapshot
All-nearest-neighbors queries in spatial databases
inferredcites →https://doi.org/10.1145/1138394.1138396openalex-snapshot
Maintenance of K -nn and spatial join queries on continuously moving points
inferredcites →https://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/335191.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/351827.351829openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
inferredcites →https://doi.org/10.21236/ad0251958openalex-snapshot
COLLEGE ADMISSIONS AND THE STABILITY OF MARRIAGE
inferredcites →https://doi.org/10.2307/2312726openalex-snapshot
College Admissions and the Stability of Marriage
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-319-23519-6_1518-1openalex-snapshot
Optimal Matching Between Spatial Datasets
inferred← citeshttps://doi.org/10.1007/978-3-642-20291-9_8openalex-snapshot
Top-K Probabilistic Closest Pairs Query in Uncertain Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-23535-1_51openalex-snapshot
Evaluating Probabilistic Spatial-Range Closest Pairs Queries over Uncertain Objects
inferred← citeshttps://doi.org/10.1007/s00778-011-0259-1openalex-snapshot
A highly optimized algorithm for continuous intersection join queries over moving objects
inferred← citeshttps://doi.org/10.1007/s00778-015-0383-4openalex-snapshot
Efficient $$k$$ k -closest pair queries in general metric spaces
inferred← citeshttps://doi.org/10.1007/s10707-016-0246-1openalex-snapshot
New plane-sweep algorithms for distance-based join queries in spatial databases
inferred← citeshttps://doi.org/10.1007/s10707-017-0309-yopenalex-snapshot
Efficient large-scale distance-based join queries in spatialhadoop
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.08.051openalex-snapshot
Capacity constrained maximizing bichromatic reverse nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.ins.2015.05.005openalex-snapshot
PROM: Efficient matching query processing on high-dimensional data
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120732openalex-snapshot
Classic distance join queries using compact data structures
inferred← citeshttps://doi.org/10.1016/j.is.2019.101419openalex-snapshot
A top- k spatial join querying processing algorithm based on spark
inferred← citeshttps://doi.org/10.1080/03081079.2023.2173750openalex-snapshot
Efficient distributed algorithms for distance join queries in spark-based spatial analytics systems
inferred← citeshttps://doi.org/10.1109/access.2021.3131229openalex-snapshot
SCP-Tree: Finding Multiple Nearest Parking Spots With Minimal Group Travel Cost
inferred← citeshttps://doi.org/10.1145/1735886.1735888openalex-snapshot
Optimal matching between spatial datasets under capacity constraints
inferred← citeshttps://doi.org/10.14778/1687627.1687746openalex-snapshot
A fair assignment algorithm for multiple preference queries
inferred← citeshttps://doi.org/10.14778/3611479.3611522openalex-snapshot
k-Best Egalitarian Stable Marriages for Task Assignment
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.