Pages that link to "Item:Q2408209"
From MaRDI portal
The following pages link to Computing the flip distance between triangulations (Q2408209):
Displaying 14 items.
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Transforming plane triangulations by simultaneous diagonal flips (Q2032161) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Kernelization of Whitney Switches (Q4997132) (← links)
- (Q5111282) (← links)
- Orbiting triangle method for convex polygon triangulation (Q5155721) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
- The rotation distance of brooms (Q6201876) (← links)
