- Approximation algorithms for maximum cliques in 3D unit-disk graphs, AfsCha-CCCG-05
- Staying in the middle: exact and approximate medians in $R^1$ and $R^2$ for moving points, AgaBerGao-CCCG-05
- The translation-scale-rotation diagram for point-containing placements of a convex polygon, BarSch-CCCG-05
- Drawing planar bipartite graphs with small area, BieBra-CCCG-05
- Space-efficient algorithms for Klee's measure problem, CheCha-CCCG-05
- A fast algorithm for point labeling problem, RoyBhaDas-CCCG-05
- Finding a triangular mesh with a constant number of different edge lengths, TanKat-CCCG-05