Publications

Journals

1. C. Levcopoulos and J. Gudmundsson.
   Close approximations of minimum rectangular coverings. [pdf]
   Journal of Combinatorial Optimization 3 (4):437-452, December 1999.

2. C. Levcopoulos and J. Gudmundsson.
   A fast approximation algorithm for TSP with neighborhoods. [pdf]
   Nordic Journal of Computing, 6(4):469-488, 1999.

3. C. Levcopoulos and J. Gudmundsson.
   A parallel approximation algorithm for minimum weight triangulation. [ps]
   Nordic Journal of Computing, 7(1):32-57, 2000.

4. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
   Approximating a minimum Manhattan network. [pdf]
   Nordic Journal of Computing, 8(2):219-232, 2001.

5. T. Husfeldt, C. Levcopoulos and J. Gudmundsson.
   Lower bounds for approximate polygon decomposition and minimum gap. [pdf]
   Information Processing Letters, 81(3):137-141, 2002.

6. M. Hammar, M. van Kreveld and J. Gudmundsson.
   Higher order Delaunay triangulation. [pdf]
   Computational Geometry - Theory and Applications , 23(1):85-98, 2002.

7. P. K. Agarwal, M. de Berg, M. Hammar, H. J. Haverkort and J. Gudmundsson.
   Box-trees and R-trees with near-optimal query time. [pdf]
   Discrete and Computational Geometry, 28:291-312, 2002.
   

8. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
   Improved greedy algorithm for constructing sparse geometric spanners. [pdf]
   SIAM Journal of Computing, 31(5):1479-1500, 2002.

9. M. de Berg, M. Hammar, M. Overmars and J. Gudmundsson.
   On R-trees with low stabbing number. [pdf]
   Computational Geometry - Theory and Applications 24(3):179-195, 2003.

10. M. Andersson, C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
    Balanced Partition of Minimum Spanning Trees. [pdf]
    International Journal on Computational Geometry and Applications, 13(4):303-316, 2003.

11. H. J. Haverkort, S.-M. Park, C.-S. Shin, A. Wolff and J. Gudmundsson.
    Approximating the geometric minimum-diameter spanning tree. [pdf]
    Computational Geometry - Theory and Applications, 27(1):87-106, 2004.
    

12. J. Bose, P. Morin and J. Gudmundsson.
    Ordered theta graphs. [pdf]
    Computational Geometry - Theory and Applications, 28(1):11-18, 2004.
    

13. H. J. Haverkort, M. de Berg and J. Gudmundsson.
    Box-Trees for Collision Checking in Industrial Installations. [pdf]
    Computational Geometry - Theory and Applications, 28(2-3):113-135, 2004.

14. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Chips on Wafers. [pdf]
    Computational Geometry - Theory and Applications, 30(2):95-111, 2005.

15. J. Bose, M. Smid, and J. Gudmundsson.
    Constructing plane spanners of bounded degree and low weight. [pdf]
    Algoritmica 42: 249–264, 2005.

16. H. J. Haverkort, M. van Kreveld and J. Gudmundsson.
    Constrained Higher Order Delaunay Triangulation. [pdf]
    Computational Geometry - Theory and Applications 30(3):271 - 277, 2005.

17. M. de Berg, M. Katz, C. Levcopoulos, M. Overmars, F. van der Stappen, and J. Gudmundsson.
    Constant factor approximation algorithms for TSPN with fat objects. [pdf]
    Journal of Algorithms, 57:22-36, 2005.

18. J. Bose, O. Cheong, S. Cabello, M. van Kreveld, B. Speckmann and J. Gudmundsson.
    Area-preserving approximations of polygonal paths [pdf]
    Journal of Discrete Algorithms, 4(4):554-566, 2006.

19. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Approximate distance oracles for graphs with dense clusters. [pdf]
    Computational Geometry - Theory and Applications, 37(3):142-154, 2007.

20. G. Narasimhan, M. Smid and J. Gudmundsson.
    Distance-preserving approximations of polygonal paths. [pdf]
    Computational Geometry - Theory and Applications, 36(3):183-196, 2007.

21. M. van Kreveld, B. Speckmann and J. Gudmundsson.
    Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets. [pdf]
    GeoInformatica, 11(2):195-215, 2007.

22. C. Levcopoulos and J. Gudmundsson.
    Minimum weight pseudo-triangulations. [pdf]
    Computational Geometry - Theory and Applications, 38(3):139-153, 2007.

23. M. Benkert, H. Haverkort, A. Wolff and J. Gudmundsson.
    Constructing Interference-Minimal Networks. [pdf]
    Computational Geometry - Theory and Applications, 40(3):207-219, 2008.

24. B. Aronov, M. de Berg, O. Cheong, H. Haverkort, A. Vigneron and J. Gudmundsson.
    Small graphs with small dilation. [pdf]
    Computational Geometry - Theory and Applications, 40(3):179-194, 2008.

25. M. Farshi, P. Giannopoulos and J. Gudmundsson.
    Improving the stretch factor of a geometric graph by edge augmentation. [pdf]
    SIAM Journal on Computing, 38(1):226-240, 2008.

26. C. Levopoulos, G. Narasimhan, M. Smid and J. Gudmundsson.
    Approximate Distance Oracles for Geometric Spanners. [pdf]
    ACM Transactions on Algorithms, 4(1), 2008. Merged version of [C11] and [C17].

27. M. Benkert, F. Hubner, T. Wolle and J. Gudmundsson.
    Reporting Flock Patterns. [pdf]
    Computational Geometry - Theory and Applications, 41(3):11-125, 2008.

28. H.-K. Ahn, S. W. Bae, O. Cheong and J. Gudmundsson.
    Aperture-Angle and Hausdorff-Approximation of Convex Figures. [pdf]
    Discrete and Computational Geometry, 40(3): 414-429, 2008.

29. M. Andersson, P. Laube, T. Wolle and J. Gudmundsson.
    Reporting leaders and followers among trajectories of moving point objects. [pdf]
    GeoInformatica, 12(4):497-528, 2008.

30. M. van Kreveld, G. Narasimhan and J. Gudmundsson.
    Region-restricted clustering for geographic data mining. [pdf]
    Computational Geometry - Theory and Applications, 42(3):231-240, 2009.

31. M. Benkert, C. Knauer, R. van Oostrum, A. Wolff and J. Gudmundsson.
    A 2/3-approximation algorithm for a disc packing problem. [pdf]
    International Journal on Computational Geometry and Applications, 19(3):267-288, 2009.

32. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Restricted mesh simplification using edge contractions. [pdf]
    International Journal on Computational Geometry and Applications, 19(3):247-265, 2009.

33. M. Smid and J. Gudmundsson.
    On spanners of geometric graphs. [pdf]
    International Journal of Foundations of Computer Science, 20(1):135-150, 2009.

34. M. Ali Abam, M. de Berg, M. Farshi and J. Gudmundsson.
    Region-fault tolerant geometric spanners. [pdf]
    Discrete and Computational Geometry, 41(4):556-582, 2009.

35. M. Farshi and J. Gudmundsson.
    Experimental study of geometric t-spanners.
    ACM Journal of Experimental Algorithmics, 14(1):3-39, 2009.
    Merged version of [C28] and [C44].

36. J. Katajainen, D. Merrick, C. Ong, T. Wolle and J. Gudmundsson.
    Compressing spatio-temporal trajectories. [ps]
    Computational Geometry - Theory and Applications, 42(9):825-841, 2009.

37. L. Devroye, P. Morin and J.Gudmundsson.
    On the expected maximum degree of Gabriel and Yao graphs. [arXiv]
    Advances in Applied Probability, 41(4):1123-1140, 2009.

38. M. Ali Abam, M. de Berg and J. Gudmundsson.
    A simple and efficient kinetic spanner. [pdf]
    Computational Geometry - Theory and Applications, 43(3):251-256, 2010.

39. M. Benkert, B. Djordjevic, T. Wolle and J. Gudmundsson.
    Finding popular places. [pdf]
    To appear in International Journal on Computational Geometry and Applications.

40. B. Djordjevic, A. Pham, T. Wolle and J. Gudmundsson.
    Detecting Regular Visit Patterns. [pdf]
    To appear in Algorithmica.

