A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set
S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of …

Research on parameterized algorithmics for NP-hard problems has steadily grown over the
last years. We survey and discuss how parameterized complexity analysis naturally …

We study the General Position Subset Selection problem: Given a set of points in the plane,
find a maximum-cardinality subset of points in general position. We prove that General …

We propose two algorithms for the planar Euclidean traveling salesman problem. The first
runs in O (k! kn) time and O (k) space, and the second runs in O (2kk2n) time and O (2kkn) …

We study the traveling salesman problem (TSP) in the 2-dimensional Euclidean plane. The
problem is NP-hard in general, but trivial if the points are in convex position. In this paper …

We consider the problem of computing non-crossing spanning trees in topological graphs. It
is known that it is NP-hard to decide whether a topological graph has a non-crossing …

This thesis is concerned with analyzing the computational complexity of NP-hard problems
related to data science. For most of the problems considered in this thesis, the computational …

LNCS 4271 - A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem
Based on Small Graph Separators Page 1 A Fixed-Parameter Algorithm for the Minimum …

Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor
approximation algorithm, and a variety of effective polynomial-time heuristics that, for many …

We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum
Weight Convex Partition problem. The algorithm is based on techniques developed for the …