default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg-Rüdiger Sack
Person information
- affiliation: Carleton University, Ottawa, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j73]Hee-Kap Ahn
, Tamara Mtsentlintze, Jörg-Rüdiger Sack:
CGTA Awards. Comput. Geom. 107: 101896 (2022)- [j72]Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. Comput. Geom. 107: 101897 (2022) - [j71]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A new model and algorithms in firefighting theory. Discret. Appl. Math. 319: 296-309 (2022) - [j70]William L. Croft, Jörg-Rüdiger Sack, Wei Shi:
Differentially private facial obfuscation via generative adversarial networks. Future Gener. Comput. Syst. 129: 358-379 (2022) - [j69]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Shortest paths among transient obstacles. J. Comb. Optim. 43(5): 1036-1074 (2022) - [j68]William L. Croft, Jörg-Rüdiger Sack, Wei Shi:
Differential Privacy via a Truncated and Normalized Laplace Mechanism. J. Comput. Sci. Technol. 37(2): 369-388 (2022) - [j67]William L. Croft, Jörg-Rüdiger Sack:
Predicting the citation count and CiteScore of journals one year in advance. J. Informetrics 16(4): 101349 (2022) - [i22]William L. Croft, Jörg-Rüdiger Sack:
Predicting the Citation Count and CiteScore of Journals One Year in Advance. CoRR abs/2210.12908 (2022) - 2021
- [j66]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica 83(3): 775 (2021) - [j65]Mohammad Khodizadeh Nahari, Nasser Ghadiri, Ahmad Baraani-Dastjerdi, Jörg-Rüdiger Sack:
A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions. Appl. Intell. 51(8): 6104-6123 (2021) - [j64]William L. Croft, Jörg-Rüdiger Sack, Wei Shi:
Obfuscation of images via differential privacy: From facial images to general images. Peer-to-Peer Netw. Appl. 14(3): 1705-1733 (2021) - [i21]William L. Croft, Jörg-Rüdiger Sack, Wei Shi:
Obfuscation of Images via Differential Privacy: From Facial Images to General Images. CoRR abs/2102.11072 (2021) - 2020
- [j63]Faith Ellen, Jörg-Rüdiger Sack:
Preface. Comput. Geom. 89: 101632 (2020) - [j62]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Preface. Comput. Geom. 91: 101671 (2020) - [j61]William Lee Croft, Jörg-Rüdiger Sack, Wei Shi:
The Impact of Range Constraints on Utility in the Design of Differentially Private Mechanisms. Trans. Data Priv. 13(3): 171-200 (2020) - [c57]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CALDAM 2020: 371-383 - [c56]Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. LATIN 2020: 235-246
2010 – 2019
- 2019
- [j60]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted minimum backward Fréchet distance. Theor. Comput. Sci. 783: 9-21 (2019) - [c55]William L. Croft, Jörg-Rüdiger Sack, Wei Shi:
Differentially Private Obfuscation of Facial Images. CD-MAKE 2019: 229-249 - [e21]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Lecture Notes in Computer Science 11646, Springer 2019, ISBN 978-3-030-24765-2 [contents] - [i20]William Lee Croft, Jörg-Rüdiger Sack, Wei Shi:
Differential Privacy Via a Truncated and Normalized Laplace Mechanism. CoRR abs/1911.00602 (2019) - [i19]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CoRR abs/1911.10341 (2019) - 2018
- [j59]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Path Refinement in Weighted Regions. Algorithmica 80(12): 3766-3802 (2018) - [j58]Jörg-Rüdiger Sack:
Editor's note. Comput. Geom. 69: 1 (2018) - [j57]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the integral Fréchet distance. Comput. Geom. 70-71: 13-30 (2018) - [c54]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CCCG 2018: 288-295 - [c53]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. COCOA 2018: 19-34 - [i18]Arash Nouri, Jörg-Rüdiger Sack:
Query Shortest Paths Amidst Growing Discs. CoRR abs/1804.01181 (2018) - [i17]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CoRR abs/1808.01984 (2018) - [i16]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. CoRR abs/1809.08898 (2018) - 2017
- [j56]William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau:
Comparison of approaches of geographic partitioning for data anonymization. J. Geogr. Syst. 19(3): 221-248 (2017) - [j55]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Maintaining anonymity using -privacy. J. Locat. Based Serv. 11(1): 1-28 (2017) - [e20]Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings. Lecture Notes in Computer Science 10389, Springer 2017, ISBN 978-3-319-62126-5 [contents] - 2016
- [j54]William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau:
Location-based anonymization: comparison and evaluation of the Voronoi-based aggregation system. Int. J. Geogr. Inf. Sci. 30(11): 2253-2275 (2016) - [c52]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. SWAT 2016: 26:1-26:14 - 2015
- [c51]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Minimum Backward Frechet Distance. CCCG 2015 - [c50]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Minimizing Walking Length in Map Matching. TTCS 2015: 105-120 - [e19]Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege:
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science 9214, Springer 2015, ISBN 978-3-319-21839-7 [contents] - [i15]William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau:
Geographic Partitioning Techniques for the Anonymization of Health Care Data. CoRR abs/1505.06786 (2015) - [i14]William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau:
A Novel Geographic Partitioning System for Anonymizing Health Care Data. CoRR abs/1505.06939 (2015) - [i13]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. CoRR abs/1512.03359 (2015) - 2014
- [j53]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014) - [j52]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. Comput. Geom. 47(3): 435-446 (2014) - [j51]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014) - [c49]Masoud T. Omran, Jörg-Rüdiger Sack:
Improved Approximation for Time-Dependent Shortest Paths. COCOON 2014: 453-464 - [c48]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Minimum backward fréchet distance. SIGSPATIAL/GIS 2014: 381-388 - 2013
- [j50]Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. 50(1): 124-184 (2013) - [j49]Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
Finding paths with minimum shared edges. J. Comb. Optim. 26(4): 709-722 (2013) - [c47]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Region Problem in Arrangement of Lines. CCCG 2013 - [e18]Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science 8037, Springer 2013, ISBN 978-3-642-40103-9 [contents] - [i12]Matt Duckham, Stefan Dulman, Jörg-Rüdiger Sack, Monika Sester:
Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492). Dagstuhl Reports 3(12): 17-42 (2013) - 2012
- [j48]Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack:
Shortest Paths in Time-Dependent FIFO Networks. Algorithmica 62(1-2): 416-435 (2012) - [j47]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012) - [j46]Kurt Mehlhorn, Jörg-Rüdiger Sack:
CGTA-Awards 2011. Comput. Geom. 45(4): 139 (2012) - [c46]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Techniques to protect privacy against inference attacks in location based services. IWGS@SIGSPATIAL/GIS 2012: 58-67 - [c45]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. SWAT 2012: 1-12 - [i11]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012) - [i10]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012) - 2011
- [j45]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011) - [j44]Jörg-Rüdiger Sack:
Editorial. J. Spatial Inf. Sci. 3(1): 1-2 (2011) - [j43]Matt Duckham, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Trans. Computers 60(8): 1100-1113 (2011) - [c44]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Staying Close to a Curve. CCCG 2011 - [c43]Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
Finding Paths with Minimum Shared Edges. COCOON 2011: 567-578 - [c42]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529 - [e17]Frank Dehne, John Iacono, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6844, Springer 2011, ISBN 978-3-642-22299-3 [contents] - [i9]Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011) - 2010
- [j42]Kurt Mehlhorn, Jörg-Rüdiger Sack:
Editorial. Comput. Geom. 43(6-7): 555 (2010) - [j41]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44(4): 762-801 (2010) - [c41]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182 - [c40]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149 - [e16]Jörg-Rüdiger Sack, Bettina Speckmann, E. Emiel van Loon, Robert Weibel:
Representation, Analysis and Visualization of Moving Objects, 05.12. - 10.12.2010. Dagstuhl Seminar Proceedings 10491, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i8]Mark de Berg, Jörg-Rüdiger Sack, Bettina Speckmann, Anne Driemel, Maike Buchin, Monika Sester, Marc J. van Kreveld:
10491 Results of the break-out group: Aggregation. Representation, Analysis and Visualization of Moving Objects 2010 - [i7]Emiel van Loon, Jörg-Rüdiger Sack, Kevin Buchin, Maike Buchin, Mark de Berg, Marc J. van Kreveld, Joachim Gudmundsson, David M. Mountain:
10491 Results of the break-out group: Gulls Data. Representation, Analysis and Visualization of Moving Objects 2010 - [i6]Jörg-Rüdiger Sack, Bettina Speckmann, E. Emiel van Loon, Robert Weibel:
10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects 2010 - [i5]Jörg-Rüdiger Sack, Bettina Speckmann, Emiel van Loon, Robert Weibel:
10491 Summary - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects 2010
2000 – 2009
- 2009
- [j40]Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks:
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. 42(6-7): 722 (2009) - [j39]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A meeting scheduling problem respecting time and space. GeoInformatica 13(4): 453-481 (2009) - [c39]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110 - [c38]Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack:
Shortest paths in time-dependent FIFO networks using edge load forecasts. GIS-IWCTS 2009: 1-6 - [e15]Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth:
Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5664, Springer 2009, ISBN 978-3-642-03366-7 [contents] - 2008
- [j38]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Introduction to Special Issue. Algorithmica 50(2): 173-174 (2008) - [c37]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A Meeting Scheduling Problem Respecting Time and Space. AAIM 2008: 50-59 - [c36]Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211 - [e14]Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel:
Representation, Analysis and Visualization of Moving Objects, 02.11. - 07.11.2008. Dagstuhl Seminar Proceedings 08451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i4]Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel:
08451 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects 2008 - [i3]Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel:
08451 Summary Report - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects 2008 - 2007
- [j37]Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007) - [c35]Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack:
GlobeCon - A Scalable Framework for Context Aware Computing. EuroSSC 2007: 190-206 - [c34]Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95 - [c33]Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680 - [e13]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh:
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4619, Springer 2007, ISBN 978-3-540-73948-7 [contents] - 2006
- [c32]Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
How to Fit In Another Meeting. CollaborateCom 2006 - [c31]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - [e12]Jörg-Rüdiger Sack, Monika Sester, Peter van Oosterom, Michael F. Worboys:
Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006. Dagstuhl Seminar Proceedings 06101, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i2]Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom:
06101 Report -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating 2006 - [i1]Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom:
06101 Abstracts Collection -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating 2006 - 2005
- [j36]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005) - [c30]Doron Nussbaum, Jörg-Rüdiger Sack, Hua Ye:
Concurrent Parallel Shortest Path Computation. PARCO 2005: 277-284 - [e11]Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack:
Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings. Lecture Notes in Computer Science 3608, Springer 2005, ISBN 3-540-28101-0 [contents] - 2004
- [c29]Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack:
Floating-Point Filter for the Line Intersection Algorithm. GIScience 2004: 94-105 - 2003
- [j35]Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack:
Parallel implementation of geometric shortest path algorithms. Parallel Comput. 29(10): 1445-1479 (2003) - [c28]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257 - [e10]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid:
Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Lecture Notes in Computer Science 2748, Springer 2003, ISBN 3-540-40545-3 [contents] - 2001
- [j34]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001) - [j33]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Ray shooting from convex ranges. Discret. Appl. Math. 108(3): 259-267 (2001) - [e9]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia:
Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Lecture Notes in Computer Science 2125, Springer 2001, ISBN 3-540-42423-7 [contents] - 2000
- [j32]Kurt Mehlhorn, Jörg-Rüdiger Sack:
Editorial. Comput. Geom. 17(1-2): 1-2 (2000) - [j31]Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. 10(2): 157-188 (2000) - [c27]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295 - [p1]Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev:
Link Distance Problems. Handbook of Computational Geometry 2000: 519-558 - [e8]Jörg-Rüdiger Sack, Jorge Urrutia:
Handbook of Computational Geometry. North Holland / Elsevier 2000, ISBN 978-0-444-82537-7 [contents]
1990 – 1999
- 1999
- [j30]Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia:
Editorial. Comput. Geom. 12(3-4): 153-154 (1999) - [j29]C. Hecker, David Roytenberg, Jörg-Rüdiger Sack, Z. Wang:
System development for parallel cellular automata and its applications. Future Gener. Comput. Syst. 16(2-3): 235-247 (1999) - [j28]M. D. Atkinson, Jörg-Rüdiger Sack:
Pop-Stacks in Parallel. Inf. Process. Lett. 70(2): 63-67 (1999) - [j27]Anil Maheshwari, Jörg-Rüdiger Sack:
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Process. Lett. 9(1): 31-42 (1999) - [c26]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533 - [e7]Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia:
Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0 [contents] - 1998
- [c25]Mohammad Ghodsi, Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification. CCCG 1998 - [c24]Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22 - 1997
- [j26]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations. Discret. Appl. Math. 75(1): 71-80 (1997) - [j25]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997) - [c23]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG 1997: 274-283 - [c22]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG 1997: 485-486 - [c21]Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack:
Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29 - [c20]David A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu:
Early Experiences in Implementing the Buffer Tree. WAE 1997: 92-103 - [e6]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia:
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Lecture Notes in Computer Science 1272, Springer 1997, ISBN 3-540-63307-3 [contents] - 1996
- [j24]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996) - [c19]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34 - [c18]David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. SPAA 1996: 204-207 - [e5]Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack:
Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996. Carleton University Press 1996, ISBN 0-88629-307-3 [contents] - 1995
- [j23]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995) - [j22]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Natana Valiveti, Boris Flach:
Analog Parallel Algorithms for Computational Geometry. Parallel Algorithms Appl. 5(1-2): 1-14 (1995) - [c17]Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. CCCG 1995: 43-48 - [c16]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231 - [e4]Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro:
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8 [contents] - 1994
- [j21]Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack:
A Workbench for Computational Geometry. Algorithmica 11(4): 404-428 (1994) - [j20]M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994) - [j19]M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Binary Trees in Parallel. J. Parallel Distributed Comput. 23(1): 101-103 (1994) - [j18]Peter Epstein, Jörg-Rüdiger Sack:
Generating Triangulations at Random. ACM Trans. Model. Comput. Simul. 4(3): 267-278 (1994) - 1993
- [j17]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling two-dimensional composite parts via translations. Int. J. Comput. Geom. Appl. 3(1): 71-84 (1993) - [c15]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA 1993: 109-120 - [c14]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack:
Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72 - [e3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8 [contents] - 1992
- [j16]Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 8: 131-152 (1992) - [j15]Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack:
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geom. Appl. 2(3): 221-239 (1992) - [j14]M. D. Atkinson, Jörg-Rüdiger Sack:
Generating Binary Trees at Random. Inf. Process. Lett. 41(1): 21-23 (1992) - 1991
- [j13]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro:
Computational Geometry Algorithms for the Systolic Screen. Algorithmica 6(5): 734-761 (1991) - [e2]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro:
Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings. Lecture Notes in Computer Science 519, Springer 1991, ISBN 3-540-54343-0 [contents] - 1990
- [j12]Jörg-Rüdiger Sack, Thomas Strothotte:
A Characterization of Heaps and Its Applications. Inf. Comput. 86(1): 69-86 (1990) - [j11]Jörg-Rüdiger Sack, Subhash Suri:
An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers 39(10): 1213-1219 (1990) - [c13]A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack:
A Computational geometry Workbench. SCG 1990: 370
1980 – 1989
- 1989
- [j10]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack:
Computing the configuration space for a robot on a mesh-of-processors. Parallel Comput. 12(2): 221-231 (1989) - [j9]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack:
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. 66(2): 181-203 (1989) - [c12]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack:
Computing the Configuration Space for a Robot on a Mesh-of-Processors. ICPP (3) 1989: 40-47 - [c11]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms 1989: 153-167 - [c10]Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107 - [e1]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro:
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings. Lecture Notes in Computer Science 382, Springer 1989, ISBN 3-540-51542-9 [contents] - 1988
- [j8]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - [j7]James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack:
Recognizing polygons, or how to spy. Vis. Comput. 3(6): 344-355 (1988) - [c9]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
A survey of paralle computational geometry algorithms. Parcella 1988: 73-88 - [c8]Jörg-Rüdiger Sack, Subhash Suri:
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS 1988: 312-321 - [c7]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic:
A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. SWAT 1988: 154-162 - [c6]Otto Nurmi, Jörg-Rüdiger Sack:
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). WG 1988: 202-212 - 1987
- [j6]A. Hasham, Jörg-Rüdiger Sack:
Bounds for Min-Max Heaps. BIT 27(3): 315-323 (1987) - [j5]Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack:
Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987) - [j4]Jörg-Rüdiger Sack, Godfried T. Toussaint:
Separability of pairs of polygons through single translations. Robotica 5(1): 55-63 (1987) - [j3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Translation separability of sets of polygons. Vis. Comput. 3(4): 227-235 (1987) - [c5]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - [c4]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack:
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385 - [c3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro:
Computing on a Systolic Screen: Hulls, Contours and Applications. PARLE (1) 1987: 121-133 - 1986
- [j2]M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte:
Min-Max Heaps and Generalized Priority Queues. Commun. ACM 29(10): 996-1000 (1986) - [c2]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Seperability of Sets of Polygons. WG 1986: 237-251 - 1985
- [j1]Jörg-Rüdiger Sack, Thomas Strothotte:
An Algorithm for Merging Heaps. Acta Informatica 22(2): 171-186 (1985) - [c1]Jörg-Rüdiger Sack, Godfried T. Toussaint:
Translating Polygons in the Plane. STACS 1985: 310-321
Coauthor Index
William L. Croft
aka: William Lee Croft
aka: William Lee Croft
Frank Dehne
aka: Frank K. H. A. Dehne
aka: Frank K. H. A. Dehne
[j72] [j69] [c56] [j60] [j59] [j57] [c54] [c53] [i17] [i16] [c52] [c51] [c50] [i13] [j53] [j52] [j51] [c48] [j50] [c47] [c45] [i11] [i10] [j45] [c44] [c42] [i9] [j41] [c41] [c39] [c36] [c34] [c33] [c31] [j36] [c28] [j34] [j33] [c27] [p1] [j27] [c26] [c24] [j26] [j25] [c23] [c22] [c21] [c20] [j24] [c19] [c18] [j23] [c17] [c16] [c15] [c14]
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 2025-01-09 13:20 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:
