Mattias Andersson

According to our database, Mattias Andersson authored at least 9 papers between 2002 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Reporting Leaders and Followers among Trajectories of Moving Point Objects.

Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle

GeoInformatica, 2008

2007

Approximation Algorithms for Geometric Networks.

Mattias Andersson

PhD thesis, 2007

Reporting leadership patterns among trajectories.

Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

2006

Restricted Mesh Simplification Using Edge Contractions.

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Chips on wafers, or packing rectangles into grids.

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Comput. Geom., 2005

2004

Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces.

Mattias Andersson, Joachim Giesen, Mark Pauly, Bettina Speckmann

Proceedings of the 1st Symposium on Point Based Graphics, 2004

Approximate Distance Oracles for Graphs with Dense Clusters.

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Chips on Wafers.

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Balanced Partition of Minimum Spanning Trees.

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan

Proceedings of the Computational Science - ICCS 2002, 2002