The following pages link to Günter Rote (Q170472):
Displaying 50 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems (Q376287) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Reprint of: Optimally solving a transportation problem using Voronoi diagrams (Q390172) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- Formulae and growth rates of high-dimensional polycubes (Q555508) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Lines pinning lines (Q629835) (← links)
- Shortest paths for line segments (Q686741) (← links)
- Simple and optimal output-sensitive construction of contour trees using monotone paths (Q705555) (← links)
- On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs (Q731372) (← links)
- Threshold arrangements and the knapsack problem (Q812753) (← links)
- Strictly convex drawings of planar graphs (Q863697) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- Computing the Fréchet distance between piecewise smooth curves (Q883235) (← links)
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs (Q934021) (← links)
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion) (Q1057068) (← links)
- Computing the minimum Hausdorff distance between two point sets on a line under translation (Q1178208) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- Constant-level greedy triangulations approximate the MWT well (Q1288473) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Sequences with subword complexity \(2n\) (Q1320503) (← links)
- The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Binary trees having a given number of nodes with 0, 1, and 2 children (Q1380714) (← links)
- Matching convex shapes with respect to the symmetric difference (Q1386463) (← links)
- Approximation of convex figures by pairs of rectangles (Q1388135) (← links)
- Finding a shortest vector in a two-dimensional lattice modulo m (Q1392031) (← links)
- Straightening polygonal arcs and convexifying polygonal cycles (Q1423583) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Point sets with many non-crossing perfect matchings (Q1699275) (← links)
- Optimal triangulation of saddle surfaces (Q1702150) (← links)
- Convex equipartitions of colored point sets (Q1716003) (← links)
- Non-crossing frameworks with non-crossing reciprocals (Q1764166) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- (Q1816459) (redirect page) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
