On the public citation graph

Diameter partitioning

https://doi.org/10.1007/bf02187699
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.1007/978-1-4613-1881-1_20openalex-snapshot
Space Partitioning and Its Application to Generalized Retrieval Problems
inferredcites →https://doi.org/10.1007/bf01934440openalex-snapshot
Stabbing line segments
inferredcites →https://doi.org/10.1016/0020-0190(81)90111-3openalex-snapshot
Optimal packing and covering in the plane are NP-complete
inferredcites →https://doi.org/10.1016/0020-0190(84)90090-5openalex-snapshot
Non-partitionable point sets
inferredcites →https://doi.org/10.1016/0097-3165(85)90017-2openalex-snapshot
On the number of line separations of a finite set in the plane
inferredcites →https://doi.org/10.1016/0196-6774(82)90018-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1109/sfcs.1984.715939openalex-snapshot
Space Searching For Intersecting Objects
inferredcites →https://doi.org/10.1137/0211012openalex-snapshot
Polygon Retrieval
inferredcites →https://doi.org/10.1142/9789814536370openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1145/800061.808755openalex-snapshot
A 3-space partition and its applications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.2000.1706openalex-snapshot
A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_53openalex-snapshot
Circuit partitioning algorithms: Graph model versus geometry model
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_3openalex-snapshot
Effective Use of Geometric Properties for Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_7openalex-snapshot
New Algorithms for k-Center and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_47openalex-snapshot
Free-Form Surface Partition in 3-D
inferred← citeshttps://doi.org/10.1007/978-3-642-24037-9_55openalex-snapshot
Parameter-Free Minimum Spanning Tree (PFMST) Based Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_19openalex-snapshot
Two-Dimensional Range Diameter Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_7openalex-snapshot
Algorithms for High Dimensional Stabbing Problems
inferred← citeshttps://doi.org/10.1007/bf01840396openalex-snapshot
Computing euclidean maximum spanning trees
inferred← citeshttps://doi.org/10.1007/bf02187911openalex-snapshot
Polyhedral line transversals in space
inferred← citeshttps://doi.org/10.1007/bfb0009480openalex-snapshot
Optimal line bipartitions of point sets
inferred← citeshttps://doi.org/10.1007/bfb0028263openalex-snapshot
Finding optimal bipartitions of points and polygons
inferred← citeshttps://doi.org/10.1007/s10878-009-9226-9openalex-snapshot
New algorithms for k-center and extensions
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90127-xopenalex-snapshot
Algorithms for high dimensional stabbing problems
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90013-oopenalex-snapshot
Finding tailored partitions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00022-4openalex-snapshot
Computing grasp functions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.004openalex-snapshot
Geometric clustering in normed planes
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.033openalex-snapshot
Some clustering algorithms in normed planes
inferred← citeshttps://doi.org/10.1080/01495730108935276openalex-snapshot
EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698325openalex-snapshot
An integrated approach for local outlier detection using dynamic minimum spanning tree
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698329openalex-snapshot
Minimum spanning tree based clustering for outlier detection
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698334openalex-snapshot
Structural similarity micro clustering algorithm for local outliers and hubs using dynamic minimum spanning tree
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698342openalex-snapshot
Meta clusters through minimum spanning tree based clustering for performance analysis of students
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698345openalex-snapshot
A novel dynamic minimum spanning tree based clustering method for image mining
inferred← citeshttps://doi.org/10.1080/09720529.2011.10698357openalex-snapshot
An efficient divisive-agglomerative hierarchical clustering algorithm using minimum spanning tree
inferred← citeshttps://doi.org/10.1109/icpp.1994.101openalex-snapshot
Efficient Parallel Algorithms for Geometric Partitioning Problems through Parallel Range Searching
inferred← citeshttps://doi.org/10.1109/ictai.2006.83openalex-snapshot
Minimum Spanning Tree Based Clustering Algorithms
inferred← citeshttps://doi.org/10.1142/s0218195911003834openalex-snapshot
FREE-FORM SURFACE PARTITION IN 3-D
inferred← citeshttps://doi.org/10.1142/s0218195999000042openalex-snapshot
OPTIMAL LINE BIPARTITIONS OF POINT SETS
inferred← citeshttps://doi.org/10.1142/s0218213011000061openalex-snapshot
CLUSTERING WITH MINIMUM SPANNING TREES
inferred← citeshttps://doi.org/10.1145/327164.327202openalex-snapshot
A unified approach for solving bottleneck k-bipartition problems
inferred← citeshttps://doi.org/10.1145/41958.41990openalex-snapshot
Algorithms for line transversals in space
inferred← citeshttps://doi.org/10.1145/73393.73418openalex-snapshot
Computing Euclidean maximum spanning trees
inferred← citeshttps://doi.org/10.1145/73393.73419openalex-snapshot
Clustering algorithms based on minimum and maximum spanning trees
inferred← citeshttps://doi.org/10.1145/73393.73430openalex-snapshot
Skewed projections with an application to line stabbing in R3
inferred← citeshttps://doi.org/10.1145/73833.73862openalex-snapshot
Finding tailored partitions
inferred← citeshttps://doi.org/10.3390/s20700258openalex-snapshot
Optimal Energy Aware Clustering in Sensor Networks
inferred← citeshttps://doi.org/10.5120/1396-1885openalex-snapshot
Discovering Local Outliers using Dynamic Minimum Spanning Tree with Self-Detection of Best Number of Clusters
inferred← citeshttps://doi.org/10.5120/7341-9721openalex-snapshot
Recuperating Link Structure of Website using MST
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.