On the public citation graph
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
0 signed · 44 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-40450-4_2openalex-snapshot
Flip Distance between Triangulations of a Simple Polygon is NP-Complete
inferredcites →https://doi.org/10.1007/bf01078826openalex-snapshot
Subclass of the Steiner problems on a plane with rectilinear metric
inferredcites →https://doi.org/10.1007/bf01758762openalex-snapshot
The rectilinear steiner arborescence problem
inferredcites →https://doi.org/10.1007/s00373-010-0957-2openalex-snapshot
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
inferredcites →https://doi.org/10.1016/0012-365x(72)90093-3openalex-snapshot
Transforming triangulations
inferredcites →https://doi.org/10.1016/0020-0190(82)90083-7openalex-snapshot
A note on some tree similarity measures
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
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.1023/a:1009826311973openalex-snapshot
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/142675.142726openalex-snapshot
A rational rotation method for robust geometric algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4149541openalex-extracted
An Improved Kernel for the Flip Distance Problem on Simple Convex Polygons
inferred← citeshttps://doi.org/10.1002/jgt.22443openalex-snapshot
Eccentricities in the flip‐graphs of convex polygons
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_10openalex-snapshot
Flip Distances Between Graph Orientations
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_13openalex-snapshot
Shortest Reconfiguration of Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_44openalex-snapshot
Complexity Results on Untangling Red-Blue Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_10openalex-snapshot
On the Longest Flip Sequence to Untangle Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_14openalex-snapshot
Computing Diverse and Nice Triangulations
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_13openalex-snapshot
Short Flip Sequences to Untangle Segments in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-017-9867-xopenalex-snapshot
Computing the Flip Distance Between Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-018-0035-8openalex-snapshot
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-023-00596-9openalex-snapshot
An $$\mathcal {O}(3.82^{k})$$ Time $$\textsf {FPT}$$ Algorithm for Convex Flip Distance
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.008openalex-snapshot
Flip distance to some plane configurations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101974openalex-snapshot
Complexity results on untangling red-blue matchings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102277openalex-snapshot
Flip equivalence of ortho-unit polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.029openalex-snapshot
Convex dominating sets in maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.018openalex-snapshot
On flips in planar matchings
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.027openalex-snapshot
Flip paths between lattice triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103877openalex-snapshot
The rotation distance of brooms
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104708openalex-snapshot
An improved FPT algorithm for the flip distance problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106381openalex-snapshot
An improved kernel for the flip distance problem on simple convex polygons
inferred← citeshttps://doi.org/10.1137/20m1364370openalex-snapshot
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
inferred← citeshttps://doi.org/10.2139/ssrn.5481168openalex-snapshot
Untangling Segments in the Plane
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-11openalex-snapshot
The Chromatic Number of the Disjointness Graph of the Double Chain
inferred← citeshttps://doi.org/10.3390/math13233837openalex-snapshot
Bidirectional Algorithms for Polygon Triangulations and (m + 2)-Angulations via Fuss–Catalan Numbers
inferred← citeshttps://doi.org/10.70675/81cccf81zb873z4003za275zb21b3505db2eopenalex-snapshot
Reconfiguration problems in graphs
inferred← citeshttps://doi.org/10.70675/b9a69b41z56efz40ccz814dza2639f67b149openalex-snapshot
Reconfiguration and combinatorial games
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.