41. K. Buchin, M. Buchin and J. Gudmundsson.
    Constrained free space diagrams: a tool for trajectory analysis.
    To appear in International Journal of GIS.

42. K. Buchin, M. Buchin, M. Löffler, J. Luo and J. Gudmundsson.
    Detecting Commuting Patterns by Clustering Subtrajectories.
    To appear in International Journal on Computational Geometry and Applications.

43. F. Gieseke, J. Vahrenhold and J. Gudmundsson.
    Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies.
    To appear in Journal of Discrete Algorithms.

Refereed conferences

1. C. Levcopoulos and J. Gudmundsson.
   Close approximations of minimum rectangular coverings. [pdf]
   FST&TCS 1996.

2. C. Levcopoulos and J. Gudmundsson.
   Approximation algorithms for covering polygons with squares and similar problems. [pdf]
   RANDOM 1997.

3. C. Levcopoulos and J. Gudmundsson.
   A linear-time approximation algorithm for minimum rectangular coverings. [ps]
   FCT 1997.

4. C. Levcopoulos and J. Gudmundsson.
   A parallel approximation algorithm for minimum weight triangulation. [pdf]
   FST&TCS 1998.

5. C. Levcopoulos and J. Gudmundsson.
   A fast approximation algorithm for TSP with neighborhoods and red-blue separation. [pdf].
   COCOON 1999.

6. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
   Approximating Minimum Manhattan Networks. [pdf]
   APPROX 1999.

7. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
   Improved greedy algorithm for constructing sparse geometric spanners. [pdf]
   SWAT 2000.

8. M. Hammar, M. van Kreveld and J. Gudmundsson.
   Higher order Delaunay triangulation.
   ESA 2000.
   Tech. report UU-CS-2001-05 [pdf]

9. M. de Berg, M. Hammar, M. Overmars and J. Gudmundsson.
   On R-trees with low stabbing number.
   ESA 2000.
   Tech. report UU-CS-2001-21 [pdf]

10. P. K. Agarwal, M. de Berg, M. Hammar, H. J. Haverkort and J. Gudmundsson.
    Box-Trees and R-Trees with Near-Optimal Query Time.
    ACM SoCG 2001.
    Tech. report UU-CS-2001-10 [pdf]

11. C. Levcopoulos, G. Narasimhan, M. Smid and J. Gudmundsson
    Approximate Distance Oracles for Geometric Graphs.
    ACM-SIAM SODA 2002.
    Tech. report TR-04-08 (Merge of [11] and [17]) [pdf]

12. M. Andersson, C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
    Balanced Partition of Minimum Spanning Trees.
    CGA 2002. (Best student paper).
    Tech. report UU-CS-2002-037 [pdf]

13. H. J. Haverkort, M. de Berg and J. Gudmundsson.
    Box-Trees for Collision Checking in Industrial Installations.
    ACM SoCG 2002.
    Tech. report UU-CS-2002-027 [pdf]

14. M. de Berg, M. Katz, C. Levcopoulos, M. Overmars, F. van der Stappen and J. Gudmundsson.
    Constant factor approximation algorithms for TSPN with fat objects.
    ESA 2002.
    Tech. report UU-CS-2002-036 [pdf]

15. J. Bose, M. Smid and J. Gudmundsson
    Constructing plane spanners of bounded degree and low weight. [pdf]
    ESA 2002.

16. H. J. Haverkort, S.-M. Park, C.-S. Shin, A. Wolff and J. Gudmundsson.
    Approximating the geometric minimum-diameter spanning tree. [pdf]
    APPROX 2002.
    Tech. report 4/2002 Greifsvald. [ps.gz]

17. C. Levcopoulos, G. Narasimhan, M. Smid and J. Gudmundsson.
    Approximate Distance Oracles Revisited.
    ISAAC, 2002.
    Tech. report TR-04-08. (Merge of [11] and [17]) [pdf]

18. J. Gudmundsson.
    Constructing t-spanners with small separators.
    FCT 2003.
    [There is an error in the conference version of this paper.
    A full and (hopefully) correct version will be available within short.]

19. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Chips on Wafers. [pdf]
    WADS 2003.

20. G. Narasimhan, M. Smid and J. Gudmundsson.
    Distance-preserving approximations of polygonal paths. [pdf]
    FST&TCS 2003.

21. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Approximate distance oracles for graphs with dense clusters. [pdf]
    ISAAC 2004.

22. M. van Kreveld, B. Speckmann and J. Gudmundsson.
    Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets. [pdf]
    ACM GIS 2004.

23. C. Levcopoulos and J. Gudmundsson.
    Minimum weight pseudo-triangulations [pdf]
    FST&TCS 2004.

24. J. Vahrenhold and J. Gudmundsson.
    I/O-efficiently pruning dense spanners [pdf]
    JCDCG 2004.

25. J. Bose, O. Cheong, S. Cabello, M. van Kreveld, B. Speckmann and J. Gudmundsson.
    Area-preserving approximations of polygonal paths [pdf]
    JCDCG 2004.

26. G. Narasimhan, M. Smid and J. Gudmundsson
    Fast pruning of geometric spanners. [pdf]
    STACS 2005.

27. M. Farshi, P. Giannopoulos and J. Gudmundsson.
    Finding the best shortcut in a geometric network [pdf]
    ACM SoCG 2005.

28. M. Farshi and J. Gudmundsson.
    Experimental analysis of geometric t-spanners. [pdf]
    ESA 2005.

29. B. Aronov, M. de Berg, O. Cheong, H. Haverkort, A. Vigneron and J. Gudmundsson.
    Sparse geometric graphs with small dilation [pdf]
    ISAAC 2005.

30. M. Benkert, H. Haverkort, A. Wolff and J. Gudmundsson.
    Constructing Interference-Minimal Networks. [pdf]
    SOFSEM 2006.

31. B. Aronov, P. Bose, E. D. Demaine, J. Iacono, S. Langerman, M. Smid and J. Gudmundsson.
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [pdf]
    LATIN 2006.

32. M. Smid and J. Gudmundsson.
    On spanners of geometric graphs. [pdf]
    SWAT 2006.

33. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Restricted Mesh Simplification Using Edge Contractions. [pdf]
    COCOON 2006.

34. M. Benkert, C. Knauer, E. Moet, R. van Oostrum, A. Wolff and J. Gudmundsson.
    A 2/3-approximation algorithm for a disc packing problem. [pdf]
    COCOON 2006.

35. M. Benkert, F. Hubner, T. Wolle and J. Gudmundsson.
    Reporting Flock Patterns. [pdf]
    ESA 2006.

36. M. van Kreveld, G. Narasimhan and J. Gudmundsson.
    Region-Restricted Clustering for Geographic Data Mining. [ps]
    ESA 2006.

37. D. Merrick and J. Gudmundsson.
    C-Directed Path Simplification for Metro Map Layout. [pdf]
    GD 2006.

38. D. Merrick, M. van Kreveld and J. Gudmundsson.
    Metro map with tree layouts. [pdf]
    GD 2006.

39. M. van Kreveld and J. Gudmundsson.
    Computing longest duration flocks in spatio-temporal data. [pdf]
    ACM GIS 2006.

40. M. Ali Abam, M. de Berg, M. Farshi and J. Gudmundsson.
    Region-Fault Tolerant Geometric Spanners. [pdf]
    ACM-SIAM SODA 2007.

41. G. Al-Naymat, S. Chawla and J. Gudmundsson.
    Dimensionality reduction for long duration and complex spatio-temporal queries. [pdf]
    ACM SAC 2007.

42. M. Andersson, P. Laube, T. Wolle and J. Gudmundsson.
    Leadership queries in trajectory data. [pdf]
    ACM SAC 2007.

43. H.-K. Ahn, S. W. Bae, O. Cheong and J. Gudmundsson.
    Aperture-Angle and Hausdorff-Approximation of Convex Figures. [pdf]
    ACM SoCG 2007.

44. M. Farshi and J. Gudmundsson.
    Experimental study of geometric t-spanners: a running time comparison. [pdf]
    WEA 2007.

