Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
Accurate prediction of pseudoknotted nucleic acid secondary structure is an important computational challenge. Prediction algorithms based on dynamic programming aim to find a st...
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...