dblp.uni-trier.dewww.uni-trier.de

Joachim Gudmundsson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
101EEJoachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization CoRR abs/0903.0308: (2009)
100EEJoachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009)
99EEJoachim Gudmundsson, James Harland: Preface. Int. J. Found. Comput. Sci. 20(1): 1-2 (2009)
98EEJoachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009)
2008
97 Joachim Gudmundsson: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings Springer 2008
96EEMatthew Asquith, Joachim Gudmundsson, Damian Merrick: An ILP for the metro-line crossing problem. CATS 2008: 49-56
95EEBojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle: Detecting Regular Visit Patterns. ESA 2008: 344-355
94EEKevin Buchin, Maike Buchin, Joachim Gudmundsson: Detecting single file movement. GIS 2008: 33
93EEKevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655
92EEMohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Symposium on Computational Geometry 2008: 306-310
91EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
90EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
89EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
88EEJoachim Gudmundsson, Patrick Laube, Thomas Wolle: Movement Patterns in Spatio-temporal Data. Encyclopedia of GIS 2008: 726-732
87EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008)
86EEMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008)
85EEBoris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008)
84EEMarc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008)
83EEHee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discrete & Computational Geometry 40(3): 414-429 (2008)
82EEMattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008)
81EEMohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38(1): 226-240 (2008)
2007
80 Joachim Gudmundsson, C. Barry Jay: Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings Australian Computer Society 2007
79 Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
78EEOtfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418
77EEJoachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775
76EEMarc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle: Finding Popular Places. ISAAC 2007: 776-787
75EEMattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting leadership patterns among trajectories. SAC 2007: 3-7
74EEGhazi Al-Naymat, Sanjay Chawla, Joachim Gudmundsson: Dimensionality reduction for long duration and complex spatio-temporal queries. SAC 2007: 393-397
73EEMohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-fault tolerant geometric spanners. SODA 2007: 1-10
72EEHee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-angle and Hausdorff-approximation of convex figures. Symposium on Computational Geometry 2007: 37-45
71EEMohammad Farshi, Joachim Gudmundsson: Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284
70EEBoris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation CoRR abs/cs/0702080: (2007)
69EEHee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-Angle and Hausdorff-Approximation of Convex Figures CoRR abs/cs/0702090: (2007)
68EEMark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann: Editorial. Comput. Geom. 36(1): 1 (2007)
67EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
66EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007)
65EEJoachim Gudmundsson, Christos Levcopoulos: Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007)
64EEJoachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient Detection of Patterns in 2D Trajectories of Moving Points. GeoInformatica 11(2): 195-215 (2007)
63EEJoachim Gudmundsson, C. Barry Jay: Preface. Int. J. Found. Comput. Sci. 18(2): 195-196 (2007)
2006
62 Joachim Gudmundsson, C. Barry Jay: Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings Australian Computer Society 2006
61EEDamian Merrick, Joachim Gudmundsson: Increasing the readability of graph drawings with centrality-based scaling. APVIS 2006: 67-76
60EEMarc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175
59EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204
58EEJoachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410
57EEMarc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting Flock Patterns. ESA 2006: 660-671
56EEJoachim Gudmundsson, Marc J. van Kreveld: Computing longest duration flocks in trajectory data. GIS 2006: 35-42
55EEJoachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006
54EEDamian Merrick, Joachim Gudmundsson: Path Simplification for Metro Map Layout. Graph Drawing 2006: 258-269
53EEJoachim Gudmundsson, Marc J. van Kreveld, Damian Merrick: Schematisation of Tree Drawings. Graph Drawing 2006: 66-76
52EEBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92
51EEMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176
50EEJoachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. SWAT 2006: 388-399
49EEProsenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006)
2005
48EEMohammad Farshi, Joachim Gudmundsson: Experimental Study of Geometric t-Spanners. ESA 2005: 556-567
47EEBoris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59
46EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
45EEMohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Finding the best shortcut in a geometric network. Symposium on Computational Geometry 2005: 327-335
44EEProsenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005)
43EEBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR abs/cs/0512091: (2005)
42EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005)
41EEJoachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005)
40EEMark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005)
2004
39EEJoachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004
38EEJoachim Gudmundsson, Christos Levcopoulos: Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310
37EEJoachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004: 250-257
36EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64
35EEJoachim Gudmundsson, Jan Vahrenhold: I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116
34EEJoachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004)
33EEProsenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004)
32EEHerman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)
2003
31EEJoachim Gudmundsson: Constructing Sparse t-Spanners with Small Separators. FCT 2003: 86-97
30EEJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
29EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on Wafers. WADS 2003: 412-423
28 Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003)
27EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
2002
26EEJoachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160
25EEProsenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. CCCG 2002: 17-21
24EEMark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with Neighborhoods of Varying Size. ESA 2002: 187-199
23EEProsenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246
22EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
21EEMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
20EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
19EEHerman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62
18 Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002)
17EEPankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28(3): 291-312 (2002)
16EEJoachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002)
15EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
2001
14EEPankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001: 124-133
13EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
2000
12 Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178
11 Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher Order Delaunay Triangulations. ESA 2000: 232-243
10EEJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
9 Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000)
1999
8EEJoachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482
7 Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
6 Joachim Gudmundsson, Christos Levcopoulos: Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999)
5 Joachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999)
1998
4 Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244
1997
3 Christos Levcopoulos, Joachim Gudmundsson: A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316
2 Christos Levcopoulos, Joachim Gudmundsson: Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41
1996
1 Christos Levcopoulos, Joachim Gudmundsson: Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146

