2025 – F. Bauernöppel and J.-R. Sack. Finding all Bounded-Length Simple Cycles in Directed Graphs – revisited. ArXiv preprint.

• Links: arXiv1 · arXiv2 · Google Scholar · Scopus

2025 – J.-R. Sack. Generative AI in Research: Potentials and Pitfalls. Presentation in Workshop WKS-31: Navigating Generative AI in Higher Education: Exchanging Best Practices, Confronting Challenges, and Unlocking Transformative Opportunities, CASCON, Toronto, November 2025.

• Links: Google Scholar · Slides · CASCON 2025 (series)

2022 – W. L. Croft and J.-R. Sack. Predicting the Citation Count and CiteScore of Journals One Year in Advance. Journal of Informetrics, 16(4), 101349. (CoRR abs/2210.12908.)

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – H.-K. Ahn, T. Mtsentlintze, and J.-R. Sack. CGTA Awards. Computational Geometry: Theory and Applications, 107: 101896.

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – F. Bauernöppel, A. Maheshwari, and J.-R. Sack. An Ω(n^d) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in d-dimensional Polyhedral Structures. Computational Geometry: Theory and Applications, 107: 101897.

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – R. Klein, D. Kübel, E. Langetepe, J.-R. Sack, and B. Schwarzwald. A New Model in Firefighting Theory. Discrete Applied Mathematics, 319: 296–309.

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – L. Croft, J.-R. Sack, and W. Shi. Differentially Private Facial Obfuscation via Generative Adversarial Networks. Future Generation Computer Systems, 129: 358–379.

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – A. Maheshwari, A. Nouri, and J.-R. Sack. Shortest Paths Among Transient Obstacles. Journal of Combinatorial Optimization, 43(5): 1036–1074.

• Links: DOI / Publisher · Google Scholar · Scopus

2022 – L. Croft, J.-R. Sack, and W. Shi. Differential Privacy Via a Truncated and Normalized Laplace Mechanism. Journal of Computer Science and Technology, 37(2): 369–388.

• Links: DOI / Publisher · Google Scholar · Scopus

2021 – Friggstad, Z., Sack, J.-R., Salavatipour, M.R.. Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica, 83 (3), p. 775..

• DOI / Publisher · Google Scholar · Scopus

2021 – J.-R. Sack, M. R. Salavatipour, and Z. Friggstad. Special Issue on Algorithms and Data Structures, Forward. Algorithmica, 83(3): 775.

• Links: DOI / Publisher · Google Scholar · Scopus

2021 – M. K. Nahari, N. Ghadiri, A. B. Dastjerdi, and J.-R. Sack. A Novel Similarity Measure for Spatial Entity Resolution based on Data Granularity Model: Managing Inconsistencies in Place Descriptions. Applied Intelligence, 51(8): 6104–6123.

• Links: DOI / Publisher · Google Scholar · Scopus

2020 – L. Croft, J.-R. Sack, and W. Shi. The Impact of Range Constraints on Utility in the Design of Differentially Private Mechanisms. Transactions on Data Privacy, 13(3): 171–200.

• Links: Google Scholar · TDP.CAT · Scopus

2020 – F. Bauernöppel, A. Maheshwari, and J.-R. Sack. An Ω(n³) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-dimensional Polyhedral Structures. Proceedings of the 14th Latin American Theoretical Informatics Symposium (LATIN 2020), Lecture Notes in Computer Science 12118.

• Links: DOI / Publisher · Google Scholar · Scopus

2020 – M. K. Nahari, N. Ghadiri, A. B. Dastjerdi, and J.-R. Sack. Improving Linked Data Quality Assessment and Fusion by a Conflict Resolution Approach. Tabriz Journal of Electrical Engineering, 50(1): 113–125.

• Links: Google Scholar · PDF

2020 – F. Ellen and J.-R. Sack. Preface. Computational Geometry: Theory and Applications, 89: 101632.

• Links: DOI / Publisher · Google Scholar · Scopus

2020 – R. Klein, D. Kübel, E. Langetepe, J.-R. Sack, and B. Schwarzwald. A New Model in Firefighting Theory. In M. Changat and S. Das (eds.), Algorithms and Discrete Applied Mathematics (CALDAM 2020), Lecture Notes in Computer Science, vol. 12016, pp. 371–383.

• Links: DOI/Publisher · Google Scholar · Scopus

2019 – Z. Friggstad, J.-R. Sack, and M. R. Salavatipour, eds. Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings. Lecture Notes in Computer Science 11646, Springer.

• Links: DOI/Publisher · Google Scholar · Scopus

2019 – L. Croft, J.-R. Sack, and W. Shi. Differentially Private Obfuscation of Facial Images. Presented at IFIP Cross Domain Conference for Machine Learning and Knowledge Extraction (CD-MAKE 2019), Canterbury, UK.

• Links: DOI/Publisher · Google Scholar · Scopus

2019 – A. Gheibi, A. Maheshwari, and J.-R. Sack. Weighted Minimum Backward Fréchet Distance. Theoretical Computer Science, 783: 9–21.

• Links: DOI/Publisher · Google Scholar · Scopus

