On the public citation graph

Untangling Segments in the Plane

https://doi.org/10.2139/ssrn.5481168
0 signed · 21 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-3-030-26176-4_10openalex-snapshot
Approximation Hardness of Travelling Salesman via Weighted Amplifiers
inferredcites →https://doi.org/10.1007/978-3-031-27051-2_5openalex-snapshot
Flipping Plane Spanning Paths
inferredcites →https://doi.org/10.1007/978-3-540-89550-3_3openalex-snapshot
Transforming Graphs with the Same Degree Sequence
inferredcites →https://doi.org/10.1007/978-981-97-0566-5_13openalex-snapshot
Short Flip Sequences to Untangle Segments in the Plane
inferredcites →https://doi.org/10.1007/pl00009464openalex-snapshot
Flipping Edges in Triangulations
inferredcites →https://doi.org/10.1007/s00453-013-9801-4openalex-snapshot
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
inferredcites →https://doi.org/10.1007/s00454-015-9709-7openalex-snapshot
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
inferredcites →https://doi.org/10.1016/0012-365x(72)90093-3openalex-snapshot
Transforming triangulations
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.1016/j.comgeo.2014.01.001openalex-snapshot
Flip distance between triangulations of a planar point set is APX-hard
inferredcites →https://doi.org/10.1016/j.comgeo.2014.11.001openalex-snapshot
Flip distance between two triangulations of a point set is NP-complete
inferredcites →https://doi.org/10.1016/j.comgeo.2019.01.008openalex-snapshot
Flip distance to some plane configurations
inferredcites →https://doi.org/10.1016/j.ipl.2007.05.009openalex-snapshot
On planar path transformation
inferredcites →https://doi.org/10.1016/j.ipl.2008.12.017openalex-snapshot
On the diameter of geometric path graphs of points in convex position
inferredcites →https://doi.org/10.1017/s0963548313000096openalex-snapshot
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
inferredcites →https://doi.org/10.1080/0025570x.1973.11976293openalex-snapshot
Polygons in Arrangements Generated by n Points
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
inferredcites →https://doi.org/10.1137/0111010openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
inferredcites →https://doi.org/10.1137/s0097539796309764openalex-snapshot
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems
inferredcites →https://doi.org/10.1137/s0895480197331156openalex-snapshot
Switching Distance Between Graphs with the Same Degrees
inferredcites →https://doi.org/10.2197/ipsjjip.25.627openalex-snapshot
Transforming Graphs with the Same Graphic Sequence
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.