Mattias Andersson

12 papers B 2Misc 3Journal 5Unranked 1

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geom. Appl. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2008	J	`jnl`	Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle
2007	J	`jnl`	Approximate distance oracles for graphs with dense clusters. Comput. Geom. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2007	—	`—`	Approximation Algorithms for Geometric Networks. Mattias Andersson
2007	Misc	`conf`	Reporting leadership patterns among trajectories. SAC Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle
2006	Misc	`conf`	Restricted Mesh Simplification Using Edge Contractions. COCOON Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2005	J	`jnl`	Chips on wafers, or packing rectangles into grids. Comput. Geom. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2004	B	`conf`	Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2004	—	`conf`	Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces. PBG Mattias Andersson, Joachim Giesen, Mark Pauly, Bettina Speckmann
2003	J	`jnl`	Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
2003	B	`conf`	Chips on Wafers. WADS Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2002	Misc	`conf`	Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan