Search the dblp DataBase

Publications of Author

1. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Restricted Mesh Simplification Using Edge Contractions. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:196-204 [Conf]
   
2. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
   Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   International Conference on Computational Science (3), 2002, pp:26-35 [Conf]
   
3. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Approximate Distance Oracles for Graphs with Dense Clusters. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2004, pp:53-64 [Conf]
   
4. Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle
   Reporting leadership patterns among trajectories. [Citation Graph (0, 0)][DBLP]
   SAC, 2007, pp:3-7 [Conf]
   
5. Martin Solli, Mattias Andersson, Reiner Lenz, Björn Kruse
   Color Measurements with a Consumer Digital Camera Using Spectral Estimation Techniques. [Citation Graph (0, 0)][DBLP]
   SCIA, 2005, pp:105-114 [Conf]
   
6. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Chips on Wafers. [Citation Graph (0, 0)][DBLP]
   WADS, 2003, pp:412-423 [Conf]
   
7. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Chips on wafers, or packing rectangles into grids. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:30, n:2, pp:95-111 [Journal]
   
8. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
   Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:303-316 [Journal]
   
9. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
   Approximate distance oracles for graphs with dense clusters. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2007, v:37, n:3, pp:142-154 [Journal]
   
10. 
    Nested Polar Codes for Wiretap and Relay Channels [Citation Graph (, )][DBLP]