[HTML][HTML] A survey of parameterized algorithms and the complexity of edge modification
The survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …
algorithms for graph modification problems. It describes state of the art in kernelization …
[HTML][HTML] Flip distance between two triangulations of a point set is NP-complete
Given two triangulations of a convex polygon, computing the minimum number of flips
required to transform one to the other is a long-standing open problem. It is not known …
required to transform one to the other is a long-standing open problem. It is not known …
[HTML][HTML] Reconfiguration on sparse graphs
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are
feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two …
feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two …
[HTML][HTML] Flip distance between triangulations of a planar point set is APX-hard
A Pilz - Computational Geometry, 2014 - Elsevier
In this work we consider triangulations of point sets in the Euclidean plane, ie, maximal
straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set …
straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set …
Computing the flip distance between triangulations
I Kanj, E Sedgwick, G ** edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the
problem of tracking where particular edges go during the flip** process has not been …
problem of tracking where particular edges go during the flip** process has not been …
[PDF][PDF] On reconfiguration problems: structure and tractability
AE Mouawad - 2015 - academia.edu
Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a
path and computing the length of the shortest path between s and t are two of the most …
path and computing the length of the shortest path between s and t are two of the most …