Jorg-Rudiger Sack
Affiliations: | Carleton University, Ottawa, Canada |
Area:
Computer ScienceGoogle:
"Jorg-Rudiger Sack"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Maheshwari A, Nouri A, Sack J. (2020) Shortest paths among transient obstacles Journal of Combinatorial Optimization. 1-39 |
| Gheibi A, Maheshwari A, Sack J. (2019) Weighted minimum backward Fréchet distance Theoretical Computer Science. 783: 9-21 |
| Maheshwari A, Sack J, Scheffer C. (2018) Approximating the integral Fréchet distance Computational Geometry: Theory and Applications. 13-30 |
| Gheibi A, Maheshwari A, Sack J, et al. (2018) Path Refinement in Weighted Regions Algorithmica. 80: 3766-3802 |
| De Carufel JL, Gheibi A, Maheshwari A, et al. (2014) Similarity of polygonal curves in the presence of outliers Computational Geometry: Theory and Applications. 47: 625-641 |
| Maheshwari A, Sack JR, Shahbaz K, et al. (2014) Improved algorithms for partial curve matching Algorithmica. 69: 641-657 |
| Omran MT, Sack JR, Zarrabi-Zadeh H. (2013) Finding paths with minimum shared edges Journal of Combinatorial Optimization. 26: 709-722 |
| Aleksandrov L, Djidjev H, Maheshwari A, et al. (2013) An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains Discrete and Computational Geometry. 50: 124-184 |
| Nussbaum D, Pu S, Sack JR, et al. (2012) Finding maximum edge bicliques in convex bipartite graphs Algorithmica. 64: 311-325 |
| Dehne F, Omran MT, Sack JR. (2012) Shortest paths in time-dependent fifo networks Algorithmica (New York). 62: 416-435 |