On the public citation graph
A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets
0 signed · 30 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/net.3230070104openalex-snapshot
Rectilinear steiner trees: Efficient special‐case algorithms
inferredcites →https://doi.org/10.1002/net.3230180108openalex-snapshot
Convexity and the Steiner tree problem
inferredcites →https://doi.org/10.1002/net.3230200110openalex-snapshot
Faster exact algorithms for steiner trees in planar networks
inferredcites →https://doi.org/10.1002/net.3230200407openalex-snapshot
Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
inferredcites →https://doi.org/10.1007/bf01933620openalex-snapshot
On the X-Y convex hull of a set of X-Y polygons
inferredcites →https://doi.org/10.1109/43.45871openalex-snapshot
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle
inferredcites →https://doi.org/10.1137/0114025openalex-snapshot
On Steiner’s Problem with Rectilinear Distance
inferredcites →https://doi.org/10.1137/0130013openalex-snapshot
On Steiner Minimal Trees with Rectilinear Distance
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199903)33:2<125::aid-net4>3.0.co;2-sopenalex-snapshot
Rectilinear full Steiner tree generation
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199903)33:2<145::aid-net5>3.0.co;2-nopenalex-snapshot
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
inferred← citeshttps://doi.org/10.1002/net.3230250206openalex-snapshot
Thirty‐five‐point rectilinear steiner minimal trees in a day
inferred← citeshttps://doi.org/10.1006/eujc.2001.0561openalex-snapshot
Planar Manhattan Local Minimal and Critical Networks
inferred← citeshttps://doi.org/10.1006/jcss.1997.1513openalex-snapshot
The Steiner Tree Problem in Orientation Metrics
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_284openalex-snapshot
Optimal rectilinear steiner tree for extremal point sets
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_199openalex-snapshot
On Steiner minimal trees in grid graphs and its application to VLSI routing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_13openalex-snapshot
Polynomial Time Algorithms for the Rectilinear Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_8openalex-snapshot
Exact Steiner Trees in Graphs and Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_3openalex-snapshot
Rectilinear Steiner Trees
inferred← citeshttps://doi.org/10.1007/bfb0015438openalex-snapshot
A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00171-6openalex-snapshot
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
inferred← citeshttps://doi.org/10.1016/s0893-9659(02)00053-8openalex-snapshot
Steiner's problem in double trees
inferred← citeshttps://doi.org/10.1023/b:joth.0000008741.99645.42openalex-snapshot
Planar Manhattan Locally Minimal and Critical Networks
inferred← citeshttps://doi.org/10.1070/im2002v066n05abeh000402openalex-snapshot
Branching geodesics in normed spaces
inferred← citeshttps://doi.org/10.1109/81.153636openalex-snapshot
An algorithm for exact rectilinear Steiner trees for switchbox with obstacles
inferred← citeshttps://doi.org/10.1109/iscas.2000.857061openalex-snapshot
A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon
inferred← citeshttps://doi.org/10.4213/im402openalex-snapshot
Разветвленные геодезические в нормированных пространствах
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.