2018 – A. Maheshwari, A. Nouri, and J.-R. Sack. Rectilinear Shortest Paths Among Transient Obstacles. In D. Kim, R. Uma, and A. Zelikovsky (eds.), Combinatorial Optimization and Applications (COCOA 2018), Lecture Notes in Computer Science, vol. 11346.

• Links: DOI/Publisher · Google Scholar · Scopus

2018 – A. Maheshwari, A. Nouri, and J.-R. Sack. Time-Dependent Shortest Path Queries Among Growing Discs. CoRR, abs/1808.01984.

• Links: Google Scholar · arXiv · DOI / Publisher · Scopus

2018 – Sack, J.-R.. Editor's note. Computational Geometry Theory and Applications, 69, p. 1..

• DOI / Publisher · Scopus

2018 – A. Maheshwari, J.-R. Sack, and C. Scheffer. Approximating the Integral Fréchet Distance. Computational Geometry: Theory and Applications, 70–71: 13–30.

• Links: DOI/Publisher · Google Scholar · Scopus

2018 – A. Nouri and J.-R. Sack. Query Shortest Paths Amidst Growing Discs. CoRR, abs/1804.01181.

• Links: Google Scholar · DBLP · arXiv

2017 – D. Nussbaum, M. Omran, and J.-R. Sack. Maintaining Anonymity Using (i, j)-Privacy. Journal of Location Based Services, 11(1): 1–28.

• Links: DOI/Publisher · Google Scholar · Scopus · DBLP

2017 – L. Croft, W. Shi, J.-R. Sack, and J.-P. Corriveau. Comparison of Approaches of Geographic Partitioning for Data Anonymization. Journal of Geographical Systems, 19(3): 221–248.

• Links: DOI/Publisher · Google Scholar · DBLP · PDF (preprint) · Scopus

2017 – M. K. Nahari, N. Ghadiri, Z. Jafarifard, A. B. Dastjerdi, and J.-R. Sack. A Framework for Linked Data Fusion and Quality Assessment. 3rd International Conference on Web Research (ICWR 2017), 7959307, pp. 67–72.

• Links: DOI/Publisher · Google Scholar · DBLP · Scopus

2016 – C. Scheffer, J.-R. Sack, and A. Maheshwari. Approximating the Integral Fréchet Distance. In SWAT 2016, Leibniz International Proceedings in Informatics (LIPIcs), 53: 26:1–26:14.

• Links: DOI/Publisher · Google Scholar · Scopus · DBLP

2016 – W. L. Croft, W. Shi, J.-R. Sack, and J.-P. Corriveau. Location-Based Anonymization: Comparison and Evaluation of the Voronoi-Based Aggregation System. International Journal of Geographical Information Science, 30(11): 2253–2275.

• Links: DOI/Publisher · Google Scholar · Scopus

2016 – A. Gheibi, A. Maheshwari, and J.-R. Sack. Minimizing Walking Length in Map Matching. In TTCS 2015, Tehran, Iran, Lecture Notes in Computer Science 9541, pp. 105–120.

• Links: DOI/Publisher · Google Scholar · Scopus

2015 – A. Gheibi, A. Maheshwari, and J.-R. Sack. Weighted Minimum Backward Fréchet Distance. Proceedings of CCCG 2015, Kingston, Canada, pp. 233–240.

• Links: Google Scholar · DBLP · CCCG 2015 proceedings

2014 – A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh. Improved Algorithms for Partial Curve Matching. Algorithmica, 69(3): 641–657.

• Links: DOI/Publisher · Google Scholar · Scopus

2014 – J.-L. De Carufel, A. Gheibi, A. Maheshwari, J.-R. Sack, and C. Scheffer. Similarity of polygonal curves in the presence of outliers. Computational Geometry, 47(5): 625–641.

• Links: DOI/Publisher · Google Scholar · Scopus

2015 – W. L. Croft, W. Shi, J.-R. Sack, and J.-P. Corriveau. A Novel Geographic Partitioning System for Anonymizing Health Care Data. CoRR, abs/1505.06939.

• Links: arXiv

2014 – A. Gheibi, A. Maheshwari, J.-R. Sack, and C. Scheffer. Minimum Backward Fréchet Distance. 22nd ACM SIGSPATIAL, Dallas, USA, 2014.

• Links: DOI/Publisher · Google Scholar · Scopus

2014 – M. Omran and J.-R. Sack. Improved Approximation for Time-Dependent Shortest Paths. In COCOON 2014, LNCS 8591, pp. 453–464.

• Links: DOI/Publisher · Google Scholar · Scopus

2014 – M. Ghodsi, A. Maheshwari, M. Nouri Baygi, J.-R. Sack, and H. Zarrabi-Zadeh. α-Visibility. Computational Geometry, 47(3): 435–446.

• Links: Google Scholar · Scopus

2013 – M. T. Omran and J.-R. Sack. Finding Paths with Minimum Shared Edges. Journal of Combinatorial Optimization, 26(4): 709–722.

• Links: Google Scholar · Scopus · Springer

