scientific article; zbMATH DE number 7204399
From MaRDI portal
Publication:5111282
Recommendations
- An improved FPT algorithm for the flip distance problem
- An improved kernel for the flip distance problem on simple convex polygons
- A combinatorial method to find sharp lower bounds on flip distances
- An improved approximation algorithm for the discrete Fréchet distance
- Improving the smoothed complexity of FLIP for max cut problems
- Improving the Smoothed Complexity of FLIP for Max Cut Problems
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations
- An improved FPT algorithm for independent feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
Cites work
- scientific article; zbMATH DE number 1317748 (Why is no real title available?)
- A lower bound on the number of triangulations of planar point sets
- An improved kernel size for rotation distance in binary trees
- Computational geometry. Algorithms and applications.
- Computing the flip distance between triangulations
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Flip distance between triangulations of a planar point set is APX-hard
- Flip distance between two triangulations of a point set is NP-complete
- Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
- Flipping edges in triangulations
- Modeling contours of trivariate data
- Parameterized algorithms
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Transforming triangulations
- Using nondeterminism to design efficient deterministic algorithms
Cited in
(6)- An improved FPT algorithm for the flip distance problem
- Computing the flip distance between triangulations
- An \(\mathcal{O}(3.82^k)\) time \(\mathcal{FPT}\) algorithm for convex flip distance
- Flip distance between triangulations of a planar point set is APX-hard
- Flip distance between two triangulations of a point set is NP-complete
- Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111282)
