The following pages link to Günter Rote (Q170472):
Displaying 50 items.
- (Q3336710) (← links)
- (Q3355263) (← links)
- (Q3359784) (← links)
- Geometric clusterings (Q3361924) (← links)
- (Q3395954) (← links)
- (Q3415007) (← links)
- λ > 4 (Q3452770) (← links)
- (Q3477977) (← links)
- (Q3487112) (← links)
- Pseudo-triangulations -- a survey (Q3514529) (← links)
- Minimum-weight triangulation is NP-hard (Q3546362) (← links)
- (Q3576720) (← links)
- (Q3579411) (← links)
- (Q3601515) (← links)
- (Q3601523) (← links)
- Embedding 3-polytopes on a small grid (Q3602860) (← links)
- (Q3602870) (← links)
- (Q3602884) (← links)
- (Q3619929) (← links)
- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension (Q3656862) (← links)
- (Q3776619) (← links)
- (Q3780430) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
- The n-line traveling salesman problem (Q3989545) (← links)
- (Q4263471) (← links)
- (Q4269395) (← links)
- A heuristic for decomposing traffic matrices in TDMA satellite communication (Q4277996) (← links)
- Curves with increasing chords (Q4299866) (← links)
- (Q4327360) (← links)
- Matching Shapes with a Reference Point (Q4354007) (← links)
- A Visibility Representation for Graphs in Three Dimensions (Q4397214) (← links)
- Matching planar maps (Q4458868) (← links)
- (Q4471348) (← links)
- (Q4471367) (← links)
- (Q4506430) (← links)
- (Q4537737) (← links)
- (Q4542181) (← links)
- Pseudotriangulations, polytopes, and how to expand linkages (Q4557547) (← links)
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges (Q4575650) (← links)
- Matching convex shapes with respect to the symmetric difference (Q4595497) (← links)
- Saturated simple and 2-simple topological graphs with few edges (Q4600740) (← links)
- (Q4606338) (← links)
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity (Q4625134) (← links)
- Windrose Planarity (Q4629968) (← links)
- Packing short plane spanning trees in complete geometric graphs (Q4636491) (← links)
- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs (Q4645183) (← links)
- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases (Q4645924) (← links)
- (Q4657574) (← links)
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156) (← links)
- (Q4787197) (← links)
