Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Joachim Gudmundsson
2010 – today
- 2013
[j54]Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson: Fast Fréchet queries. Comput. Geom. 46(6): 747-755 (2013)- [j53]Radwa El Shawi, Joachim Gudmundsson: Fast query structures in anisotropic media. Theor. Comput. Sci. 497: 112-122 (2013)
- [c72]Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson: A Fast Algorithm for Data Collection along a Fixed Track. COCOON 2013: 77-88
- [c71]
- [i15]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson: SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR abs/1309.4713 (2013)
- [i14]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson: Augmenting graphs to minimize the diameter. CoRR abs/1309.5172 (2013)
- 2012
- [j52]Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle: Approximate one-to-one point pattern matching. J. Discrete Algorithms 15: 1-15 (2012)
- [c70]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos: Quickest Path Queries on Transportation Network. CATS 2012: 37-46
- [c69]Joachim Gudmundsson, Andreas Thom, Jan Vahrenhold: Of motifs and goals: mining trajectory data. SIGSPATIAL/GIS 2012: 129-138
- [c68]Joachim Gudmundsson, Nacho Valladares: A GPU approach to subtrajectory clustering using the Fréchet distance. SIGSPATIAL/GIS 2012: 259-268
- [c67]Joachim Gudmundsson, Thomas Wolle: Football analysis using spatio-temporal tools. SIGSPATIAL/GIS 2012: 566-569
- [c66]Weisheng Si, Bernhard Scholz, Joachim Gudmundsson, Guoqiang Mao, Roksana Boreli, Albert Y. Zomaya: On graphs supporting greedy forwarding for directional wireless networks. ICC 2012: 751-756
- [c65]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl: On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422
- [c64]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron: A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12
- [e5]Joachim Gudmundsson, Julián Mestre, Taso Viglas (Eds.): Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Lecture Notes in Computer Science 7434, Springer 2012, ISBN 978-3-642-32240-2
- [i13]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron: A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012)
- [i12]Joachim Gudmundsson, Patrick Laube, Emiel Van Loon: Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512). Dagstuhl Reports 2(12): 89-106 (2012)
- 2011
- [j51]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle: Detecting Regular Visit Patterns. Algorithmica 60(4): 829-852 (2011)
- [j50]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization. Algorithmica 60(4): 1004-1016 (2011)
- [j49]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011)
- [j48]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on Large Angle Crossing Graphs. Chicago J. Theor. Comput. Sci. 2011 (2011)
- [j47]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011)
- [j46]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. Int. J. Comput. Geometry Appl. 21(3): 253-282 (2011)
- [c63]
- [c62]
- [p1]Radwa El Shawi, Joachim Gudmundsson: Shortest Path in Transportation Network and Weighted Subdivisions. Graph Data Management 2011: 463-474
- 2010
- [j45]
- [j44]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Comput. Geom. 43(3): 251-256 (2010)
- [j43]Kevin Buchin, Maike Buchin, Joachim Gudmundsson: Constrained free space diagrams: a tool for trajectory analysis. International Journal of Geographical Information Science 24(7): 1101-1125 (2010)
- [j42]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle: Finding Popular Places. Int. J. Comput. Geometry Appl. 20(1): 19-42 (2010)
- [j41]Fabian Gieseke, Joachim Gudmundsson, Jan Vahrenhold: Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. J. Discrete Algorithms 8(3): 259-272 (2010)
- [j40]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010)
- [c61]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on Large Angle Crossing Graphs. CATS 2010: 19-24
- [c60]
- [c59]Joachim Gudmundsson, Pat Morin: Planar visibility: testing and counting. Symposium on Computational Geometry 2010: 77-86
- [i11]
- [i10]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)
- [i9]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos: Quickest Path Queries on Transportation Network. CoRR abs/1012.0634 (2010)
2000 – 2009
- 2009
- [j39]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009)
- [j38]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009)
- [j37]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-Fault Tolerant Geometric Spanners. Discrete & Computational Geometry 41(4): 556-582 (2009)
- [j36]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geometry Appl. 19(3): 247-265 (2009)
- [j35]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)
- [j34]
- [j33]Joachim Gudmundsson, Michiel H. M. Smid: On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009)
- [j32]Mohammad Farshi, Joachim Gudmundsson: Experimental study of geometric t-spanners. ACM Journal of Experimental Algorithmics 14 (2009)
- [c58]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
- [c57]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202
- [c56]Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn: Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112
- [i8]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid: Algorithms for Marketing-Mix Optimization. CoRR abs/0903.0308 (2009)
- [i7]Luc Devroye, Joachim Gudmundsson, Pat Morin: On the Expected Maximum Degree of Gabriel and Yao Graphs. CoRR abs/0905.3584 (2009)
- [i6]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009)
- 2008
- [j31]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008)
- [j30]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)
- [j29]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008)
- [j28]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)
- [j27]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008)
- [j26]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)
- [j25]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1) (2008)
- [c55]Matthew Asquith, Joachim Gudmundsson, Damian Merrick: An ILP for the metro-line crossing problem. CATS 2008: 49-56
- [c54]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Symposium on Computational Geometry 2008: 306-310
- [c53]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle: Detecting Regular Visit Patterns. ESA 2008: 344-355
- [c52]
- [c51]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655
- [e4]Joachim Gudmundsson (Ed.): Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings. Lecture Notes in Computer Science 5124, Springer 2008, ISBN 978-3-540-69900-2
- [r4]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
- [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
- [r2]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
- [r1]Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Movement Patterns in Spatio-temporal Data. Encyclopedia of GIS 2008: 726-732
- 2007
- [j24]Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann: Editorial. Comput. Geom. 36(1): 1 (2007)
- [j23]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
- [j22]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007)
- [j21]Joachim Gudmundsson, Christos Levcopoulos: Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007)
- [j20]Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient Detection of Patterns in 2D Trajectories of Moving Points. GeoInformatica 11(2): 195-215 (2007)
- [j19]
- [c50]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
- [c49]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
- [c48]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775
- [c47]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle: Finding Popular Places. ISAAC 2007: 776-787
- [c46]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle: Reporting leadership patterns among trajectories. SAC 2007: 3-7
- [c45]Ghazi Al-Naymat, Sanjay Chawla, Joachim Gudmundsson: Dimensionality reduction for long duration and complex spatio-temporal queries. SAC 2007: 393-397
- [c44]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-fault tolerant geometric spanners. SODA 2007: 1-10
- [c43]Mohammad Farshi, Joachim Gudmundsson: Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284
- [e3]Joachim Gudmundsson, C. Barry Jay (Eds.): Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings. CRPIT 65, Australian Computer Society 2007, ISBN 1-920-68246-5
- [e2]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff (Eds.): Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [i5]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)
- [i4]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson: Aperture-Angle and Hausdorff-Approximation of Convex Figures. CoRR abs/cs/0702090 (2007)
- 2006
- [j18]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)
- [c42]Damian Merrick, Joachim Gudmundsson: Increasing the readability of graph drawings with centrality-based scaling. APVIS 2006: 67-76
- [c41]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
- [c40]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204
- [c39]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
- [c38]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410
- [c37]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle: Reporting Flock Patterns. ESA 2006: 660-671
- [c36]Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick: Schematisation of Tree Drawings. Graph Drawing 2006: 66-76
- [c35]Damian Merrick, Joachim Gudmundsson: Path Simplification for Metro Map Layout. Graph Drawing 2006: 258-269
- [c34]Joachim Gudmundsson, Marc J. van Kreveld: Computing longest duration flocks in trajectory data. GIS 2006: 35-42
- [c33]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
- [c32]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176
- [c31]
- [e1]Joachim Gudmundsson, C. Barry Jay (Eds.): Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. CRPIT 51, Australian Computer Society 2006, ISBN 1-920682-33-3
- 2005
- [j17]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005)
- [j16]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005)
- [j15]Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005)
- [j14]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)
- [c30]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Finding the best shortcut in a geometric network. Symposium on Computational Geometry 2005: 327-335
- [c29]
- [c28]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59
- [c27]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
- [i3]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson: Finding the best shortcut in a geometric network. EuroCG 2005: 29-32
- [i2]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing interference-minimal networks. EuroCG 2005: 203-206
- [i1]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)
- 2004
- [j13]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)
- [j12]Prosenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004)
- [j11]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)
- [c26]Joachim Gudmundsson, Jan Vahrenhold: A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004
- [c25]Joachim Gudmundsson, Christos Levcopoulos: Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310
- [c24]Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004: 250-257
- [c23]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64
- [c22]
- 2003
- [j10]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003)
- [j9]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
- [c21]
- [c20]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
- [c19]
- 2002
- [j8]Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002)
- [j7]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)
- [j6]Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002)
- [j5]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
- [c18]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
- [c17]
- [c16]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62
- [c15]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
- [c14]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid: Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246
- [c13]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
- [c12]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
- [c11]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
- 2001
- [j4]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
- [c10]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
- 2000
- [j3]Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000)
- [c9]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178
- [c8]Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher Order Delaunay Triangulations. ESA 2000: 232-243
- [c7]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
1990 – 1999
- 1999
- [j2]Joachim Gudmundsson, Christos Levcopoulos: Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999)
- [j1]Joachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999)
- [c6]Joachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482
- [c5]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
- 1998
- [c4]Joachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244
- 1997
- [c3]Christos Levcopoulos, Joachim Gudmundsson: A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316
- [c2]Christos Levcopoulos, Joachim Gudmundsson: Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41
- 1996
- [c1]Christos Levcopoulos, Joachim Gudmundsson: Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16 21:27 CEST by the dblp team