Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
A heuristic triangulation algorithm
Journal of Algorithms
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A Branch-and-Cut Approach for Minimum Weight Triangulation
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the number of crossing-free matchings, (cycles, and partitions)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
A fixed parameter algorithm for the minimum number convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Minimum weight triangulation by cutting out triangles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The traveling salesman problem with few inner points
Operations Research Letters
Parameterized Complexity
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability for non-crossing spanning trees
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a fixed-parameter algorithm which computes for a set P of n points in the plane in time a minimum weight triangulation. The parameter k is the number of points in P that lie in the interior of the convex hull of P and .