On the public citation graph

Euclidean minimum spanning trees and bichromatic closest pairs

https://doi.org/10.1007/bf02574698
0 signed · 162 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/3-540-51542-9_2openalex-snapshot
Efficient spatial point location
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01587088openalex-snapshot
A randomized algorithm for fixed-dimensional linear programming
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715941openalex-snapshot
A Fast Approximation Algorithm For Minimum Spanning Trees In K-Dimensional Space
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
inferredcites →https://doi.org/10.1145/800057.808699openalex-snapshot
Fast expected-time and approximation algorithms for geometric minimum spanning trees
inferredcites →https://doi.org/10.1145/98524.98567openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferredcites →https://doi.org/10.1145/98524.98570openalex-snapshot
Linear programming and convex hulls made easy
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44676-1_23openalex-snapshot
Smallest Color-Spanning Objects
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_5openalex-snapshot
Geometric Algorithms for Agglomerative Hierarchical Clustering
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_38openalex-snapshot
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_5openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_26openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_15openalex-snapshot
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-06222-4_4openalex-snapshot
An Introduction to Proximity Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_18openalex-snapshot
On Two Simple[st] Learning Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_14openalex-snapshot
An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_6openalex-snapshot
Plane Bichromatic Trees of Low Degree
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_44openalex-snapshot
Minimum Spanning Tree of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_28openalex-snapshot
Spanners for Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_41openalex-snapshot
Geometric Minimum Spanning Trees with GeoFilterKruskal
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_10openalex-snapshot
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_236-2openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-33460-3_31openalex-snapshot
Graph Mining for Object Tracking in Videos
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_38openalex-snapshot
MapSets: Visualizing Embedded and Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_9openalex-snapshot
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
inferred← citeshttps://doi.org/10.1007/978-981-92-5696-9_45openalex-snapshot
$$\rho $$-Approximate Continuous DBSCAN-Based Clustering Over High Speed Streaming Data
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_26openalex-snapshot
On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf02293052openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02574030openalex-snapshot
Dynamic Euclidean minimum spanning trees and extrema of binary functions
inferred← citeshttps://doi.org/10.1007/pl00009390openalex-snapshot
Approximate Nearest Neighbor Queries Revisited
inferred← citeshttps://doi.org/10.1007/s00453-023-01200-5openalex-snapshot
Connectivity with Uncertainty Regions Given as Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-024-01257-wopenalex-snapshot
On a Traveling Salesman Problem for Points in the Unit Cube
inferred← citeshttps://doi.org/10.1007/s00454-001-0029-8openalex-snapshot
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-017-9881-zopenalex-snapshot
Plane Bichromatic Trees of Low Degree
inferred← citeshttps://doi.org/10.1007/s00454-023-00621-xopenalex-snapshot
Dynamic Connectivity in Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00778-012-0266-xopenalex-snapshot
Spatial query processing for fuzzy objects
inferred← citeshttps://doi.org/10.1007/s10878-019-00490-2openalex-snapshot
Degree bounded bottleneck spanning trees in three dimensions
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90055-1openalex-snapshot
On the Steiner ratio in 3-space
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90001-9openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90017-mopenalex-snapshot
Relative neighborhood graphs in three dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.10.046openalex-snapshot
GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.04.005openalex-snapshot
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.004openalex-snapshot
Connected dominating sets on dynamic geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.11.001openalex-snapshot
Kinetic k-Semi-Yao graph and its applications
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.006openalex-snapshot
Colored spanning graphs for set visualization
inferred← citeshttps://doi.org/10.1016/j.cor.2018.05.007openalex-snapshot
A new approach for the multiobjective minimum spanning tree
inferred← citeshttps://doi.org/10.1016/j.cub.2016.07.049openalex-snapshot
A-type Lamins Form Distinct Filamentous Networks with Differential Nuclear Pore Complex Associations
inferred← citeshttps://doi.org/10.1016/j.datak.2004.08.003openalex-snapshot
An approximate algorithm for top-k closest pairs join query in large high dimensional data
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.07.003openalex-snapshot
On the symmetric angle-restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.021openalex-snapshot
Minimizing interference in ad hoc networks with bounded communication radius
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.10.003openalex-snapshot
Bottleneck bichromatic full Steiner trees
inferred← citeshttps://doi.org/10.1016/j.jda.2008.08.001openalex-snapshot
Planar bichromatic minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.06.005openalex-snapshot
HY-DBSCAN: A hybrid parallel DBSCAN clustering algorithm scalable on distributed-memory computers
inferred← citeshttps://doi.org/10.1016/j.patcog.2020.107624openalex-snapshot
BLOCK-DBSCAN: Fast clustering for large scale data
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00064-9openalex-snapshot
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00030-xopenalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1089/cmb.2012.0280openalex-snapshot
A Geometric Interpretation for Local Alignment-Free Sequence Comparison
inferred← citeshttps://doi.org/10.1109/icdm.2009.68openalex-snapshot
A Tree-Based Framework for Difference Summarization
inferred← citeshttps://doi.org/10.1109/icpr.2010.474openalex-snapshot
Fast Seamless Skew and Orientation Detection in Document Images
inferred← citeshttps://doi.org/10.1109/ieem.2012.6837725openalex-snapshot
Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: Imperialist Competitive algorithm (ICA)
inferred← citeshttps://doi.org/10.1109/ipdps.2011.41openalex-snapshot
Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae
inferred← citeshttps://doi.org/10.1109/iros.2012.6386226openalex-snapshot
Communication coverage for independently moving robots
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646145openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1109/vast.2012.6400490openalex-snapshot
Visual pattern discovery using random projections
inferred← citeshttps://doi.org/10.1134/s000143462560276xopenalex-snapshot
Efficient Search for a Minimum Tree in a Space with the $$l_1$$-Norm
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch85openalex-snapshot
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977066.6openalex-snapshot
Finding Relevant Points for Nearest-Neighbor Classification
inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/110825698openalex-snapshot
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
inferred← citeshttps://doi.org/10.1137/s0097539703435297openalex-snapshot
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
inferred← citeshttps://doi.org/10.1137/s0097539703436357openalex-snapshot
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
inferred← citeshttps://doi.org/10.1142/s0218195919400028openalex-snapshot
Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces
inferred← citeshttps://doi.org/10.1145/109648.109663openalex-snapshot
Dynamic point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/129712.129766openalex-snapshot
A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)
inferred← citeshttps://doi.org/10.1145/130069.130122openalex-snapshot
Approximate submatrix matching problems
inferred← citeshttps://doi.org/10.1145/130956.130957openalex-snapshot
Computational geometry
inferred← citeshttps://doi.org/10.1145/142675.142702openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1145/142675.142734openalex-snapshot
Ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1145/1497290.1497291openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.1145/1835804.1835882openalex-snapshot
Fast euclidean minimum spanning tree
inferred← citeshttps://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.1145/262839.263001openalex-snapshot
Approximate nearest neighbor queries revisited
inferred← citeshttps://doi.org/10.1145/2723372.2737792openalex-snapshot
DBSCAN Revisited
inferred← citeshttps://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferred← citeshttps://doi.org/10.1145/304893.304992openalex-snapshot
Approximation and exact algorithms for minimum-width annuli and shells
inferred← citeshttps://doi.org/10.1145/3068335openalex-snapshot
DBSCAN Revisited, Revisited
inferred← citeshttps://doi.org/10.1145/3083897openalex-snapshot
On the Hardness and Approximation of Euclidean DBSCAN
inferred← citeshttps://doi.org/10.1145/336154.336215openalex-snapshot
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
inferred← citeshttps://doi.org/10.1145/3448016.3457296openalex-snapshot
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1145/500559.500562openalex-snapshot
Computational geometry
inferred← citeshttps://doi.org/10.1145/513400.513419openalex-snapshot
The Delaunay tetrahedralization from Delaunay triangulated surfaces
inferred← citeshttps://doi.org/10.1145/780542.780613openalex-snapshot
Well-separated pair decomposition for the unit-disk graph metric and its applications
inferred← citeshttps://doi.org/10.1145/945394.945400openalex-snapshot
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
inferred← citeshttps://doi.org/10.1155/2014/764698openalex-snapshot
A Scale-Free Topology Construction Model for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1162/evco_a_00106openalex-snapshot
ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization
inferred← citeshttps://doi.org/10.1201/9781584888215-c2openalex-snapshot
Computational Geometry II
inferred← citeshttps://doi.org/10.12681/jode.9797openalex-snapshot
Υπολογιστική προσέγγιση της εξέλιξης καρκινικών όγκων
inferred← citeshttps://doi.org/10.14778/1454159.1454185openalex-snapshot
SEDA
inferred← citeshttps://doi.org/10.17169/refubium-41977openalex-snapshot
Dynamic Connectivity in Disk Graphs
inferred← citeshttps://doi.org/10.17863/cam.43395openalex-snapshot
The xyz algorithm for fast interaction search in high-dimensional data
inferred← citeshttps://doi.org/10.20382/jocg.v3i1a3openalex-snapshot
Spanners for geometric intersection graphs with applications
inferred← citeshttps://doi.org/10.22215/etd/2011-09706openalex-snapshot
Connectivity of wireless sensor networks using directional antennae
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a004openalex-snapshot
inferred← citeshttps://doi.org/10.4213/mzm14366openalex-snapshot
Эффективный поиск минимального дерева на точках пространства в $l_1$-норме
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.47openalex-snapshot
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.30openalex-snapshot
Distributed Distance Approximation
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2020.9openalex-snapshot
On the Quantum Complexity of Closest Pair and Related Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2785openalex-snapshot
Minimizing interference in ad-hoc networks with bounded communication radius
inferred← citeshttps://doi.org/10.48550/arxiv.1603.00580openalex-snapshot
Colored Spanning Graphs for Set Visualization
inferred← citeshttps://doi.org/10.48550/arxiv.1907.08414openalex-snapshot
Reluctant Interaction Modeling
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/2133036.2133171openalex-snapshot
Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
inferred← citeshttps://doi.org/10.5555/313559.313777openalex-snapshot
Faster algorithms for some geometric graph problems in higher dimensions
inferred← citeshttps://doi.org/10.5555/313651.313705openalex-snapshot
Algorithms for dynamic closest pair and n-body potential fields
inferred← citeshttps://doi.org/10.5555/314464.314481openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5555/642160.642165openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.5555/644108.644242openalex-snapshot
Sublinear-time approximation of Euclidean minimum spanning tree
inferred← citeshttps://doi.org/10.5555/982792.982921openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.70675/77be6784zcba8z4c5dz8f9dz45401362ba40openalex-snapshot
Graph mining for object tracking in videos
inferred← citeshttps://doi.org/10.70675/c90dca1dz15fdz4689za42dz2942fdcdb810openalex-snapshot
GPU component-based neighborhood search for Euclidean graph minimization problems
inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.7155/jgaa.00364openalex-snapshot
MapSets: Visualizing Embedded and Clustered Graphs
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.