Jörg-Rüdiger Sack

175 papers A* 4A 5B 23C 5Misc 3Journal 88Unranked 41

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Finding All Bounded-Length Simple Cycles in a Directed Graph - Revisited. CoRR Frank Bauernöppel, Jörg-Rüdiger Sack
2022	J	`jnl`	A new model and algorithms in firefighting theory. Discret. Appl. Math. Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald
2022	J	`jnl`	An Ω( Comput. Geom. Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
2022	J	`jnl`	CGTA Awards. Comput. Geom. Hee-Kap Ahn, Tamara Mtsentlintze, Jörg-Rüdiger Sack
2022	J	`jnl`	Differential Privacy via a Truncated and Normalized Laplace Mechanism. J. Comput. Sci. Technol. William L. Croft, Jörg-Rüdiger Sack, Wei Shi
2022	J	`jnl`	Differentially private facial obfuscation via generative adversarial networks. Future Gener. Comput. Syst. William L. Croft, Jörg-Rüdiger Sack, Wei Shi
2022	J	`jnl`	Predicting the Citation Count and CiteScore of Journals One Year in Advance. CoRR William L. Croft, Jörg-Rüdiger Sack
2022	J	`jnl`	Predicting the citation count and CiteScore of journals one year in advance. J. Informetrics William L. Croft, Jörg-Rüdiger Sack
2022	J	`jnl`	Shortest paths among transient obstacles. J. Comb. Optim. Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2021	J	`jnl`	A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions. Appl. Intell. Mohammad Khodizadeh Nahari, Nasser Ghadiri, Ahmad Baraani-Dastjerdi, Jörg-Rüdiger Sack
2021	J	`jnl`	Obfuscation of Images via Differential Privacy: From Facial Images to General Images. CoRR William L. Croft, Jörg-Rüdiger Sack, Wei Shi
2021	J	`jnl`	Obfuscation of images via differential privacy: From facial images to general images. Peer-to-Peer Netw. Appl. William L. Croft, Jörg-Rüdiger Sack, Wei Shi
2021	J	`jnl`	Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
2020	—	`conf`	A New Model in Firefighting Theory. CALDAM Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald
2020	B	`conf`	An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. LATIN Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
2020	J	`jnl`	Preface. Comput. Geom. Faith Ellen, Jörg-Rüdiger Sack
2020	J	`jnl`	Preface. Comput. Geom. Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
2020	J	`jnl`	The Impact of Range Constraints on Utility in the Design of Differentially Private Mechanisms. Trans. Data Priv. William Lee Croft, Jörg-Rüdiger Sack, Wei Shi
2019	J	`jnl`	A New Model in Firefighting Theory. CoRR Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald
2019	B	`ed.`	Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings WADS Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
2019	J	`jnl`	Differential Privacy Via a Truncated and Normalized Laplace Mechanism. CoRR William Lee Croft, Jörg-Rüdiger Sack, Wei Shi
2019	C	`conf`	Differentially Private Obfuscation of Facial Images. CD-MAKE William L. Croft, Jörg-Rüdiger Sack, Wei Shi
2019	J	`jnl`	Weighted minimum backward Fréchet distance. Theor. Comput. Sci. Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2018	J	`jnl`	Approximating the integral Fréchet distance. Comput. Geom. Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2018	J	`jnl`	Editor's note. Comput. Geom. Jörg-Rüdiger Sack
2018	J	`jnl`	Path Refinement in Weighted Regions. Algorithmica Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2018	J	`jnl`	Query Shortest Paths Amidst Growing Discs. CoRR Arash Nouri, Jörg-Rüdiger Sack
2018	C	`conf`	Rectilinear Shortest Paths Among Transient Obstacles. COCOA Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018	J	`jnl`	Rectilinear Shortest Paths Among Transient Obstacles. CoRR Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018	—	`conf`	Time-Dependent Shortest Path Queries Among Growing Discs. CCCG Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018	J	`jnl`	Time-Dependent Shortest Path Queries Among Growing Discs. CoRR Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2017	B	`ed.`	Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings WADS Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack
2017	J	`jnl`	Comparison of approaches of geographic partitioning for data anonymization. J. Geogr. Syst. William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau
2017	J	`jnl`	Maintaining anonymity using -privacy. J. Locat. Based Serv. Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack
2016	—	`conf`	Approximating the Integral Fréchet Distance. SWAT Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2016	J	`jnl`	Location-based anonymization: comparison and evaluation of the Voronoi-based aggregation system. Int. J. Geogr. Inf. Sci. William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau
2015	J	`jnl`	A Novel Geographic Partitioning System for Anonymizing Health Care Data. CoRR William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau
2015	B	`ed.`	Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings WADS Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege
2015	J	`jnl`	Approximating the Integral Fréchet Distance. CoRR Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2015	J	`jnl`	Geographic Partitioning Techniques for the Anonymization of Health Care Data. CoRR William Lee Croft, Wei Shi, Jörg-Rüdiger Sack, Jean-Pierre Corriveau
2015	—	`conf`	Minimizing Walking Length in Map Matching. TTCS Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2015	—	`conf`	Weighted Minimum Backward Frechet Distance. CCCG Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2014	J	`jnl`	Improved Algorithms for Partial Curve Matching. Algorithmica Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2014	Misc	`conf`	Improved Approximation for Time-Dependent Shortest Paths. COCOON Masoud T. Omran, Jörg-Rüdiger Sack
2014	—	`conf`	Minimum backward fréchet distance. SIGSPATIAL/GIS Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2014	J	`jnl`	Similarity of polygonal curves in the presence of outliers. Comput. Geom. Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2014	J	`jnl`	α-Visibility. Comput. Geom. Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2013	B	`ed.`	Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings WADS Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack
2013	J	`jnl`	An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2013	J	`jnl`	Finding paths with minimum shared edges. J. Comb. Optim. Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2013	J	`jnl`	Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492). Dagstuhl Reports Matt Duckham, Stefan Dulman, Jörg-Rüdiger Sack, Monika Sester
2013	—	`conf`	Weighted Region Problem in Arrangement of Lines. CCCG Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2012	J	`jnl`	CGTA-Awards 2011. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2012	J	`jnl`	Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
2012	J	`jnl`	Shortest Paths in Time-Dependent FIFO Networks. Algorithmica Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack
2012	J	`jnl`	Similarity of Polygonal Curves in the Presence of Outliers CoRR Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2012	—	`conf`	Techniques to protect privacy against inference attacks in location based services. IWGS@SIGSPATIAL/GIS Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack
2012	J	`jnl`	Visiting All Sites with Your Dog CoRR Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
2012	—	`conf`	α-Visibility. SWAT Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2011	B	`ed.`	Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings WADS Frank Dehne, John Iacono, Jörg-Rüdiger Sack
2011	J	`jnl`	An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains CoRR Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2011	J	`jnl`	Editorial. J. Spatial Inf. Sci. Jörg-Rüdiger Sack
2011	J	`jnl`	Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Trans. Computers Matt Duckham, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
2011	Misc	`conf`	Finding Paths with Minimum Shared Edges. COCOON Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2011	J	`jnl`	Fréchet distance with speed limits. Comput. Geom. Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011	A	`conf`	Improved Algorithms for Partial Curve Matching. ESA Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011	—	`conf`	Staying Close to a Curve. CCCG Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2010	—	`conf`	10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects Jörg-Rüdiger Sack, Bettina Speckmann, E. Emiel van Loon, Robert Weibel
2010	—	`conf`	10491 Results of the break-out group: Aggregation. Representation, Analysis and Visualization of Moving Objects Mark de Berg, Jörg-Rüdiger Sack, Bettina Speckmann, Anne Driemel, Maike Buchin, Monika Sester, Marc J. van Kreveld
2010	—	`conf`	10491 Results of the break-out group: Gulls Data. Representation, Analysis and Visualization of Moving Objects Emiel van Loon, Jörg-Rüdiger Sack, Kevin Buchin, Maike Buchin, Mark de Berg, Marc J. van Kreveld, Joachim Gudmundsson, David M. Mountain
2010	—	`conf`	10491 Summary - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects Jörg-Rüdiger Sack, Bettina Speckmann, Emiel van Loon, Robert Weibel
2010	J	`jnl`	Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2010	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2010	Misc	`conf`	Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
2010	—	`ed.`	Representation, Analysis and Visualization of Moving Objects, 05.12. - 10.12.2010 Representation, Analysis and Visualization of Moving Objects Jörg-Rüdiger Sack, Bettina Speckmann, E. Emiel van Loon, Robert Weibel
2010	—	`conf`	Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2009	J	`jnl`	A meeting scheduling problem respecting time and space. GeoInformatica Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2009	B	`ed.`	Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings WADS Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth
2009	—	`conf`	Computing Fréchet Distance with Speed Limits. CCCG Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
2009	J	`jnl`	Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks
2009	—	`conf`	Shortest paths in time-dependent FIFO networks using edge load forecasts. GIS-IWCTS Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack
2008	—	`conf`	08451 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel
2008	—	`conf`	08451 Summary Report - Representation, Analysis and Visualization of Moving Objects. Representation, Analysis and Visualization of Moving Objects Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel
2008	C	`conf`	A Meeting Scheduling Problem Respecting Time and Space. AAIM Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2008	J	`jnl`	Introduction to Special Issue. Algorithmica Frank K. H. A. Dehne, Jörg-Rüdiger Sack
2008	—	`ed.`	Representation, Analysis and Visualization of Moving Objects, 02.11. - 07.11.2008 Representation, Analysis and Visualization of Moving Objects Wolfgang Bitterlich, Jörg-Rüdiger Sack, Monika Sester, Robert Weibel
2008	C	`conf`	Shortest Path Queries in Polygonal Domains. AAIM Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack
2007	B	`ed.`	Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh
2007	B	`conf`	An ISAAC Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2007	—	`conf`	GlobeCon - A Scalable Framework for Context Aware Computing. EuroSSC Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack
2007	J	`jnl`	On the longest increasing subsequence of a circular list. Inf. Process. Lett. Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
2007	—	`conf`	Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2006	—	`conf`	06101 Abstracts Collection -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom
2006	—	`conf`	06101 Report -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom
2006	B	`conf`	Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2006	C	`conf`	How to Fit In Another Meeting. CollaborateCom Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2006	—	`ed.`	Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006 Spatial Data: mining, processing and communicating Jörg-Rüdiger Sack, Monika Sester, Peter van Oosterom, Michael F. Worboys
2005	B	`ed.`	Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings WADS Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack
2005	—	`conf`	Concurrent Parallel Shortest Path Computation. PARCO Doron Nussbaum, Jörg-Rüdiger Sack, Hua Ye
2005	J	`jnl`	Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2004	—	`conf`	Floating-Point Filter for the Line Intersection Algorithm. GIScience Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack
2003	B	`ed.`	Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid
2003	B	`conf`	An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2003	J	`jnl`	Parallel implementation of geometric shortest path algorithms. Parallel Comput. Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack
2001	B	`ed.`	Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia
2001	J	`jnl`	Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
2001	J	`jnl`	Ray shooting from convex ranges. Discret. Appl. Math. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
2000	J	`jnl`	An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack
2000	A*	`conf`	Approximation algorithms for geometric shortest path problems. STOC Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2000	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack
2000	—	`book`	Handbook of Computational Geometry Jörg-Rüdiger Sack, Jorge Urrutia
2000	—	`ch.`	Link Distance Problems. Handbook of Computational Geometry Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev
1999	B	`ed.`	Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings WADS Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia
1999	J	`jnl`	Editorial. Comput. Geom. Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia
1999	J	`jnl`	Pop-Stacks in Parallel. Inf. Process. Lett. M. D. Atkinson, Jörg-Rüdiger Sack
1999	A*	`conf`	Shortest Anisotropic Paths on Terrains. ICALP Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1999	J	`jnl`	Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Process. Lett. Anil Maheshwari, Jörg-Rüdiger Sack
1999	J	`jnl`	System development for parallel cellular automata and its applications. Future Gener. Comput. Syst. C. Hecker, David Roytenberg, Jörg-Rüdiger Sack, Z. Wang
1998	—	`conf`	A coarse grained parallel solution to terrain simplification. CCCG Mohammad Ghodsi, Jörg-Rüdiger Sack
1998	—	`conf`	An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1997	B	`ed.`	Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings WADS Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia
1997	—	`conf`	Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1997	—	`conf`	Approximating Weighted Shortest Paths on Polyhedral Surfaces. SCG Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1997	—	`conf`	Early Experiences in Implementing the Buffer Tree. WAE David A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu
1997	J	`jnl`	Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
1997	—	`conf`	Progressive TINs: Algorithms and Applications. ACM-GIS Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack
1997	J	`jnl`	Stage-graph Representations. Discret. Appl. Math. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
1996	J	`jnl`	Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
1996	B	`conf`	Parallel Neighborhood Modeling. SPAA David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
1996	—	`conf`	Parallel Neighbourhood Modelling. ACM-GIS David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
1996	—	`ed.`	Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996 CCCG Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack
1995	—	`conf`	A note on approximations of rectilinear polygons. CCCG Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
1995	B	`ed.`	Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings WADS Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
1995	J	`jnl`	Analog Parallel Algorithms for Computational Geometry. Parallel Algorithms Appl. Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Natana Valiveti, Boris Flach
1995	J	`jnl`	Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1995	A*	`conf`	Optimal Shooting: Characterizations and Applications. ICALP Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
1994	J	`jnl`	A Workbench for Computational Geometry. Algorithmica Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack
1994	J	`jnl`	Generating Triangulations at Random. ACM Trans. Model. Comput. Simul. Peter Epstein, Jörg-Rüdiger Sack
1994	J	`jnl`	Uniform Generation of Binary Trees in Parallel. J. Parallel Distributed Comput. M. D. Atkinson, Jörg-Rüdiger Sack
1994	J	`jnl`	Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. M. D. Atkinson, Jörg-Rüdiger Sack
1993	B	`ed.`	Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides
1993	J	`jnl`	Disassembling two-dimensional composite parts via translations. Int. J. Comput. Geom. Appl. Doron Nussbaum, Jörg-Rüdiger Sack
1993	A	`conf`	Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
1993	—	`conf`	Parallel Algorithms for Rectilinear Link Distance Problems. IPPS Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1992	J	`jnl`	An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1992	J	`jnl`	Generating Binary Trees at Random. Inf. Process. Lett. M. D. Atkinson, Jörg-Rüdiger Sack
1992	J	`jnl`	Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geom. Appl. Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
1991	B	`ed.`	Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
1991	J	`jnl`	Computational Geometry Algorithms for the Systolic Screen. Algorithmica Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro
1990	J	`jnl`	A Characterization of Heaps and Its Applications Inf. Comput. Jörg-Rüdiger Sack, Thomas Strothotte
1990	—	`conf`	A Computational geometry Workbench. SCG A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack
1990	J	`jnl`	An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers Jörg-Rüdiger Sack, Subhash Suri
1989	B	`ed.`	Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings WADS Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
1989	A	`conf`	An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1989	—	`conf`	Computing the Configuration Space for a Robot on a Mesh-of-Processors. ICPP (3) Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack
1989	J	`jnl`	Computing the configuration space for a robot on a mesh-of-processors. Parallel Comput. Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack
1989	—	`conf`	Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms Doron Nussbaum, Jörg-Rüdiger Sack
1989	J	`jnl`	Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1988	—	`conf`	A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. SWAT Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic
1988	—	`conf`	A survey of paralle computational geometry algorithms. Parcella Frank K. H. A. Dehne, Jörg-Rüdiger Sack
1988	A	`conf`	An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS Jörg-Rüdiger Sack, Subhash Suri
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1988	J	`jnl`	Recognizing polygons, or how to spy. Vis. Comput. James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack
1988	B	`conf`	Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). WG Otto Nurmi, Jörg-Rüdiger Sack
1987	J	`jnl`	Algorithms for Minimum Length Partitions of Polygons. BIT Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
1987	J	`jnl`	Bounds for Min-Max Heaps. BIT A. Hasham, Jörg-Rüdiger Sack
1987	—	`conf`	Computing on a Systolic Screen: Hulls, Contours and Applications. PARLE (1) Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	A*	`conf`	Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1987	J	`jnl`	Separability of pairs of polygons through single translations. Robotica Jörg-Rüdiger Sack, Godfried T. Toussaint
1987	J	`jnl`	Translation separability of sets of polygons. Vis. Comput. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
1986	J	`jnl`	Min-Max Heaps and Generalized Priority Queues. Commun. ACM M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte
1986	B	`conf`	Seperability of Sets of Polygons. WG Frank K. H. A. Dehne, Jörg-Rüdiger Sack
1985	J	`jnl`	An Algorithm for Merging Heaps. Acta Informatica Jörg-Rüdiger Sack, Thomas Strothotte
1985	A	`conf`	Translating Polygons in the Plane. STACS Jörg-Rüdiger Sack, Godfried T. Toussaint