The following pages link to Christian Hundt (Q533415):
Displayed 14 items.
- New complexity bounds for image matching under rotation and scaling (Q533416) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation (Q1038471) (← links)
- Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation (Q2904486) (← links)
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation (Q3506938) (← links)
- Damaged BZip Files Are Difficult to Repair (Q3511308) (← links)
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (Q3557057) (← links)
- Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete (Q3575233) (← links)
- On the Complexity of Affine Image Matching (Q3590940) (← links)
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations (Q3599144) (← links)
- New Complexity Bounds for Image Matching under Rotation and Scaling (Q3637109) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- Provably Secure Steganography and the Complexity of Sampling (Q5459169) (← links)
- Algorithms and Implementation for Interconnection Graph Problem (Q5505659) (← links)