Coauthor Index

1Mohammad Ali Abam [73] [92]
2Pankaj K. Agarwal [14] [17]
3Hee-Kap Ahn [69] [72] [83]
4Ghazi Al-Naymat [74]
5Mattias Andersson [21] [27] [29] [36] [42] [59] [66] [75] [82]
6Boris Aronov [43] [47] [52] [70] [85]
7Matthew Asquith [96]
8Sang Won Bae [69] [72] [83]
9Marc Benkert [51] [57] [60] [76] [84] [86]
10Mark de Berg [12] [14] [17] [19] [24] [28] [32] [40] [47] [68] [70] [73] [85] [92]
11Prosenjit Bose [23] [25] [33] [43] [44] [49] [52]
12Kevin Buchin [93] [94]
13Maike Buchin [93] [94]
14Sergio Cabello [49]
15Sanjay Chawla [74]
16Otfried Cheong (Otfried Schwarzkopf) [47] [49] [69] [70] [72] [78] [83] [85]
17Erik D. Demaine [43] [52]
18Bojan Djordjevic [76] [95]
19Hazel Everett [78]
20Mohammad Farshi [45] [48] [71] [73] [81]
21Panos Giannopoulos [45] [81]
22Marc Glisse [78]
23Mikael Hammar [11] [12] [14] [17] [18] [28]
24James Harland [99]
25Herman J. Haverkort [14] [17] [19] [26] [32] [34] [41] [47] [51] [70] [85] [86]
26Samuel Hornus [78]
27Florian Hübner [57] [84]
28Thore Husfeldt [16]
29John Iacono [43] [52]
30C. Barry Jay [62] [63] [80]
31Jyrki Katajainen [77]
32Matthew J. Katz (Matya Katz) [24] [40]
33Rolf Klein [55] [79]
34Christian Knauer [60]
35Marc J. van Kreveld [11] [18] [37] [41] [49] [53] [56] [58] [64] [100]
36Stefan Langerman [43] [52]
37Patrick Laube [75] [82] [88]
38Sylvain Lazard [78]
39Mira Lee [78]
40Christos Levcopoulos [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [13] [15] [16] [20] [21] [22] [24] [27] [29] [36] [38] [40] [42] [59] [65] [66] [87]
41Maarten Löffler [93]
42Jun Luo [93]
43Damian Merrick [53] [54] [61] [77] [96]
44Esther Moet [60]
45Pat Morin [25] [33] [101]
46Hyeon-Suk Na [78]
47Giri Narasimhan [7] [10] [13] [15] [20] [21] [22] [27] [30] [46] [55] [58] [67] [79] [87] [89] [90] [91] [100]
48Cahya Ong [77]
49René van Oostrum [60] [68]
50Mark H. Overmars [12] [24] [28] [40]
51Sang-Min Park [26] [34]
52Anh Pham [95]
53Chan-Su Shin [26] [34]
54Michiel H. M. Smid [20] [22] [23] [30] [43] [44] [46] [50] [52] [55] [67] [70] [79] [85] [87] [89] [90] [91] [98] [101]
55Bettina Speckmann [37] [49] [64] [68]
56A. Frank van der Stappen [24] [40]
57Jan Vahrenhold [35] [39]
58Antoine Vigneron [47] [70] [85]
59Alexander Wolff [26] [34] [51] [55] [60] [79] [86]
60Thomas Wolle [57] [75] [76] [77] [82] [84] [88] [95]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)