2013 – A. Gheibi, A. Maheshwari, and J.-R. Sack. Weighted Region Problem in Arrangement of Lines. Proceedings of CCCG 2013, Waterloo, Canada.

• Links: Google Scholar · DBLP · PDF (CCCG 2013) · Scopus

2013 – L. Aleksandrov, H. Djidjev, A. Maheshwari, and J.-R. Sack. An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry, 50(1): 124–184.

• Links: DOI/Publisher · Google Scholar · Scopus

2013 – M. Duckham, S. Dulman, J.-R. Sack, and M. Sester. Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492). Dagstuhl Reports, 3(12): 17–42.

• Links: Google Scholar · DOI/Publisher

2012 – J.-L. De Carufel, A. Gheibi, A. Maheshwari, J.-R. Sack, and C. Scheffer. Similarity of Polygonal Curves in the Presence of Outliers. CoRR, abs/1212.1617.

• Links: Google Scholar · arXiv

2012 – A. Maheshwari, J.-R. Sack, and K. Shahbaz. Visiting All Sites with Your Dog. CoRR, abs/1211.4559.

• Links: Google Scholar · DBLP · arXiv

2012 – D. Nussbaum, M. T. Omran, and J.-R. Sack. Techniques to Protect Privacy Against Inference Attacks in Location Based Service. 3rd ACM SIGSPATIAL International Workshop on GeoStreaming (IWGS), pp. 58–67.

• Links: DOI/Publisher · Google Scholar · Scopus

2012 – F. Dehne, M. T. Omran, and J.-R. Sack. Shortest Paths in Time-Dependent FIFO Networks. Algorithmica, 62: 416–435.

• Links: DOI/Publisher · Google Scholar · Scopus

2012 – D. Nussbaum, S. Pu, J.-R. Sack, T. Uno, and H. Zarrabi-Zadeh. Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica, 64(2): 311–325.

• Links: DOI/Publisher · Google Scholar · Scopus

2012 – M. Ghodsi, A. Maheshwari, M. Nouri, J.-R. Sack, and H. Zarrabi-Zadeh. α-Visibility. In SWAT 2012, Lecture Notes in Computer Science 7357, pp. 1–12.

• Links: Google Scholar · Scopus · SpringerNature

2012 – K. Mehlhorn and J.-R. Sack. CGTA-Awards 2011. Computational Geometry: Theory and Applications, 45(4): 139.

• Links: Scopus · Elsevier/ScienceDirect

2011 – M. Duckham, D. Nussbaum, J.-R. Sack, and N. Santoro. Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Transactions on Computers, 60(8): 1100–1113.

• Links: DOI/Publisher · Google Scholar · Scopus

2011 – A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh. Improved Algorithms for Partial Curve Matching. In ESA 2011, Lecture Notes in Computer Science 6942, pp. 518–529.

• Links: SpringerNature · Google Scholar · Scopus

2011 – A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh. Fréchet Distance with Speed Limits. Computational Geometry, 44(2): 110–120.

• Links: Google Scholar · Elsevier/ScienceDirect · Scopus

2011 – A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh. Staying Close to a Curve. Proceedings of CCCG 2011, Toronto, pp. 55–58.

• Links: Scopus

2011 – M. T. Omran, J.-R. Sack, and H. Zarrabi-Zadeh. Finding Paths with Minimum Shared Edges. In COCOON 2011, Lecture Notes in Computer Science 6842, pp. 567–578.

• Links: DOI/Publisher

2011 – J.-R. Sack. Editorial. Journal of Spatial Information Science, 3(1): 1–2.

• Links: DOI/publisher (pdf) · Google Scholar · Scopus

2010 – J.-R. Sack, B. Speckmann, E. E. van Loon, and R. Weibel. Representation, Analysis and Visualization of Moving Objects. Dagstuhl Seminar Proceedings 10491, Schloss Dagstuhl, Germany.

• Links: Google Scholar · Scopus · Dagstuhl (pdf)

2010 – A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh. Speed-Constrained Geodesic Fréchet Distance Inside a Simple Polygon. In Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, pp. 179–182.

• Links: Scopus · CCCG (pdf)

2010 – L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum, and J.-R. Sack. Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry, 44(4): 762–801.

• Links: DOI/Publisher · Google Scholar · Scopus

2010 – S. Asaduzzaman, B. Franks, K. Lu, D. Nussbaum, and J.-R. Sack. The GlobeCon Context Processing Middleware in an Opportunistic Environment. Opportunity 2010 Workshop, in conjunction with UbiComp 2010.

• Links: Google Scholar

2010 – D. Nussbaum, J.-R. Sack, T. Uno, and H. Zarrabi-Zadeh. Finding Maximum Edge Bicliques in Convex Bipartite Graphs. In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010), Lecture Notes in Computer Science, Vol. 6196, pp. 140–149.

• Links: DBLP (author page) · Google Scholar · SpringerNature · Scopus

2010 – L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum, and J.-R. Sack. Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry, 44(4): 762–801.

• Links: DOI/Publisher · Google Scholar

2009 – F. Dehne, M. T. Omran, and J.-R. Sack. Shortest Paths in Time-Dependent FIFO Networks Using Edge Load Forecasts. Proceedings of the Second International Workshop on Computational Transportation Science (IWCTS 2009) with ACM SIGSPATIAL GIS 2009, Seattle, Washington, pp. 1–6.

• Links: DOI/Publisher · Google Scholar · DBLP · Scopus

2009 – A. Maheshwari, J.-R. Sack, and K. Shahbaz. Computing Fréchet Distance with Speed Limits. Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 107–110.

• Links: Scopus · Google Scholar · CCCG (pdf)

2009 – F. Berger, R. Klein, D. Nussbaum, J.-R. Sack, and J. Yi. A Meeting Scheduling Problem Respecting Time and Space. GeoInformatica, 13(4): 453–481.

• Links: Google Scholar · SpringerNature · Scopus

2008 – H. Guo, A. Maheshwari, and J.-R. Sack. Shortest path queries in polygonal domains. In Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), Lecture Notes in Computer Science, Vol. 5034, pp. 50–59.

• Links: DOI/Publisher · Google Scholar · Scopus

2008 – Dehne, F., Sack, J.-R.. Introduction to special issue. Algorithmica New York, 50 (2), pp. 173-174..

• DOI / Publisher · Scopus · Google Books

2007 – K. Lu, D. Nussbaum, and J.-R. Sack. GlobeCon – A Scalable Framework for Context Aware Computing. In EuroSSC 2007, Lecture Notes in Computer Science 4793, pp. 190–206.

• Links: DOI/Publisher · Google Scholar · Scopus

2007 – E. Gervais, H. Liu, D. Nussbaum, Y.-S. Roh, J.-R. Sack, and J. Yi. Intelligent Map Agents – A Ubiquitous Personalized GIS. ISPRS Journal of Photogrammetry and Remote Sensing, special issue on Distributed Geoinformatics, pp. 347–365.

• Links: DOI/Publisher · Google Scholar · Scopus

2007 – M. H. Albert, M. D. Atkinson, D. Nussbaum, J.-R. Sack, and N. Santoro. On the Longest Increasing Subsequence of a Circular List. Information Processing Letters, 101(2): 55–59.

• Links: DOI/Publisher · Google Scholar · Scopus

2007 – A. Maheshwari, D. Nussbaum, J.-R. Sack, and J. Yi. An O(n² log n) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), Lecture Notes in Computer Science, Vol. 4835, pp. 668–680.

• Links: Google Scholar · SpringerNature · Scopus

2007 – H. Guo, A. Maheshwari, D. Nussbaum, and J.-R. Sack. Approximate Shortest Path Queries between Geometric Objects on Weighted Polyhedral Surfaces. In ICCSA 2007, Lecture Notes in Computer Science 4705, pp. 82–95.

• Links: Google Scholar · SpringerNature · Scopus

2006 – L. Aleksandrov, H. Djidjev, G. Huo, A. Maheshwari, D. Nussbaum, and J.-R. Sack. Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. In MFCS 2006, Lecture Notes in Computer Science 4162, pp. 98–109.

• Links: Google Scholar · SpringerNature · Scopus

2006 – D. Nussbaum, J.-R. Sack, and H. Ye. Concurrent Parallel Shortest Path Computation. In PARCO 2005, Parallel Computing: Current & Future Issues of High-End Computing, NIC 33, pp. 277–284.

• Links: DOI/Publisher (pdf)

2006 – R. Klein, Jihua Yi, D. Nussbaum, and J.-R. Sack. How to Fit in another Meeting. IEEE 2nd International Conference on Collaborative Computing (CollaborateCom 2006), Atlanta, USA.

• Links: DOI/Publisher · Google Scholar · Scopus

2005 – L. Aleksandrov, A. Maheshwari, and J.-R. Sack. Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces. Journal of the ACM, 52(1): 25–53.

• Links: DOI/Publisher · Google Scholar · Scopus

2005 – D. Nussbaum, J.-R. Sack, and H. Ye. Concurrent Parallel Shortest Path Computation. In Proceedings of PARCO 2005, Málaga, Spain, September 2005; in G. R. Joubert et al. (eds.), Parallel Computing: Current & Future Issues of High-End Computing, NIC Series, Vol. 33, 2006.

• Links: Google Scholar · DOI/Publisher

2005 – E. Gervais, D. Nussbaum, and J.-R. Sack. DynaMap: a Context Aware Dynamic Map Application. Presented at GISPlanet, Estoril, Lisbon, Portugal, May 2005.

• Links: Google Scholar

2004 – A. Frankel, D. Nussbaum, and J.-R. Sack. Floating-Point Filter for the Line Intersection Algorithm. In Proceedings of the 3rd International Conference on Geographic Information Science (GIScience 2004), Adelphi, MD, USA, October 20–23, 2004, Lecture Notes in Computer Science, Vol. 3234, pp. 94–105.

• Links: Google Scholar · DBLP · Scopus

2004 – D. Nussbaum, S. Pu, and J.-R. Sack. Fast Algorithms for Computing the Maximum Edge Cardinality Biclique in Convex Bipartite Graphs. In Proceedings of the 2nd International Conference on Computer Science and its Applications (ICCSA 2004), pp. 255–261.

• Links: Google Scholar

2003 – M. Lanthier, D. Nussbaum, and J.-R. Sack. A Parallel Implementation of Geometric Shortest Path Algorithms. Parallel Computing, 29: 1445–1479. (Special issue on High Performance Computing with Geographical Data.)

• Links: DOI/Publisher · Google Scholar · Scopus

2003 – L. Aleksandrov, A. Maheshwari, and J.-R. Sack. An Improved Approximation Algorithm for Computing Geometric Shortest Paths. In Proceedings of the 14th Symposium on Fundamentals of Computation Theory (FCT 2003), Malmö, Sweden, August 12–15, pp. 246–257.

• Links: Google Scholar · Scopus

2003 – B. St. Arnaud, R. Hatem, R. Ingram, D. Nussbaum, J.-R. Sack, A. Cormier, R. Desmeules, and G. Turcotte. CANARIE's Wavelength Disk Drive Project: Experiences From Phase I and Outlook for the Future. In R. D. Kent and T. W. Sands (eds.), High Performance Computing Systems and Applications, The Springer International Series in Engineering and Computer Science, Vol. 727, Springer, Boston, MA, 2003.

• Links: DOI/Publisher · Google Scholar

2002 – V. Audet, P. Bose, D. Nussbaum, J.-R. Sack, J. Szantos, and A. Whitehead. Automatic Seed Detection in On-Line Portal Images for Prostate Cancer. In Proceedings of the 2nd IASTED International Conference on Visualization, Imaging and Image Processing (VIIP 2002), Málaga, Spain, pp. 361–366.

• Links: Google Scholar

2001 – M. Lanthier, A. Maheshwari, and J.-R. Sack. Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica, 30(4): 527–562.

• Links: DOI/Publisher · Google Scholar · Scopus

2001 – E. Kranakis, D. Krizanc, A. Maheshwari, J.-R. Sack, and J. Urrutia. Ray Shooting from Convex Ranges. Discrete Applied Mathematics, 108(3): 259–267.

• Links: DOI/Publisher · Google Scholar · Scopus

2000 – L. Aleksandrov, H. Djidjev, and J.-R. Sack. An O(n log n) Algorithm for Finding a Shortest Central Link Segment. International Journal of Computational Geometry and Applications, 10(2): 157–188.

• Links: DOI/Publisher · Google Scholar · Scopus

2000 – L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack. Approximation Algorithms for Geometric Shortest Path Problems. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000), Portland, OR, pp. 286–295.

• Links: DOI/Publisher · Google Scholar · Scopus

1999 – M. D. Atkinson and J.-R. Sack. Pop-Stacks in Parallel. Information Processing Letters, 70(2–3): 63–67.

• Links: DOI/Publisher · Google Scholar · Scopus

1999 – A. Maheshwari and J.-R. Sack. Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Processing Letters, 9(1): 31–42.

• Links: DOI/Publisher · Google Scholar · Scopus

1999 – C. Hecker, D. Roytenberg, and J.-R. Sack. System Development for Parallel Cellular Automata and its Applications. Future Generation Computer Systems, 16: 235–247.

• Links: DOI/Publisher · Google Scholar · Scopus

1999 – M. Lanthier, A. Maheshwari, and J.-R. Sack. Shortest Anisotropic Paths on Terrains. In Proceedings of ICALP 1999, Prague, Lecture Notes in Computer Science, Vol. 1644, pp. 524–533.

• Links: DOI/Publisher · Google Scholar · Scopus

1998 – L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack. An ε-Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces. In Proceedings of SWAT 1998, Stockholm, Lecture Notes in Computer Science, Vol. 1432, pp. 11–22.

• Links: DOI/Publisher · Google Scholar · Scopus

1998 – A. Maheshwari, P. Morin, and J.-R. Sack. A Framework for Multiresolution Modelling. Workshop: Multi-Resolution Representation of 3D Geometry for Progressive Transmission, Visualization’98, Raleigh, October 1998.

• Links: Google Scholar · Scopus

1998 – M. Ghodsi and J.-R. Sack. A Coarse Grained Parallel Solution to Terrain Simplification. Presented at CCCG’98, Montréal, 1998.

1998 – L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack. An ε-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces. In Proceedings of the 14th European Workshop on Computational Geometry (EURO’CG 1998), Barcelona, pp. 19–21.

1997 – F. Bauernöppel, E. Kranakis, D. Krizanc, A. Maheshwari, J.-R. Sack, and J. Urrutia. Planar Stage Graphs: Characterization and Applications. Theoretical Computer Science, 175(2): 239–255.

• Links: DOI/Publisher · Google Scholar · Scopus

1997 – E. Kranakis, D. Krizanc, A. Maheshwari, M. Noy, J.-R. Sack, and J. Urrutia. Stage-Graph Representations. Discrete Applied Mathematics, 75(1): 71–80.

• Links: Google Scholar · Scopus

1997 – A. Maheshwari, P. Morin, and J.-R. Sack. Progressive TINs: Algorithms and Applications. In Proceedings of ACM-GIS’97, 5th International Workshop on Advances in Geographic Information Systems, pp. 24–29.

