scientific article; zbMATH DE number 7204399
From MaRDI portal
Publication:5111282
DOI10.4230/LIPICS.MFCS.2017.65zbMATH Open1441.68267arXiv1910.06185MaRDI QIDQ5111282FDOQ5111282
Authors: Qilong Feng, Xiangzhong Meng, Jianxin Wang, Shao-Hua Li 
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1910.06185
Title of this publication is not available (Why is that?)
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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Flipping edges in triangulations
- Subset feedback vertex set is fixed-parameter tractable
- Computational geometry. Algorithms and applications.
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized algorithms
- Title not available (Why is that?)
- A lower bound on the number of triangulations of planar point sets
- Transforming triangulations
- Using nondeterminism to design efficient deterministic algorithms
- An improved kernel size for rotation distance in binary trees
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
- Flip distance between two triangulations of a point set is NP-complete
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Flip distance between triangulations of a planar point set is APX-hard
- Flip distance between triangulations of a simple polygon is NP-complete
- Computing the flip distance between triangulations
- Modeling contours of trivariate data
Cited In (6)
- Flip distance between two triangulations of a point set is NP-complete
- Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
- An \(\mathcal{O}(3.82^k)\) time \(\mathcal{FPT}\) algorithm for convex flip distance
- An improved FPT algorithm for the flip distance problem
- Flip distance between triangulations of a planar point set is APX-hard
- Computing the flip distance between triangulations
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)
