The following pages link to Günter Rote (Q170472):
Displayed 50 items.
- Covering with ellipses (Q1889588) (← links)
- Vehicle routing in an automated warehouse: Analysis and optimization (Q1897373) (← links)
- Quasi-Monte-Carlo methods and the dispersion of point sequences (Q1921094) (← links)
- On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes (Q1922678) (← links)
- A central limit theorem for convex chains in the square (Q1961850) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- An almost optimal bound on the number of intersections of two simple polygons (Q2105320) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Random polytopes and the wet part for arbitrary probability distributions (Q2211500) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points (Q2351749) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Optimally solving a transportation problem using Voronoi diagrams (Q2391547) (← links)
- Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions (Q2391710) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- There are not too many magic configurations (Q2482202) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- PL Morse theory in low dimensions (Q2684910) (← links)
- The Obnoxious Center Problem on a Tree (Q2753540) (← links)
- Congruence Testing of Point Sets in Three and Four Dimensions (Q2807817) (← links)
- Saturated Simple and 2-simple Topological Graphs with Few Edges (Q2827825) (← links)
- Monotone Paths in Planar Convex Subdivisions and Polytopes (Q2848994) (← links)
- Topological Hypergraphs (Q2849799) (← links)
- Formulae and Growth Rates of High-Dimensional Polycubes (Q2851503) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- Add isotropic Gaussian kernels at own risk (Q2874571) (← links)
- Monotone Paths in Planar Convex Subdivisions (Q2914328) (← links)
- (Q2921734) (← links)
- Advantage in the discrete Voronoi game (Q2929591) (← links)
- (Q2934587) (← links)
- (Q2934673) (← links)
- (Q2968076) (← links)
- Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings (Q2970420) (← links)
- Recursively-Regular Subdivisions and Applications (Q2970450) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- Obnoxious Centers in Graphs (Q3013158) (← links)
- (Q3059230) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- Acyclic Orientation of Drawings (Q3075613) (← links)
- On Constrained Minimum Pseudotriangulations (Q3082951) (← links)
- Proper n-Cell Polycubes in n − 3 Dimensions (Q3087949) (← links)
- Congruence Testing of Point Sets in 4-Space. (Q3132884) (← links)
- Resolving Loads with Positive Interior Stresses (Q3183482) (← links)
- Geometric clustering (Q3189027) (← links)
- Realizing Planar Graphs as Convex Polytopes (Q3223957) (← links)
- (Q3336710) (← links)