The following pages link to Klaus Kriegel (Q580366):
Displaying 34 items.
- On dissections of the n-cube (Q580367) (← links)
- Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions (Q620951) (← links)
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- Embedding rectilinear graphs in linear time (Q1111399) (← links)
- (Q1289024) (redirect page) (← links)
- An applied point pattern matching problem: Comparing 2D patterns of protein spots (Q1289026) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- Triangles in Euclidean arrangements (Q1807616) (← links)
- Covering with ellipses (Q1889588) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- The Polygon Exploration Problem (Q2784471) (← links)
- Online Exploration of Polygons with Holes (Q2848914) (← links)
- (Q3219109) (← links)
- (Q3365284) (← links)
- (Q3602884) (← links)
- On the Number of Cycles in Planar Graphs (Q3608835) (← links)
- Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation (Q3612576) (← links)
- (Q3674695) (← links)
- (Q3678678) (← links)
- (Q3710469) (← links)
- The dimension of graphs with respect to the direct powers of a two-element graph (Q3751619) (← links)
- (Q3783566) (← links)
- Lower bounds on the complexity of real-time branching programs (Q3815526) (← links)
- (Q4232784) (← links)
- (Q4373666) (← links)
- (Q4499945) (← links)
- (Q4727444) (← links)
- (Q4828967) (← links)
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems (Q4881287) (← links)
- On the Number of Simple Cycles in Planar Graphs (Q4934778) (← links)
- Moving an angle around a region (Q5054844) (← links)
- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions (Q5321701) (← links)
- (Q5368703) (← links)
- (Q5501793) (← links)
