scientific article; zbMATH DE number 7204399
From MaRDI portal
Publication:5111282
DOI10.4230/LIPIcs.MFCS.2017.65zbMath1441.68267arXiv1910.06185MaRDI QIDQ5111282
Jianxin Wang, Qilong Feng, Xiangzhong Meng, Shao-hua Li
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1910.06185
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- An improved kernel size for rotation distance in binary trees
- Flip distance between triangulations of a simple polygon is NP-complete
- Flip distance between two triangulations of a point set is NP-complete
- Flipping edges in triangulations
- Using nondeterminism to design efficient deterministic algorithms
- A lower bound on the number of triangulations of planar point sets
- Computing the flip distance between triangulations
- Flip distance between triangulations of a planar point set is APX-hard
- Transforming triangulations
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Flip Distance Is in FPT Time O(n+ k * c^k)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- Modeling contours of trivariate data
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
This page was built for publication:
