default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Wolle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[r2]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Movement Patterns in Spatio-Temporal Data. Encyclopedia of GIS 2017: 1362-1370- 2014
- [j12]Joachim Gudmundsson
, Thomas Wolle:
Football analysis using spatio-temporal tools. Comput. Environ. Urban Syst. 47: 16-27 (2014) - 2012
- [j11]Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle:
Approximate one-to-one point pattern matching. J. Discrete Algorithms 15: 1-15 (2012) - [c14]Joachim Gudmundsson, Thomas Wolle:
Football analysis using spatio-temporal tools. SIGSPATIAL/GIS 2012: 566-569 - [p1]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Computational Movement Analysis. Springer Handbook of Geographic Information 2012: 423-438 - 2011
- [j10]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. Algorithmica 60(4): 829-852 (2011) - [j9]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j8]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32): 4173-4186 (2011) - 2010
- [j7]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. Int. J. Comput. Geom. Appl. 20(1): 19-42 (2010) - [j6]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) - [c13]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. CATS 2010: 19-24
2000 – 2009
- 2009
- [j5]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009) - [j4]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42(9): 939-951 (2009) - [c12]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 - [c11]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The Directed Hausdorff Distance between Imprecise Point Sets. ISAAC 2009: 720-729 - [i2]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009) - [i1]Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle:
The directed Hausdorff distance between imprecise point sets. CoRR abs/0909.4642 (2009) - 2008
- [j3]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008) - [j2]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008) - [c10]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. ESA 2008: 344-355 - [c9]Patrick Laube, Matt Duckham, Thomas Wolle:
Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes. GIScience 2008: 199-216 - [r1]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Movement Patterns in Spatio-temporal Data. Encyclopedia of GIS 2008: 726-732 - 2007
- [c8]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775 - [c7]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. ISAAC 2007: 776-787 - [c6]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting leadership patterns among trajectories. SAC 2007: 3-7 - 2006
- [j1]Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster:
Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006) - [c5]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting Flock Patterns. ESA 2006: 660-671 - [c4]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA 2006: 69-82 - 2005
- [b1]Thomas Wolle:
Computational aspects of treewidth : Lower bounds and network reliability. Utrecht University, Netherlands, 2005 - [c3]Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender:
Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112 - 2004
- [c2]Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle:
Contraction and Treewidth Lower Bounds. ESA 2004: 628-639 - 2002
- [c1]Thomas Wolle:
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. ISAAC 2002: 137-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
