Chips on Wafers. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (WADS, 2003)

Balanced Partition of Minimum Spanning Trees. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (Int. J. Comput. Geom. Appl., 2003)

Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces. - Mattias Andersson 002; Joachim Giesen; Mark Pauly; Bettina Speckmann (PBG, 2004)

Chips on wafers, or packing rectangles into grids. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2005)

Reporting leadership patterns among trajectories. - Mattias Andersson 002; Joachim Gudmundsson; Patrick Laube; Thomas Wolle (SAC, 2007)

Approximate distance oracles for graphs with dense clusters. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2007)

Approximation Algorithms for Geometric Networks. - Mattias Andersson 002 (2007)

Reporting Leaders and Followers among Trajectories of Moving Point Objects. - Mattias Andersson 002; Joachim Gudmundsson; Patrick Laube; Thomas Wolle (GeoInformatica, 2008)

Restricted Mesh Simplification Using Edge Contractions. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Int. J. Comput. Geom. Appl., 2009)