45. O. Cheong, H. Everett, M. Glisse, S. Hornus, S. Lazard, M. Lee, H.-S. Na and J. Gudmundsson.
    Farthest-polygon Voronoi diagrams. [pdf]
    ESA 2007.

46. J. Katajainen, D. Merrick, C. Ong, T. Wolle and J. Gudmundsson.
    Compressing spatio-temporal trajectories. [pdf]
    ISAAC 2007.

47. M. Benkert, B. Djordjevic, T. Wolle and J. Gudmundsson.
    Finding Popular Places. [pdf]
    ISAAC 2007.

48. M. Asquith, D. Merrick and J. Gudmundsson.
    An ILP for the line ordering problem. [pdf]
    CATS 2008.

49. M. Ali Abam, M. de Berg and J. Gudmundsson.
    A Simple and Efficient Kinetic Spanner. [pdf]
    ACM SoCG 2008.

50. B. Djordjevic, A. Pham, T. Wolle and J. Gudmundsson.
    Detecting Regular Visit Patterns. [pdf]
    ESA 2008.

51. K. Buchin, M. Buchin, Jun Luo, M. Löffler and J. Gudmundsson.
    Detecting Commuting Patterns by Clustering Subtrajectories. [pdf]
    ISAAC 2008.

52. K. Buchin, M. Buchin and J. Gudmundsson.
    Detecting Single File Movement. [pdf]
    ACM GIS 2008.

53. K. Buchin, S. Cabello, M. Löffler, J. Luo, G. Rote, R. Silveira, B. Speckmann, T. Wolle and J. Gudmundsson.
    Efficient Algorithms for Detecting Point Patterns on Networks. [pdf]
    AGILE 2009 (Best paper award!).

54. O. Cheong, H.-S. Kim, D. Schymura, F. Stehn and J. Gudmundsson.
    Measuring the Similarity of Geometric Graphs. [pdf]
    SEA 2009.

55. M. Ali Abam, M. de Berg, M. Farshi, M. Smid and J. Gudmundsson.
    Geometric Spanners for Weighted Point Sets. [pdf]
    ESA 2009.

56. V. Dujmovic, P. Morin, T. Wolle and J. Gudmundsson.
    Notes on large angle crossing graphs. [arXiv]
    CATS 2010.

57. P. Morin and J. Gudmundsson.
    Planar Visibility: Testing and Counting. [arXiv]
    To appear at SoCG 2010.

Other publications

1. M. Andersson, C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
   Balanced Partition of Minimum Spanning Trees
   EWCG 2002.

2. H. J. Haverkort, S.-M. Park, C.-S. Shin, A. Wolff and J. Gudmundsson.
   Approximating the geometric minimum-diameter spanning tree.
   EWCG 2002.

3. J. Bose, P. Morin and J. Gudmundsson.
   Ordered theta graphs.
   CCCG 2002.

4. M. Andersson, C. Levcopoulos and J. Gudmundsson.
   Chips on Wafers, or Packing Rectangles into Grids
   EWCG 2003.

5. H. J. Haverkort, M. van Kreveld and J. Gudmundsson.
   Constrained Higher Order Delaunay Triangulation
   EWCG 2003.

6. M. Andersson, C. Levcopoulos and J. Gudmundsson.
   Approximate distance oracles for graphs with dense clusters
   EWCG 2004.

7. C. Levcopoulos and J. Gudmundsson.
   Minimum weight pseudo-triangulations
   EWCG 2004.

8. M. Farshi, P. Giannopoulos and J. Gudmundsson.
   Finding the best shortcut in a geometric network
   EWCG 2005.

9. M. Benkert, H. Haverkort, A. Wolff and J. Gudmundsson.
   Constructing Interference-Minimal Networks
   EWCG 2005.

10. B. Aronov, P. Bose, E. D. Demaine, J. Iacono, S. Langerman, M. Smid and J. Gudmundsson.
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
    FWCG 2005.

11. B. Aronov, M. de Berg, O. Cheong, H. Haverkort, A. Vigneron and J. Gudmundsson.
    Sparse geometric graphs with small dilation.
    WAAC 2005.