• Links: Scopus

1997 – M. Lanthier, A. Maheshwari, and J.-R. Sack. Approximating Weighted Shortest Paths on Polyhedral Surfaces. In Proceedings of the 13th ACM Symposium on Computational Geometry (SoCG 1997), pp. 274–283.

• Links: DOI/Publisher · Google Scholar · Scopus

1997 – D. Hutchinson, A. Maheshwari, J.-R. Sack, and R. Velicescu. Early Experiences in Implementing the Buffer Tree. In Proceedings of the Workshop on Algorithm Engineering, 1997.

1997 – D. Hutchinson, M. Lanthier, A. Maheshwari, D. Nussbaum, D. Roytenberg, and J.-R. Sack. Parallel Neighbourhood Modeling. Full conference version, In Proceedings of ACM GIS 1997, pp. 26–34.

• Links: DOI/Publisher · Google Scholar · Scopus

1997 – D. Dubrule, P. Morin, and J.-R. Sack. A Parallel Cartographic Modelling System: Design, Implementation and Performance. In Proceedings of GIS’97, Vancouver, pp. 16–20.

1996 – D. Roytenberg and J.-R. Sack. A Simulator for the Alex-AVX Parallel Multi-Computer. In Proceedings of the HPCS’96 Conference, Ottawa, paper No. 48.

1996 – R. Tamassia, P. Agarwal, N. Amato, D. Chen, D. Dobkin, R. Drysdale, S. Fortune, M. Goodrich, J. Hershberger, J. O'Rourke, F. Preparata, J.-R. Sack, S. Suri, I. Tollis, J. Vitter, and S. Whitesides. Strategic Directions in Computational Geometry. ACM Computing Surveys, 28(4): 591–606.

• Links: Google Scholar · Scopus

1996 – A. Datta, A. Maheshwari, and J.-R. Sack. Optimal Parallel Algorithms for Direct Dominance Problems. Nordic Journal of Computing, 3(1): 72–88.

• Links: DOI/Publisher · Google Scholar

1996 – D. Hutchinson, L. Küttner, M. Lanthier, A. Maheshwari, D. Nussbaum, D. Roytenberg, and J.-R. Sack. Parallel Neighbourhood Modeling. Research summary, In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’96), Padua, Italy, pp. 204–207.

1995 – A. Lingas, A. Maheshwari, and J.-R. Sack. Parallel Algorithms for Rectilinear Link Distance Problems. Algorithmica, 14: 261–289.

• Links: DOI/Publisher · Google Scholar · Scopus

1995 – F. Bauernöppel, E. Kranakis, D. Krizanc, A. Maheshwari, M. Noy, J.-R. Sack, and J. Urrutia. Optimal Shooting: Characterizations and Applications. In Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP 1995), Szeged, Hungary, Lecture Notes in Computer Science, Vol. 944, pp. 220–231.

• Links: DOI/Publisher · Google Scholar · Scopus

1994 – F. Dehne, B. Flach, J.-R. Sack, and N. Valiveti. Analog Parallel Algorithms for Computational Geometry. Parallel Algorithms and Applications, 5(1–2): 1–14.

• Links: DOI/Publisher · Scopus

1994 – P. Epstein and J.-R. Sack. Generating Triangulations at Random. ACM Transactions on Modeling and Computer Simulation, 4(3): 267–278.

• Links: DOI/Publisher · Google Scholar · Scopus

1994 – M. D. Atkinson and J.-R. Sack. Uniform Generation of Combinatorial Objects in Parallel. Journal of Parallel and Distributed Computing, 23: 101–103.

• Links: DOI/Publisher · Google Scholar · Scopus

1994 – P. Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, and J.-R. Sack. A Workbench for Computational Geometry. Algorithmica, 11: 404–428.

• Links: DOI/Publisher · Google Scholar · Scopus

1994 – M. D. Atkinson and J.-R. Sack. Uniform Generation of Forests of Restricted Height. Information Processing Letters, 50: 323–327.

• Links: DOI/Publisher · Google Scholar · Scopus

1993 – L. Devroye, P. Epstein, and J.-R. Sack. On Generating Random Intervals and Hyperrectangles. Journal of Computational and Graphical Statistics, 2(3): 291–307.

• Links: DOI/Publisher · Google Scholar · Scopus

1993 – D. Nussbaum and J.-R. Sack. Disassembling Two-Dimensional Composite Parts via Translations. International Journal of Computational Geometry and Applications, 3(1): 71–84.

• Links: DOI/Publisher · Google Scholar · Scopus

1993 – A. Datta, A. Maheshwari, and J.-R. Sack. Optimal CREW-PRAM Algorithms for Direct Dominance Problems. In Proceedings of the 1st European Symposium on Algorithms (ESA 1993), Bad Honnef, Germany, Lecture Notes in Computer Science, Vol. 726, pp. 109–120.

• Links: DOI/Publisher · Google Scholar · Scopus

1993 – A. Lingas, A. Maheshwari, and J.-R. Sack. Parallel Algorithms for Rectilinear Link Distance Problems. In Proceedings of the 7th International Parallel Processing Symposium (IPPS 1993), Newport Beach, CA, pp. 65–72.

