On the public citation graph
Transitions in geometric minimum spanning trees
0 signed · 167 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.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01758775openalex-snapshot
A fast algorithm for the generalized parametric minimum cut problem and applications
inferredcites →https://doi.org/10.1007/bf01840396openalex-snapshot
Computing euclidean maximum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90204-4openalex-snapshot
Parametric stable marriage and minimum cuts
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0196-6774(87)90032-0openalex-snapshot
The 1-steiner tree problem
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot
New upper bounds for neighbor searching
inferredcites →https://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
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/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1145/2402.322391openalex-snapshot
Parametric Combinatorial Computing and a Problem of Program Module Distribution
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/3828.3829openalex-snapshot
Optimal attack and reinforcement of a network
inferredcites →https://doi.org/10.1145/73393.73419openalex-snapshot
Clustering algorithms based on minimum and maximum spanning trees
inferredcites →https://doi.org/10.1201/9781351236423-26openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization *
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
inferredcites →https://doi.org/10.1287/opre.26.3.422openalex-snapshot
A Cut Approach to the Rectilinear Distance Facility Location Problem
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.1002/net.21449openalex-snapshot
Succinct greedy drawings do not always exist
inferred← citeshttps://doi.org/10.1002/net.21710openalex-snapshot
Minimum bottleneck spanning trees with degree bounds
inferred← citeshttps://doi.org/10.1006/jagm.1995.1028openalex-snapshot
Growing a Tree from Its Branches
inferred← citeshttps://doi.org/10.1006/jagm.1997.0862openalex-snapshot
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
inferred← citeshttps://doi.org/10.1007/0-387-29026-5_2openalex-snapshot
Topology Control in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1007/11561354_3openalex-snapshot
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/11596448_97openalex-snapshot
An Ant Colony Optimization Approach to the Degree-Constrained Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/11922377_4openalex-snapshot
On the Topologies of Local Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_32openalex-snapshot
Minimum Weight Drawings of Maximal Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_11openalex-snapshot
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_14openalex-snapshot
Triangulations without Minimum-Weight Drawing
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_162openalex-snapshot
Every set of disjoint line segments admits a binary tree
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_388openalex-snapshot
Proximity drawability: A survey extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_389openalex-snapshot
Proximity constraints and representable trees (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_66openalex-snapshot
Computing proximity drawings of trees in the 3-dimensional space
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_9openalex-snapshot
A network-flow technique for finding low-weight bounded-degree spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_67openalex-snapshot
Area requirement of Gabriel drawings (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_45openalex-snapshot
Drawable and forbidden minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_47openalex-snapshot
On embedding an outer-planar graph in a point set
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_6openalex-snapshot
Maximum Weight Triangulation and Its Application on Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-1-4020-9688-4_9openalex-snapshot
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_36openalex-snapshot
On the Restricted 1-Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_10openalex-snapshot
A 4-Approximation of the $$\frac{2\pi }{3}$$-MST
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_2openalex-snapshot
The Minimum Moving Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_4openalex-snapshot
Steiner Trees with Other Cost Functions and Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_58openalex-snapshot
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_68openalex-snapshot
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_41openalex-snapshot
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_12openalex-snapshot
Polynomial Area Bounds for MST Embeddings of Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_14openalex-snapshot
On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_19openalex-snapshot
Narrow-Shallow-Low-Light Trees with and without Steiner Points
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_17openalex-snapshot
Succinct Greedy Drawings Do Not Always Exist
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_3openalex-snapshot
Maintaining Connectivity in Sensor Networks Using Directional Antennae
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_6openalex-snapshot
Drawing a Tree as a Minimum Spanning Tree Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_3openalex-snapshot
On the Area Requirements of Euclidean Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_12openalex-snapshot
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_39openalex-snapshot
Increasing-Chord Graphs On Point Sets
inferred← citeshttps://doi.org/10.1007/bf02574035openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferred← citeshttps://doi.org/10.1007/bfb0021791openalex-snapshot
Optimal algorithms to embed trees in a point set
inferred← citeshttps://doi.org/10.1007/bfb0021821openalex-snapshot
How to draw outerplanar minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/bfb0049415openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
inferred← citeshttps://doi.org/10.1007/s00453-001-0038-2openalex-snapshot
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
inferred← citeshttps://doi.org/10.1007/s00453-013-9780-5openalex-snapshot
Generalised k-Steiner Tree Problems in Normed Planes
inferred← citeshttps://doi.org/10.1007/s00453-021-00889-6openalex-snapshot
Bounded-Angle Minimum Spanning Trees
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/s00454-001-0042-yopenalex-snapshot
Every Set of Disjoint Line Segments Admits a Binary Tree
inferred← citeshttps://doi.org/10.1007/s00454-004-1117-3openalex-snapshot
Euclidean Bounded-Degree Spanning Tree Ratios
inferred← citeshttps://doi.org/10.1007/s00454-013-9566-1openalex-snapshot
On Improved Bounds for Bounded Degree Spanning Trees for Points in Arbitrary Dimension
inferred← citeshttps://doi.org/10.1007/s00454-021-00286-4openalex-snapshot
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
inferred← citeshttps://doi.org/10.1007/s00454-022-00398-5openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/s10732-014-9250-5openalex-snapshot
Improved structures for data collection in static and mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10878-019-00490-2openalex-snapshot
Degree bounded bottleneck spanning trees in three dimensions
inferred← citeshttps://doi.org/10.1007/s10878-021-00808-zopenalex-snapshot
On the restricted k-Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s10878-023-01031-8openalex-snapshot
Improved algorithms in directional wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10898-022-01163-xopenalex-snapshot
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s11227-012-0851-1openalex-snapshot
Degree constrained minimum spanning tree problem: a learning automata approach
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00012-9openalex-snapshot
Drawing outerplanar minimum weight triangulations
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00028-3openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.03.015openalex-snapshot
Proximity drawings in polynomial area and volume
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.002openalex-snapshot
Relay placement for fault tolerance in wireless networks in higher dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.01.001openalex-snapshot
Witness (Delaunay) graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.05.005openalex-snapshot
Polynomial area bounds for MST embeddings of trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.011openalex-snapshot
On the area requirements of Euclidean minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.005openalex-snapshot
Approximating the bottleneck plane perfect matching of a point set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.009openalex-snapshot
Strong matching of points with geometric shapes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101914openalex-snapshot
A 4-approximation of the 2π3 -MST
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102010openalex-snapshot
Cut locus realizations on convex polyhedra
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102172openalex-snapshot
Approximating average bounded-angle minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.06.013openalex-snapshot
Adaptive design optimization of wireless sensor networks using genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2005.06.011openalex-snapshot
Using Lagrangian dual information to generate degree constrained spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.037openalex-snapshot
Degree-bounded minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106035openalex-snapshot
Drawing a rooted tree as a rooted y−monotone minimum spanning tree
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.06.001openalex-snapshot
Drawing a tree as a minimum spanning tree approximation
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.019openalex-snapshot
Degree-bounded minimum spanning tree for unit disk graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00067-3openalex-snapshot
Triangulations without minimum-weight drawing
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00107-6openalex-snapshot
Structural tolerance and Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00383-2openalex-snapshot
The drawability problem for minimum weight triangulations
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00069-4openalex-snapshot
On embedding an outer-planar graph in a point set
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00137-2openalex-snapshot
Voronoi drawings of trees
inferred← citeshttps://doi.org/10.1016/s1388-3437(03)80250-0openalex-snapshot
Forming connected topologies in bluetooth ad-hoc networks—An algorithmic perspective
inferred← citeshttps://doi.org/10.1017/s0004972719001126openalex-snapshot
DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION
inferred← citeshttps://doi.org/10.1023/a:1009741021887openalex-snapshot
Sorting Spatial Data for Sampling and Other Geographic Applications
inferred← citeshttps://doi.org/10.1080/01969722.2012.637012openalex-snapshot
DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
inferred← citeshttps://doi.org/10.1109/4235.850653openalex-snapshot
A new evolutionary approach to the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1109/43.329264openalex-snapshot
Closing the gap: near-optimal Steiner trees in polynomial time
inferred← citeshttps://doi.org/10.1109/access.2024.3472282openalex-snapshot
A 1.5-Approximation for Symmetric Euclidean Open Loop TSP
inferred← citeshttps://doi.org/10.1109/acct.2015.9openalex-snapshot
Optimization of Topology Update Interval for k-Connected MANETs
inferred← citeshttps://doi.org/10.1109/cec.2000.870282openalex-snapshot
An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1109/indicon45594.2018.8987027openalex-snapshot
Improved Algorithm for Minimum Power 2-Connected Subgraph Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209193openalex-snapshot
Design and analysis of an MST-based topology control algorithm
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354497openalex-snapshot
Topology control in heterogeneous wireless networks: problems and solutions
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934997openalex-snapshot
A novel family of geometric planar graphs for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.273openalex-snapshot
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848071openalex-snapshot
Improved structures for data collection in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229093openalex-snapshot
Target Coverage and Connectivity in Directional Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iscit.2007.4392153openalex-snapshot
Energy efficient routing for achieving shorter latency in sensor networks
inferred← citeshttps://doi.org/10.1109/jsac.2004.842544openalex-snapshot
Can Bluetooth succeed as a large-scale ad hoc networking technology?
inferred← citeshttps://doi.org/10.1109/mass.2003.1194836openalex-snapshot
Towards optimal I/O scheduling for MEMS-based storage
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267750openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferred← citeshttps://doi.org/10.1109/tevc.2002.807275openalex-snapshot
Edge sets: an effective evolutionary coding of spanning trees
inferred← citeshttps://doi.org/10.1109/tnet.2005.860095openalex-snapshot
Localized topology control algorithms for heterogeneous wireless networks
inferred← citeshttps://doi.org/10.1109/tpds.2012.180openalex-snapshot
Hypocomb: Bounded-Degree Localized Geometric Planar Graphs for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/twc.2005.846971openalex-snapshot
Design and analysis of an MST-based topology control algorithm
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00830.xopenalex-snapshot
Min‐degree constrained minimum spanning tree problem: complexity, properties, and formulations
inferred← citeshttps://doi.org/10.1137/090746495openalex-snapshot
Degree Bounded Network Design with Metric Costs
inferred← citeshttps://doi.org/10.1137/090776147openalex-snapshot
Narrow-Shallow-Low-Light Trees with and without Steiner Points
inferred← citeshttps://doi.org/10.1137/s0097539794264585openalex-snapshot
Low-Degree Spanning Trees of Small Weight
inferred← citeshttps://doi.org/10.1142/s0218195912500112openalex-snapshot
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
inferred← citeshttps://doi.org/10.1142/s0218195912500161openalex-snapshot
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
inferred← citeshttps://doi.org/10.1142/s0218195913500088openalex-snapshot
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES
inferred← citeshttps://doi.org/10.1142/s0218195919500031openalex-snapshot
Algorithms for Euclidean Degree Bounded Spanning Tree Problems
inferred← citeshttps://doi.org/10.1145/109648.109675openalex-snapshot
Transitions in geometric minimum spanning trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/1103963.1103967openalex-snapshot
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
inferred← citeshttps://doi.org/10.1145/1143549.1143774openalex-snapshot
Heuristic algorithms for real-time data aggregation in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1400863.1400877openalex-snapshot
Symmetric range assignment with disjoint MST constraints
inferred← citeshttps://doi.org/10.1145/1542362.1542399openalex-snapshot
The Euclidean degree-4 minimum spanning tree problem is NP-hard
inferred← citeshttps://doi.org/10.1145/195058.195212openalex-snapshot
Low degree spanning trees of small weight
inferred← citeshttps://doi.org/10.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.1145/335603.335888openalex-snapshot
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1145/777792.777795openalex-snapshot
Euclidean bounded-degree spanning tree ratios
inferred← citeshttps://doi.org/10.1504/ijcnds.2011.037329openalex-snapshot
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks
inferred← citeshttps://doi.org/10.20868/upm.thesis.10100openalex-snapshot
Tolerancia de Estructuras Geométricas y Combinatorias
inferred← citeshttps://doi.org/10.21236/ada455438openalex-snapshot
Relay Placement Approximation Algorithms for k-Connectivity in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.22215/etd/2011-09706openalex-snapshot
Connectivity of wireless sensor networks using directional antennae
inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot
Matchings in Geometric Graphs
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.3745/kipsta.2009.16a.6.509openalex-snapshot
Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges
inferred← citeshttps://doi.org/10.48550/arxiv.1311.5197openalex-snapshot
Approximating the Bottleneck Plane Perfect Matching of a Point Set
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot
A Survey on Small-Area Planar Graph Drawing
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06752openalex-snapshot
Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem
inferred← citeshttps://doi.org/10.7155/jgaa.00002openalex-snapshot
Optimal Algorithms to Embed Trees in a Point Set
inferred← citeshttps://doi.org/10.7155/jgaa.00348openalex-snapshot
Increasing-Chord Graphs On Point Sets
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.