Pages that link to "Item:Q906837"
From MaRDI portal
The following pages link to Flip distance between two triangulations of a point set is NP-complete (Q906837):
Displaying 20 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← 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)
- Introduction to reconfiguration (Q2331456) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- (Q5111282) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- (Q6087216) (← links)
- (Q6089671) (← links)
- Galactic token sliding (Q6098154) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- The rotation distance of brooms (Q6201876) (← links)