12. D. Merrick and J. Gudmundsson.
    Increasing the Readability of Graph Drawings with Centrality-Based Scaling
    APVIS 2006.

13. M. Andersson, C. Levcopoulos and J. Gudmundsson.
    Restricted mesh simplification using edge contractions
    EWCG 2006.

14. M. Benkert, C. Knauer, E. Moet, R. van Oostrum, A. Wolff and Joachim Gudmundsson.
    A slow approximation algorithm for a geometric dispersion problem.
    EWCG 2006.

15. M. Farshi and J. Gudmundsson.
    Computing the diameter of a t-spanner. [pdf]
    AIM 2006.

16. O. Klein, C. Knauer, M. Smid and J. Gudmundsson.
    Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance. [pdf]
    EWCG 2007.

17. O. Cheong, H. Everett, M. Glisse, S. Hornus, S. Lazard, M. Lee, H.-S. Na and J. Gudmundsson.
    Farthest-polygon Voronoi diagrams. [pdf]
    WAAC 2007.

18. O. Cheong, H.-S. Kim, D. Schymura, F. Stehn and J. Gudmundsson.
    Measuring the similarity of geometric graphs. [pdf]
    EWCG 2009.

Theses, edited volumes and handbook chapters

1. J. Gudmundsson,
   Covering Polygons with Rectangles,
   Masters thesis, LUNDFD6/NFCS-5081/1-36/1996,
   Department of Computer Science, Lund University, Sweden, 1996.

2. J. Gudmundsson,
   Geometric Decompositions and Networks - Approximation Bounds and Algorithms,
   ISBN 91-7874-098-3, Ph. D. thesis, 2000.

3. C. Knauer and J. Gudmundsson.
   Dilation and detour in geometric networks.
   Handbook on approximation algorithms and metaheuristics [pdf]
   Chapter 52, (Editor Teofilo Gonzalez). Chapman & Hall/CRC, 2006.

4. B. Jay and J. Gudmundsson (Eds.).
   Proceedings of the 12th Computing: The Australasian Theory Symposium (CATS2006).
   CRPIT series Vol. 51, Hobart, Tasmania, Australia, January 2006.
   ISBN 1-920-68233-3.

5. B. Jay and J. Gudmundsson (Eds.).
   Proceedings of the 13th Computing: The Australasian Theory Symposium (CATS2007).
   CRPIT series Vol. 65, Ballarat, Victoria, Australia, January 2007.
   ISBN 1-920-68246-5.

6. M. de Berg, R. van Oostrum, B. Speckmann and J. Gudmundsson.
   Editorial foreword in special issue of EWCG'05 in
   Computational Geometry -Theory & Applications, 36(1):1, 2007.
   

7. B. Jay and J. Gudmundsson.
   Editorial foreword in special issue of CATS'06 in
   International Journal of Foundations of Computer Science, 18(2):195, 2007.
   

8. P. Laube, T. Wolle and J. Gudmundsson.
   Movement patterns in spatio-temporal data. [pdf]
   Encyclopedia of GIS,
   (S. Shekhar and H. Xiong, editors), Springer-Verlag, 2007.
   

9. G. Narasimhan, M. Smid and J. Gudmundsson.
   Geometric spanners. [pdf]
   Encyclopedia of Algorithms,
   (M.-Y. Kao, editor), Springer-Verlag, 2008.
   

10. G. Narasimhan, M. Smid and J. Gudmundsson.
    Plane geometric spanners. [pdf]
    Encyclopedia of Algorithms,
    (M.-Y. Kao, editor), Springer-Verlag, 2008.
    

11. G. Narasimhan, M. Smid and J. Gudmundsson.
    Application of geometric spanner networks. [pdf]
    Encyclopedia of Algorithms,
    (M.-Y. Kao, editor), Springer-Verlag, 2008.
    

12. J. Gudmundsson (Ed.).
    Proceedings of the 11th Scandinavian Workshop on Algorithm theory (SWAT 2008).
    Lecture Notes in Computer Science 5124, Springer-Verlag Berlin Heidelberg, 2008
    ISBN 3-540-69900-7.

Co-authors

ADDRESS