• Links: DOI/Publisher · Google Scholar

1993 – F. Dehne, H. Djidjev, and J.-R. Sack. An Optimal PRAM Algorithm for Convex Embedding of Planar Graphs. International Workshop on Graph Drawing and Topological Graph Algorithms, Paris, 1993.

• Links: DOI/Publisher · Google Scholar

1992 – M. T. Dickerson, R. L. S. Drysdale, and J.-R. Sack. Simple Algorithms for Enumerating Interpoint Distances and Finding the k Nearest Neighbors. International Journal of Computational Geometry and Applications, 2(3): 221–239.

• Links: DOI/Publisher · Google Scholar

1992 – D. Djidjev, A. Lingas, and J.-R. Sack. An O(n log n) Algorithm for Constructing a Link Center in a Simple Polygon. Discrete & Computational Geometry, 8: 131–152.

• Links: DOI/Publisher · Google Scholar · Scopus

1992 – M. D. Atkinson and J.-R. Sack. Generating Binary Trees at Random. Information Processing Letters, 41: 21–23.

• Links: DOI/Publisher · Google Scholar · Scopus

1992 – F. Dehne, B. Flach, J.-R. Sack, and N. Valiveti. Analog Parallel Computational Geometry. In Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG 1992), pp. 143–153.

• Links: DOI/Publisher · Google Scholar

1992 – P. Epstein and J.-R. Sack. Generating Triangulations at Random. In Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG 1992), pp. 305–310.

1991 – F. Dehne, A.-L. Hassenklover, J.-R. Sack, and N. Santoro. Computational Geometry Algorithms for the Systolic Screen. Algorithmica, 6(5): 734–762.

• Links: DOI/Publisher · Google Scholar · Scopus

1990 – J.-R. Sack and Th. Strothotte. A Characterization of Heaps and Its Applications. Information and Computation, 86(1): 69–86.

• Links: DOI/Publisher · Google Scholar · Scopus

1990 – J.-R. Sack and S. Suri. An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Transactions on Computers, 39(10): 1213–1219.

• Links: DOI/Publisher · Google Scholar · Scopus

1990 – P. Epstein, A. Knight, J. May, T. Nguyen, and J.-R. Sack. A Workbench for Computational Geometry (WOCG). Demonstration at the 6th Annual Symposium on Computational Geometry (SoCG 1990), Berkeley, CA, June 6–8, by invitation of the program committee; abstract in proceedings, p. 370.

• Links: DOI/Publisher · Google Scholar · Scopus

1989 – D. Nussbaum and J.-R. Sack. Disassembling Two-Dimensional Composite Parts via Translations. In Proceedings of the International Workshop on Optimal Algorithms, Varna, Bulgaria, June 1989, Lecture Notes in Computer Science, Springer, pp. 153–167 (invited paper).

• Links: DOI/Publisher · Google Scholar · Scopus

1989 – F. Dehne, A.-L. Hassenklover, and J.-R. Sack. Computing the Configuration Space for a Robot on a Mesh-of-Processors. In Proceedings of the 1989 International Conference on Parallel Processing (ICPP 1989), Vol. III, Chicago, pp. 40–48.

• Links: DOI/Publisher · Google Scholar · Scopus

1989 – D. Djidjev, A. Lingas, and J.-R. Sack. An O(n log n) Algorithm for Constructing a Link Center in a Simple Polygon. In Proceedings of STACS 1989, Paderborn, FRG, Lecture Notes in Computer Science, Vol. 349, pp. 96–108.

• Links: DOI/Publisher · Scopus

1989 – D. Nussbaum and J.-R. Sack. Translation Separability of Polyhedra. 1st Canadian Conference on Computational Geometry (CCCG 1989), Montréal, Canada, abstract in proceedings.

• Links: DOI/Publisher · Google Scholar

1988 – F. Dehne and J.-R. Sack. Parallel Computational Geometry: A Survey. In Proceedings of Parcella ’88, Berlin, Lecture Notes in Computer Science, Vol. 342, pp. 73–88 (invited paper).

• Links: DOI/Publisher

1988 – J. A. Dean, A. Lingas, and J.-R. Sack. Recognizing Polygons, or How to Spy. Visual Computer, Vol. 3, 1988, pp. 344–355.

• Links: DOI/Publisher · Scopus

1988 – F. Dehne, I. Stojmenovic, and J.-R. Sack. A Note on Determining the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 1988), Halmstad, Sweden, Lecture Notes in Computer Science, Vol. 318, pp. 154–162.

• Links: DOI/Publisher · Google Scholar · Scopus

1988 – O. Nurmi and J.-R. Sack. Separating a Polyhedron by One Translation from a Set of Obstacles. In Proceedings of the Workshop on Graph-Theoretic Concepts in Computer Science (WG 1988), Amsterdam, The Netherlands, Lecture Notes in Computer Science, Vol. 344, pp. 202–212.

• Links: Scopus

1988 – J.-R. Sack and S. Suri. An Optimal Algorithm for Detecting Weak Visibility of a Polygon. In Proceedings of STACS 1988, Bordeaux, France, Lecture Notes in Computer Science, Vol. 294, pp. 312–322.

• Links: DOI/Publisher · Google Scholar · Scopus

1988 – Th. Strothotte and J.-R. Sack. Knowledge Acquisition using Diagrams. In Proceedings of the 3rd IFIP Conference on Man-Machine Systems, Oulu, Finland, 1988.

• Links: Google Scholar

1987 – F. Dehne, A. Hassenklover, J.-R. Sack, and N. Santoro. Parallel Visibility on a Mesh-Connected Parallel Computer. In Proceedings of the International Conference on Parallel Processing and Applications 1987, Aquila, Italy, North-Holland, pp. 203–210.

• Links: DOI/Publisher · Archive · Google Scholar

1987 – C. Levcopoulos, A. Lingas, and J.-R. Sack. Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations. In Proceedings of ICALP 1987, Karlsruhe, Germany, Lecture Notes in Computer Science, Vol. 267, pp. 376–385.

• Links: DOI/Publisher · Google Scholar · Scopus

1987 – W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. T. Toussaint, S. Whitesides, and C. K. Yap. Computing the Link Center of a Simple Polygon. In Proceedings of the 3rd ACM Symposium on Computational Geometry (SoCG 1987), Waterloo, pp. 1–10.

• Links: DOI/Publisher · Google Scholar · Scopus

1987 – F. Dehne, J.-R. Sack, and N. Santoro. Computing on a Systolic Screen: Hulls, Contours and Applications. In Proceedings of the Conference on Parallel Architectures and Languages Europe (PARLE 1987), Eindhoven, The Netherlands, Lecture Notes in Computer Science, Vol. 258, pp. 121–133.

• Links: DOI/Publisher · Google Scholar · Scopus

1987 – F. Dehne and J.-R. Sack. Separability of Sets of Polygons Through Single Translations. In Proceedings of WG 1987, Bernried, FRG, Lecture Notes in Computer Science, Vol. 246, pp. 237–251.

• Links: DOI/Publisher · Google Scholar · Scopus

1987 – F. Dehne and G. T. Toussaint. Separability of Sets of Polygons Through Single Translations. Robotica, 5(1): 55–63.

• Links: DOI/Publisher · Google Scholar · Scopus

1986 – A. Hasham and J.-R. Sack. A Note on Lower Bounds for Min-Max Heaps. In Proceedings of the 24th Allerton Conference on Communication, Control and Computing, Urbana-Champaign, IL, pp. 306–307 (summary).

• Links: DOI/Publisher · Google Scholar · Scopus

1986 – J. A. Dean, A. Lingas, and J.-R. Sack. Recognizing Polygons: or How to Eavesdrop. In Proceedings of the 24th Allerton Conference on Communication, Control and Computing, Urbana-Champaign, IL, pp. 324–333.

• Links: Google Scholar · Scopus

1986 – M. D. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max Heaps and Generalized Priority Queues. Communications of the ACM, Vol. 29(10), 1986, pp. 996–1000.

• Links: DOI/Publisher · Google Scholar

1985 – J. A. Dean and J.-R. Sack. Efficient hidden-line elimination by capturing winding information. In Proceedings Annual Allerton Conference on Communication, Control and Computing, 1985, pp. 496–505.

• Links: Google Scholar · Scopus

1985 – J.-R. Sack and T. Strothotte. An algorithm for merging heaps. Acta Informatica, 22(2), 1985, pp. 171–186.

• Links: DOI/Publisher · Google Scholar · Scopus

1985 – J.-R. Sack and G. T. Toussaint. Translating Polygons in the Plane. In Proceedings STAC85, Lecture Notes in Computer Science, Vol. 182, 1985, pp. 310–321.

• Links: DOI/Publisher · Google Scholar · Scopus

1985 – J. M. Keil and J.-R. Sack. Minimum Decompositions of Polygonal Objects. Machine Intelligence and Pattern Recognition, 2(C), 1985, pp. 197–216.

• Links: DOI/Publisher · Google Scholar · Scopus

1983 – J.-R. Sack. Simple Hidden-line Algorithm for Rectilinear Polygons. In Proceedings 21st Allerton Conference on Communication, Control and Computing, 1983.

• Links: Google Scholar · Scopus

1983 – J.-R. Sack and G. T. Toussaint. Some New results on Moving Polygons in the Plane. In Proceedings of the Robotic Intelligence and Productivity Conference, 1983, pp. 158–164.

• Links: Google Scholar · Scopus

1982 – J.-R. Sack. O(n log n) Algorithm for Decomposing Simple Rectilinear Polygons into Convex Quadrilaterals. In Proceedings of the 20th Allerton Conference on Communication, Control and Computing, pp. 64–74, 1982.

• Links: Google Scholar · Scopus

1981 – J.-R. Sack and G. T. Toussaint. A Linear Time Algorithm for Decomposing Rectilinear Star-shaped Polygons into Convex Quadrilaterals. In Proceedings 19th Annual Allerton Conference on Communication, Control and Computing, Urbana, 1981, pp. 21–30.

• Links: Google Scholar