The following pages link to Christian Knauer (Q359744):
Displaying 50 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Convex transversals (Q390129) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Largest inscribed rectangles in convex polygons (Q450533) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
- Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions (Q620951) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Configurations with few crossings in topological graphs (Q876504) (← links)
- Finding largest rectangles in convex polygons (Q902427) (← links)
- (Q958205) (redirect page) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- Testing congruence and symmetry for general 3-dimensional objects. (Q1421026) (← links)
- Elastic geometric shape matching for translations under the Manhattan norm (Q1615782) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- Comparison of distance measures for planar curves (Q1889583) (← links)
- Covering with ellipses (Q1889588) (← links)
- Covering and piercing disks with two centers (Q1931270) (← links)
- Covering a simple polygon by monotone directions (Q2269836) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- Visibility maps of segments and triangles in 3D (Q2477193) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- There are not too many magic configurations (Q2482202) (← links)
- (Q2762787) (← links)
- On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3 (Q2849344) (← links)
- (Q2968082) (← links)
- Approximating the average stretch factor of geometric graphs (Q2968089) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- (Q2970472) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619) (← links)
- Approximating the Average Stretch Factor of Geometric Graphs (Q3060719) (← links)
- Computing the Discrete Fréchet Distance with Imprecise Input (Q3060793) (← links)
- Acyclic Orientation of Drawings (Q3075613) (← links)
- APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE (Q3089097) (← links)
- Covering and Piercing Disks with Two Centers (Q3104599) (← links)
- Generating Realistic Roofs over a Rectilinear Polygon (Q3104600) (← links)
- (Q3113727) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
- Geometric clustering (Q3189027) (← links)
- Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons (Q3387277) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Elastic Geometric Shape Matching for Point Sets under Translations (Q3449855) (← links)
