default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSampson Wong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Joachim Gudmundsson
, Martin P. Seybold, Sampson Wong:
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. ACM Trans. Algorithms 20(2): 14 (2024)- [c18]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong:
Map-Matching Queries Under Fréchet Distance on Low-Density Spanners. SoCG 2024: 27:1-27:15 - [c17]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. SoCG 2024: 62:1-62:14 - [c16]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong:
Bicriteria Approximation for Minimum Dilation Graph Augmentation. ESA 2024: 36:1-36:15 - [c15]Joachim Gudmundsson, Tiancheng Mai, Sampson Wong:
Approximating the Fréchet Distance When Only One Curve Is c-Packed. ISAAC 2024: 37:1-37:14 - [c14]Ivor van der Hoog, Eva Rotenberg, Sampson Wong:
Data Structures for Approximate Fréchet Distance for Realistic Curves. ISAAC 2024: 56:1-56:18 - [c13]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong:
Dynamic L-Budget Clustering of Curves. SWAT 2024: 18:1-18:17 - [i19]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Spanner for the 0/1/∞ weighted region problem. CoRR abs/2407.01951 (2024) - [i18]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong:
Bicriteria approximation for minimum dilation graph augmentation. CoRR abs/2407.04614 (2024) - [i17]Joachim Gudmundsson, Tiancheng Mai, Sampson Wong:
Approximating the Fréchet distance when only one curve is c-packed. CoRR abs/2407.05114 (2024) - [i16]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong:
Map-Matching Queries under Fréchet Distance on Low-Density Spanners. CoRR abs/2407.19304 (2024) - 2023
- [j5]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the packedness of polygonal curves. Comput. Geom. 108: 101920 (2023) - [c12]Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the λ-low-density Value. COCOON (1) 2023: 71-82 - [c11]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. ESA 2023: 26:1-26:16 - [c10]André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. ESA 2023: 99:1-99:15 - [c9]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC 2023: 34:1-34:15 - [c8]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. SODA 2023: 1464-1492 - [i15]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. CoRR abs/2306.17097 (2023) - [i14]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-packed Trajectories. CoRR abs/2307.10610 (2023) - 2022
- [j4]Joachim Gudmundsson, Sampson Wong:
Improving the Dilation of a Metric Graph by Adding Edges. ACM Trans. Algorithms 18(3): 20:1-20:20 (2022) - [j3]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. Theor. Comput. Sci. 923: 74-98 (2022) - [c7]Kevin Buchin, André Nusser, Sampson Wong:
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. SoCG 2022: 22:1-22:16 - [c6]Joachim Gudmundsson, Sampson Wong:
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. SODA 2022: 173-189 - [i13]Kevin Buchin, André Nusser, Sampson Wong:
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time. CoRR abs/2203.04531 (2022) - [i12]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. CoRR abs/2211.02951 (2022) - [i11]Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the lambda-low-density value. CoRR abs/2211.07039 (2022) - [i10]André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. CoRR abs/2211.11987 (2022) - [i9]Ivor van der Hoog, Eva Rotenberg, Sampson Wong:
Approximate Discrete Fréchet distance: simplified, extended and structured. CoRR abs/2212.07124 (2022) - 2021
- [j2]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. Algorithmica 83(11): 3514-3533 (2021) - [c5]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a Set of Line Segments with a Few Squares. CIAC 2021: 286-299 - [c4]Joachim Gudmundsson, Sampson Wong:
Improving the dilation of a metric graph by adding edges. SODA 2021: 675-683 - [i8]Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. CoRR abs/2101.09913 (2021) - [i7]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. CoRR abs/2102.05844 (2021) - [i6]Joachim Gudmundsson, Sampson Wong:
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. CoRR abs/2110.15554 (2021) - [i5]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. CoRR abs/2112.12350 (2021) - 2020
- [c3]Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong:
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. SIGSPATIAL/GIS 2020: 99-110 - [c2]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the Packedness of Polygonal Curves. ISAAC 2020: 9:1-9:15 - [i4]Joachim Gudmundsson, Sampson Wong:
Improving the dilation of a metric graph by adding edges. CoRR abs/2007.12350 (2020) - [i3]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the packedness of polygonal curves. CoRR abs/2009.07789 (2020) - [i2]Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong:
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping. CoRR abs/2012.00464 (2020)
2010 – 2019
- 2019
- [c1]Joachim Gudmundsson, Sampson Wong:
Computing the Yolk in Spatial Voting Games without Computing Median Lines. AAAI 2019: 2012-2019 - [i1]Joachim Gudmundsson, Sampson Wong:
Computing the Yolk in Spatial Voting Games without Computing Median Lines. CoRR abs/1902.04735 (2019) - 2016
- [j1]Stephan Tillmann, Sampson Wong:
An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface. J. Comput. Geom. 7(1): 237-255 (2016)
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-12-05 21:38 CET 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:
