| Approximating the Fr\'echet distance when only one curve is -packed J Gudmundsson, M Mai, S Wong arXiv preprint arXiv:2407.05114, 2024 | | 2024 |
| Bicriteria approximation for minimum dilation graph augmentation K Buchin, M Buchin, J Gudmundsson, S Wong arXiv preprint arXiv:2407.04614, 2024 | | 2024 |
| Spanner for the weighted region problem J Gudmundsson, Z Huang, A van Renssen, S Wong arXiv preprint arXiv:2407.01951, 2024 | | 2024 |
| Map matching queries on realistic input graphs under the Fréchet distance J Gudmundsson, MP Seybold, S Wong ACM Transactions on Algorithms 20 (2), 1-33, 2024 | 6 | 2024 |
| Dynamic L-Budget Clustering of Curves K Buchin, M Buchin, J Gudmundsson, L Plätz, L Thiel, S Wong 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), 2024 | | 2024 |
| Map-Matching Queries Under Fréchet Distance on Low-Density Spanners K Buchin, M Buchin, J Gudmundsson, A Popov, S Wong 40th International Symposium on Computational Geometry (SoCG 2024), 2024 | 2 | 2024 |
| Approximating the -low-density Value J Gudmundsson, Z Huang, S Wong International Computing and Combinatorics Conference, 71-82, 2023 | | 2023 |
| Computing in Geometry and Topology B Aronov, A Basit, M de Berg, J Gudmundsson Computing in Geometry and Topology 2, 2023 | | 2023 |
| Algorithms for radius-optimally augmenting trees in a metric space J Gudmundsson, Y Sha Computational Geometry 114, 102018, 2023 | 4 | 2023 |
| Shortest Paths of Mutually Visible Robots RJ Alsaedi, J Gudmundsson, A van Renssen arXiv preprint arXiv:2309.16901, 2023 | | 2023 |
| Pattern Formation for Fat Robots with Memory RJ Alsaedi, J Gudmundsson, A van Renssen arXiv preprint arXiv:2309.14649, 2023 | | 2023 |
| Augmenting graphs to minimize the radius J Gudmundsson, Y Sha Computational Geometry 113, 101996, 2023 | 5 | 2023 |
| Approximating the Discrete Center Line Segment in Linear Time J Gudmundsson, Y Sha Algorithms and Data Structures Symposium, 660-674, 2023 | | 2023 |
| The mutual visibility problem for fat robots RJ Alsaedi, J Gudmundsson, A van Renssen Algorithms and Data Structures Symposium, 15-28, 2023 | 4 | 2023 |
| Computing a Subtrajectory Cluster from c-packed Trajectories J Gudmundsson, Z Huang, A van Renssen, S Wong arXiv preprint arXiv:2307.10610, 2023 | 1 | 2023 |
| Oriented Spanners K Buchin, J Gudmundsson, A Kalb, A Popov, C Rehs, A van Renssen, ... arXiv preprint arXiv:2306.17097, 2023 | 1 | 2023 |
| Pattern Formation for Fat Robots with Lights RJ Alsaedi, J Gudmundsson, A van Renssen arXiv preprint arXiv:2306.14440, 2023 | | 2023 |
| On practical nearest sub-trajectory queries under the Fréchet distance J Gudmundsson, J Pfeifer, MP Seybold ACM Transactions on Spatial Algorithms and Systems 9 (2), 1-24, 2023 | 8 | 2023 |
| 39th International Symposium on Computational Geometry: SoCG 2023, June 12-15, 2023, Dallas, Texas, USA EW Chambers, J Gudmundsson Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| Shortest Beer Path Queries in Digraphs with Bounded Treewidth J Gudmundsson, Y Sha 34th International Symposium on Algorithms and Computation (ISAAC 2023), 2023 | 1 | 2023 |
Mark de BergProfessor of Computer Science, TU EindhovenVerified email at win.tue.nl