2010 | ||
---|---|---|
114 | Joachim Gudmundsson, Pat Morin: Planar Visibility: Testing and Counting CoRR abs/1001.2734: (2010) | |
113 | Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams CoRR abs/1001.3593: (2010) | |
112 | Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle: Finding Popular Places. Int. J. Comput. Geometry Appl. 20(1): 19-42 (2010) | |
2009 | ||
111 | Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 | |
110 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 | |
109 | Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn: Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112 | |
108 | Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization CoRR abs/0903.0308: (2009) | |
107 | Luc Devroye, Joachim Gudmundsson, Pat Morin: On the Expected Maximum Degree of Gabriel and Yao Graphs CoRR abs/0905.3584: (2009) | |
106 | Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on large angle crossing graphs CoRR abs/0908.3545: (2009) | |
105 | Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009) | |
104 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-Fault Tolerant Geometric Spanners. Discrete & Computational Geometry 41(4): 556-582 (2009) | |
103 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geometry Appl. 19(3): 247-265 (2009) | |
102 | Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geometry Appl. 19(3): 267-288 (2009) | |
101 | Joachim Gudmundsson, James Harland: Preface. Int. J. Found. Comput. Sci. 20(1): 1-2 (2009) | |
100 | Joachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009) | |
2008 | ||
99 | Joachim Gudmundsson: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings Springer 2008 | |
98 | Matthew Asquith, Joachim Gudmundsson, Damian Merrick: An ILP for the metro-line crossing problem. CATS 2008: 49-56 | |
97 | Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle: Detecting Regular Visit Patterns. ESA 2008: 344-355 | |
96 | Kevin Buchin, Maike Buchin, Joachim Gudmundsson: Detecting single file movement. GIS 2008: 33 | |
95 | Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655 | |
94 | Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Symposium on Computational Geometry 2008: 306-310 | |
93 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008 | |
92 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008 | |
91 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008 | |
90 | Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Movement Patterns in Spatio-temporal Data. Encyclopedia of GIS 2008: 726-732 | |
89 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008) | |
88 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) | |
87 | Boris 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) | |
86 | Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008) | |
85 | Hee-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) | |
84 | Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008) | |
83 | Mohammad 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 | ||
82 | 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 | |
81 | 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 | |
80 | Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 | |
79 | Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775 | |
78 | Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle: Finding Popular Places. ISAAC 2007: 776-787 | |
77 | Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting leadership patterns among trajectories. SAC 2007: 3-7 | |
76 | Ghazi Al-Naymat, Sanjay Chawla, Joachim Gudmundsson: Dimensionality reduction for long duration and complex spatio-temporal queries. SAC 2007: 393-397 | |
75 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-fault tolerant geometric spanners. SODA 2007: 1-10 | |
74 | Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-angle and Hausdorff-approximation of convex figures. Symposium on Computational Geometry 2007: 37-45 | |
73 | Mohammad Farshi, Joachim Gudmundsson: Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284 | |
72 | Boris 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) | |
71 | Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-Angle and Hausdorff-Approximation of Convex Figures CoRR abs/cs/0702090: (2007) | |
70 | Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann: Editorial. Comput. Geom. 36(1): 1 (2007) | |
69 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007) | |
68 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007) | |
67 | Joachim Gudmundsson, Christos Levcopoulos: Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007) | |
66 | Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient Detection of Patterns in 2D Trajectories of Moving Points. GeoInformatica 11(2): 195-215 (2007) | |
65 | Joachim Gudmundsson, C. Barry Jay: Preface. Int. J. Found. Comput. Sci. 18(2): 195-196 (2007) | |
2006 | ||
64 | 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 | |
63 | Damian Merrick, Joachim Gudmundsson: Increasing the readability of graph drawings with centrality-based scaling. APVIS 2006: 67-76 | |
62 | Marc 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 | |
61 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204 | |
60 | Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410 | |
59 | Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting Flock Patterns. ESA 2006: 660-671 | |
58 | Joachim Gudmundsson, Marc J. van Kreveld: Computing longest duration flocks in trajectory data. GIS 2006: 35-42 | |
57 | Joachim 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 | |
56 | Damian Merrick, Joachim Gudmundsson: Path Simplification for Metro Map Layout. Graph Drawing 2006: 258-269 | |
55 | Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick: Schematisation of Tree Drawings. Graph Drawing 2006: 66-76 | |
54 | Boris 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 | |
53 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 | |
52 | Joachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. SWAT 2006: 388-399 | |
51 | Prosenjit 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 | ||
50 | Mohammad Farshi, Joachim Gudmundsson: Experimental Study of Geometric t-Spanners. ESA 2005: 556-567 | |
49 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing interference-minimal networks. EuroCG 2005: 203-206 | |
48 | Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Finding the best shortcut in a geometric network. EuroCG 2005: 29-32 | |
47 | Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 | |
46 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520 | |
45 | Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Finding the best shortcut in a geometric network. Symposium on Computational Geometry 2005: 327-335 | |
44 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005) | |
43 | Boris 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) | |
42 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005) | |
41 | Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005) | |
40 | Mark 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 | ||
39 | Joachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004 | |
38 | Joachim Gudmundsson, Christos Levcopoulos: Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310 | |
37 | Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004: 250-257 | |
36 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64 | |
35 | Joachim Gudmundsson, Jan Vahrenhold: I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116 | |
34 | Joachim 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) | |
33 | Prosenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004) | |
32 | Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004) | |
2003 | ||
31 | Joachim Gudmundsson: Constructing Sparse t-Spanners with Small Separators. FCT 2003: 86-97 | |
30 | Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228 | |
29 | Mattias 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) | |
27 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003) | |
2002 | ||
26 | Joachim 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 | |
25 | Prosenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. CCCG 2002: 17-21 | |
24 | Mark 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 | |
23 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246 | |
22 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368 | |
21 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35 | |
20 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837 | |
19 | Herman 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) | |
17 | Pankaj 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) | |
16 | Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002) | |
15 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002) | |
2001 | ||
14 | Pankaj 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 | |
13 | Joachim 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 | |
10 | Joachim 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 | ||
8 | Joachim 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 |