On the public citation graph
Fdc: Optimal Fully Dynamic Clustering Algorithm
0 signed · 31 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/0471725382openalex-snapshot
Robust Regression and Outlier Detection
inferredcites →https://doi.org/10.1006/jcom.2001.0633openalex-snapshot
The New k-Windows Algorithm for Improving thek -Means Clustering Algorithm
inferredcites →https://doi.org/10.1007/978-3-031-26212-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24669-5_29openalex-snapshot
Parallelizing the Unsupervised k-Windows Clustering Algorithm
inferredcites →https://doi.org/10.1007/s10472-023-09882-xopenalex-snapshot
kNN Classification: a review
inferredcites →https://doi.org/10.1007/s41870-024-02174-5openalex-snapshot
Dynamic clustering based on Minkowski similarity for web services aggregation
inferredcites →https://doi.org/10.1016/j.psychres.2023.115265openalex-snapshot
An overview of clustering methods with guidelines for application in mental health research
inferredcites →https://doi.org/10.1016/s0304-3975(01)00239-0openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions
inferredcites →https://doi.org/10.1016/s0306-4379(01)00008-4openalex-snapshot
Cure: an efficient clustering algorithm for large databases
inferredcites →https://doi.org/10.1023/b:aire.0000045502.10941.a9openalex-snapshot
A Survey of Outlier Detection Methodologies
inferredcites →https://doi.org/10.1051/0004-6361/201219881openalex-snapshot
Modes of clustered star formation
inferredcites →https://doi.org/10.1080/00401706.1969.10490657openalex-snapshot
Procedures for Detecting Outlying Observations in Samples
inferredcites →https://doi.org/10.1109/icmla.2016.0099openalex-snapshot
A Novel Algorithm for Dynamic Clustering: Properties and Performance
inferredcites →https://doi.org/10.1109/tai.2002.1180810openalex-snapshot
Improving the orthogonal range search k-windows algorithm
inferredcites →https://doi.org/10.1109/tkde.2008.158openalex-snapshot
Automatically Determining the Number of Clusters in Unlabeled Data Sets
inferredcites →https://doi.org/10.1134/s1054661806020015openalex-snapshot
Estimating the number of clusters using a windowing technique
inferredcites →https://doi.org/10.1137/1.9781611977554.ch101openalex-snapshot
Optimal Fully Dynamic k -Center Clustering for Adaptive and Oblivious Adversaries
inferredcites →https://doi.org/10.1137/1.9781611977912.124openalex-snapshot
Fully Dynamic Consistent k -Center Clustering
inferredcites →https://doi.org/10.1142/s021812740601591xopenalex-snapshot
UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION
inferredcites →https://doi.org/10.1142/s0218127410028197openalex-snapshot
OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
inferredcites →https://doi.org/10.1145/3490384openalex-snapshot
Experimental Comparisons of Clustering Approaches for Data Representation
inferredcites →https://doi.org/10.1145/50063.214384openalex-snapshot
Solving systems of nonlinear equations using the nonzero value of the topological degree
inferredcites →https://doi.org/10.3389/fncom.2019.00031openalex-snapshot
The Application of Unsupervised Clustering Methods to Alzheimer’s Disease
inferredcites →https://doi.org/10.3390/e24070917openalex-snapshot
How the Outliers Influence the Quality of Clustering?
inferredcites →https://doi.org/10.48550/arxiv.1908.02645openalex-snapshot
Fully dynamic hierarchical diameter k-clustering and k-center
inferredcites →https://doi.org/10.48550/arxiv.2401.03232openalex-snapshot
Generalization of the Apollonius theorem for simplices and related problems
inferredcites →https://doi.org/10.48550/arxiv.2402.06629openalex-snapshot
Towards the mathematical foundation of the minimum enclosing ball and related problems
inferredcites →https://doi.org/10.48550/arxiv.2410.11063openalex-snapshot
Towards the methodology for solving the minimum enclosing ball and related problems
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.