dblp references
 *

A. Maheshwari, J.R. Sack, and C. Scheffer: Approximating the Integral
Frechet Distance, accepted for publication in CGTA, Nov. 2017.
 *

D. Nussbaum, M. Omran, and J.R. Sack: Maintaining Anonymity Using (i, j)Privacy,
Journal of Location Based Services, Vol. 11(1), pp. 128, 2017.
 *

L. Croft, W. Shi, J.R. Sack, J.P. Corriveau:
Comparison of Approaches of Geographic Partitioning for Data Anonymization,
J. of Geographical Systems, 19(3), pp. 221248, 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. 6772, 2017.
 *

C. Scheffer, J.R. Sack, A. Maheshwari: Approximating the Integral
Frechet Distance, presented at SWAT 2016,
Proc. SWAT'16, Leibniz International Proceedings in Informatics, LIPIcs
53, pp. 26.126.14, 2016.
 *

L. Croft, W. Shi, J.R. Sack, J.P. Corriveau: LocationBased Anonymization: Comparison and Evaluation of the VoronoiBased Aggregation System,
International Journal of Geographical Information Science, 30(11), pp. 22532275, 2016.
 *

A. Gheibi, A. Maheshwari, J.R. Sack: Minimizing Walking Length in Map Matching. Proceedings TTCS2015, Tehran, Iran, Springer Verlag, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9541, pp. 105120, 2016.
 *

A. Gheibi, A. Maheshwari, J.R. Sack: Weighted Minimum Backward Frechet Distance. Proceedings CCCG2015, Kingston, Canada, pp. 233240, 2015
 *

A. Maheshwari, J.R. Sack, K. Shahbaz and H. ZarrabiZadeh
"Improved Algorithms for Partial Curve Matching",
Algorithmica, July 2014, Volume 69, Issue 3, pp 641657.
DOI 10.1007/s0045301397583
 *

J.L. De Carufel, A. Gheibi, A. Maheshwari, J.R. Sack, C. Scheffer: Similarity of polygonal curves in the presence of outliers. CGTA 47(5): 625641, 2014.
 *

A. Gheibi, A. Maheshwari, J.R. Sack, C. Scheffer: Minimum Backward Frechet Distance. 22nd ACM SIGSPATIAL, Dallas, USA, 2014.
 *

M. Omran and J.R. Sack, "Improved Approximation for TimeDependent Shortest Paths",
in Proc. 20th Int. Computing and Combinatorics Conf., COCOON, Atlanta, USA, Aug. 2014, LNCS Volume 8591, 2014, pp 453464.
 *

M. Ghodsi, A. Maheshwari, M.Nouri Baygi, J.R. Sack, H. ZarrabiZadeh: "αVisibility", CGTA. 47(3): 435446, 2014.
 *
 M.T. Omran, J.R. Sack and H. ZarrabiZadeh "Finding Paths with Minimum Shared Edges",
(special issue of selected papers from COCOON 2011), J. Comb. Optim. 26(4): 709722, 2013
 *
 A. Gheibi, A. Maheshwari, and J.R. Sack,
"Weighted Region Problem in Arrangement of Lines", Proceedings
CCCG'2013, 2013.
 *
 L. Aleksandrov, H. Djidjev, A. Maheshwari, J.R. Sack: An Approximation Algorithm for Computing Shortest Paths in Weighted 3d Domains, Discrete and Computational Geometry, Volume 50, Issue 1 (2013), pp. 124184;
DOI 10.1007/s0045401394860.
 *
 J.L. De Carufel, A. Gheibi, A. Maheshwari, J.R. Sack, C. Scheffer,
"Similarity of Polygonal Curves in the Presence of Outliers", CoRR abs/1212.1617 (2012)
 *
 A. Maheshwari, J.R. Sack, K. Shahbaz, "Visiting All Sites with Your Dog ", CoRR abs/1211.4559 (2012)
 *
 D. Nussbaum, M.T. Omran, J.R. Sack
"Techniques to Protect Privacy Against Inference Attacks in Location Based Service",
3rd ACM SIGSPATIAL International Workshop on GeoStreaming (IWGS), pp. 5867, 2012.
 *
 F. Dehne, M.T. Omran, and J.R. Sack
"Shortest Paths in TimeDependent FIFO Networks"
Algorithmica (2012) 62:416435; DOI 10.1007/s0045301094616.
 *
 D. Nussbaum, S. Pu, J.R. Sack, T. Uno and H. ZarrabiZadeh
"Finding Maximum Edge Bicliques in Convex Bipartite Graphs",
Algorithmica, Volume 64, Number 2, pp. 311325, 2012.
 *
 M. Ghodsi, A. Maheshwari, M. Nouri, J.R. Sack and H. ZarrabiZadeh
"αVisibility", Fedor V. Fomin, Petteri Kaski (Eds.): Algorithm Theory  SWAT 2012  13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 46, 2012. Proceedings. Lecture Notes in Computer Science 7357 Springer , pp. 112, 2012.
 *
 M. Duckham, D. Nussbaum, J.R. Sack, N. Santoro,
"Efficient, Decentralized Computation of the Topology of Spatial Regions",
IEEE Transactions on Computers, Volume 60, Number 8, pp. 11001113, August 2011.
 *
 A. Maheshwari, J.R. Sack, K. Shahbaz and H. ZarrabiZadeh
"Improved Algorithms for Partial Curve Matching",
19th Annual European Symposium on Algorithms (ESA 2011), Saarbruecken
Germany, September 2011, Lecture Notes in Computer Science, Vol. 6942, pp. 518529, 2011.
 *
 A. Maheshwari, J.R. Sack, K. Shahbaz, H. ZarrabiZadeh
"Frechet Distance with Speed Limits"
Computational Geometry: theory and applications, special issue of selected papers from CCCG'09,
44(2): 110120 (2011).
 *
 A. Maheshwari, J.R. Sack, K. Shahbaz and H. ZarrabiZadeh
"Staying Close to a Curve",
in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), pages 5558, Toronto, Ontario, Canada, August 2011.
 *
 M.T. Omran, J.R. Sack and H. ZarrabiZadeh
"Finding Paths with Minimum Shared Edges", in
Proceedings 17th Annual International Computing and Combinatorics Conference (COCOON 2011), Dallas, Texas, United States, Lecture Notes in Computer Science,
Vol. 6842 pp. 567578, 2011.
 *
 S. Asaduzzaman, B. Franks, K. Lu, D. Nussbaum, and J.R. Sack,
"The GlobeCon Context Processing Middleware in an Opportunistic Environment"
presented at the Opportunity 2010 Workshop, held in
conjunction with the UbiComp2010, 2010.
 *
 A. Maheshwari, J.R. Sack, and K. Shahbaz, and H. ZarrabiZadeh
"SpeedConstrained Geodesic Frechet Distance Inside a Simple Polygon"
In Proceedings of the 22nd Canadian Conference on Computational Geometry
(CCCG2010), Winnipeg, pp. 179182, 2010.
 *
 D. Nussbaum, J.R. Sack, T. Uno, H. ZarrabiZadeh
"Finding Maximum Edge Bicliques in Convex Bipartite Graphs"
In Proceedings of the 16th Annual International Computing and
Combinatorics Conference (COCOON 2010), Nha Trang, Vietnam, Lecture Notes in Computer Science, Vol. 6196, pages 140149, 2010.
 *
 L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum, J.R. Sack
"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces"
Discrete and Computational Geometry,
Volume 44, Number 4, pp. 762801, June 2009.
 *
 F. Dehne, M.T. Omran, and J.R. Sack
"Shortest Paths in
TimeDependent 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. 16, 2009
 *
 A. Maheshwari, J.R. Sack, and K. Shahbaz
"Computing Frechet Distance with Speed Limits"
In Proceedings of the 21st Canadian Conference on Computational Geometry
(CCCG2009), pp. 107110, 2009.
 *
 F. Berger, R. Klein, D. Nussbaum, J.R. Sack, and J. Yi
"A meeting scheduling problem respecting time and space"
Geoinformatica Volume 13:4, pp. 453481, 2009.
 *
 F. Berger, R. Klein, D. Nussbaum, J.R. Sack, and J. Yi
"A meeting scheduling problem respecting time and space",
4th International Conference on
Algorithmic Aspects in Information and Management, AAIM'08, June 2325, 2008,
Proceedings AAIM'08, Lecture Notes in Computer Science, Vol. 5034, pp. 200211.
 *
 H. Guo, A. Maheshwari, and J.R. Sack,
"Shortest path queries in polygonal domains",
4th International Conference on
Algorithmic Aspects in Information and Management, AAIM'08, June 2325, 2008,
Proceedings AAIM'08, Lecture Notes in Computer Science, Vol. 5034, pp. 5059.
 *
 A. Maheshwari, D. Nussbaum, J.R. Sack, and Jihua Yi
"An O(n**2log n) Time Algorithm for Computing Shortest Paths amidst
growing Discs in the Plane",
ISAAC 2007, December 1719, 2007;
Proceedings ISAAC 2007, Lecture Notes in Computer Science, Vol. 4835, pp. 668680.
 *
 Kaiyuan Lu, D. Nussbaum, and J.R. Sack,
"GlobeCon  A Scalable Framework for Context Aware Computing",
2nd European Conference on Smart Sensing and Context, October 2325, 2007, Kendal, UK;
Proceedings EuroSSC 2007, Lecture Notes in Computer Science, Vol. 4793, pp. 190206.
 *
 H. Guo, A. Maheshwari, D. Nussbaum, and J.R. Sack,
"Approximate Shortest Path Queries between Geometric Objects on Weighted
Polyhedral Surfaces",
IEEE ICCSA (1) 2007; Proceedings ICCSA 2007, Lecture Notes in Computer Science,
Vol. 4705, pp. 8295.
 *
 E. Gervais, H. Liu, D. Nussbaum,
Y.S. Roh, J.R. Sack J. Yi,
"Intelligent Map Agents  A Ubiquitous Personalized GIS",
ISPRS Journal of Photogrammetry and Remote Sensing,
special issue on Distributed Geoinformatics, pp. 347365, 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): 5559, 2007.
 *
 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, November 2006; IEEE XPlore.
 *
 L. Aleksandrov, H. Djidjev, G. Huo, A. Maheshwari, D. Nussbaum, and J.R. Sack,
"Approximate Shortest Path Queries on Weighted Polyhedral Surfaces",
31st International Symposium on Mathematical Foundations of Computer Science,
MFCS'06, Bratislava, Slovak Republic, August/September 2006,
LNCS Vol. 4162, Springer Verlag, pp. 98109, 2006.
 *
 L. Aleksandrov, A. Maheshwari, and J.R. Sack,
"Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces",
Journal of the ACM, Vol. 52:1, pp. 2553, 2005.
 *
 D. Nussbaum, and J.R. Sack, H. Ye,
"Concurrent Parallel Shortest Path Computation",
Proceedings of the International Conference, PARCO 2005;
Malaga, Spain, September 2005;
edited as Parallel Computing: Current&Future Issues of
HighEnd Computing by G.R. Joubert, W.E. Nagel, F.J. Peters, O. Plata,
R. Tirado, and E. Zapata, NIC, Vol. 33, pp. 277284, 2006.
 *
 E. Gervais, D. Nussbaum, and J.R. Sack,
"DynaMap: a Context Aware Dynamic Map Application",
presented at GISPlanet, Estoril, Lisbon, Portugal, May 2005.
 *
 A. Frankel, D. Nussbaum, and J.R. Sack,
"FloatingPoint Filter for the Line Intersection Algorithm"
in Proceedings GIScience,
Third International Conference, GIScience 2004, Adelphi, MD, USA, October 2023, 2004,
Lecture Notes in Computer Science, Vol. 3234, Springer Verlag, pp. 94105, 2004.
 *
 D. Nussbaum, S. Pu, and J.R. Sack,
"Fast Algorithms for Computing the Maximum Edge Cardinality Biclique in Convex Bipartite Graphs",
in Proc. 2nd International Conference on Computer Science and its Applications (ICCSA2004), pp. 255261, 2004
.
Books edited
 *
 Handbook of Computational Geometry,
J.R. Sack and J. Urrutia eds., Elsevier Science, January, 2000, (1027 pages).
Papers in refereed journals
 *
 F. Dehne, M.T. Omran, and J.R. Sack
"Shortest Paths in TimeDependent FIFO Networks"
Algorithmica (2012) 62:416435 ; DOI 10.1007/s0045301094616.
 *
 A. Maheshwari, J.R. Sack, and K. Shahbaz
"Computing Frechet Distance with Speed Limits"
In Proceedings of the 21st Canadian Conference on Computational Geometry
(CCCG2009), Vancouver, pp. 107110, 2009.
 *
 A. Maheshwari, J.R. Sack, K. Shahbaz, H. ZarrabiZadeh
"Frechet Distance with Speed Limits"
Computational Geometry: theory and applications, 44(2), pp. 110120, special issue of selected papers from CCCG'09, 2011.
 *
 L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum, J.R. Sack
"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces"
Discrete and Computational Geometry Volume 44, Number 4, pp. 762801, June 2009.
DOI 10.1007/s0045400992040.
 *
 F. Berger, R. Klein, D. Nussbaum, J.R. Sack, and Jihua Yi
"A meeting scheduling problem respecting time and space"
Geoinformatica Volume 13:4, pp. 453481, 2009.
 *
 E. Gervais, H. Liu, D. Nussbaum,
Y.S. Roh, J.R. Sack J. Yi,
"Intelligent Map Agents  A Ubiquitous Personalized GIS",
ISPRS Journal of Photogrammetry and Remote Sensing,
special issue on Distributed Geoinformatics, pp. 347365, 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): 5559, 2007.
 *
 L. Aleksandrov, A. Maheshwari, and J.R. Sack,
"Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces",
Journal of the ACM, Vol. 52:1, pp. 2553, 2005.
 *
 M. Lanthier, D. Nussbaum and J.R. Sack,
"A Parallel Implementation of Geometric Shortest Path
Algorithms",
(Special issue on High Performance Computing with Geographical Data), Parallel Computing, Vol. 29, pp. 14451479, 2003.
 *
 M. Lanthier, A. Maheshwari, and J.R. Sack, "Approximating Shortest Paths on Weighted Polyhedral Surfaces",
(Special issue on Algorithmic Engineering), Algorithmica 30(4): 527562, 2001.
 *
 E. Kranankis, D. Krizanc, A. Maheshwari, J.R. Sack, J. Urrutia, "Ray shooting from Convex Ranges", Discrete Applied Mathematics, 108:259267, March 2001.
 *
 L. Aleksandrov, H. Djidjev and J.R. Sack,
"An O(n log n) algorithm for Finding a Shortest Central Link Segment",
International Journal on Computational Geometry and Applications,
Vol. 10:2, pp. 157188, 2000.
 *
 M.D. Atkinson and J.R. Sack, "PopStacks in Parallel",
Information Processing Letters, Vol. 70, pp. 6367, 1999.
 *
 A. Maheshwari, and J.R. Sack, "Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems",
Parallel Processing Letters, Vol. 9:1, pp. 3142, 1999.
 *
 C. Hecker, D. Roytenberg, and J.R. Sack, "System Development for Parallel Cellular Automata and its Applications",
Journal of Future Generation Computer Systems, Vol. 16, Dec. 1999, pp. 235247
 *
 F. Bauernöppel, E. Kranankis, D. Krizanc, A. Maheshwari,
J.R. Sack, J. Urrutia, "Planar stage graphs: characterization and
applications", Theoretical Computer Science, Vol. 175, pp. 239255, 1997.
 *
 E. Kranankis, D. Krizanc, A. Maheshwari, M. Noy, J.R. Sack, J. Urrutia, "Stagegraph representations", Discrete Applied Mathematics,
Vol. 75:1, pp. 7180, 1997.
 *
 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, Vol. 28:4, pp. 591606, 1996 (report of working group
formed as part of ACM Workshop on Strategic Directions in Computing Research).
 *
 A. Datta, A. Maheshwari, and J.R. Sack,
"Optimal Parallel Algorithms for Direct Dominance Problems",
Nordic Journal of Computing Vol. 3, pp. 7288, 1996.
 *
 A. Lingas, A. Maheshwari, and J.R. Sack, "Parallel Algorithms
for Rectilinear Link Distance Problems", Algorithmica 14, pp. 261289, 1995.
 *
 F. Dehne, B. Flach, J.R. Sack, and N. Valiveti,
"Analog Parallel Algorithms for Computational Geometry", Journal of Parallel Algorithms and Applications, Vol. 5, pp. 114, 1994.
 *
 P. Epstein and J.R. Sack, "Generating Triangulations at Random",
ACM Transaction on Modeling and Computer Simulation, Vol. 4:3, pp. 267278, 1994.
 *
 M.D. Atkinson and J.R. Sack, "Uniform Generation of Combinatorial Objects in Parallel", (research note) Journal of Parallel and Distributed Computing, 23, pp. 101103, 1994.
 *
 P. Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, J.R. Sack, "A Workbench for Computational Geometry ", Algorithmica, 11, pp. 404428, 1994.
 *
 M.D. Atkinson and J.R. Sack, "Uniform generation of forests of restricted height", Information Processing Letters, 50, pp. 323327, 1994.
 *
 L. Devroye, P. Epstein, and J.R. Sack, "On Generating Random Intervals and Hyperrectangles", The Journal of Computational and Graphical Statistics, 2:3, pp. 291307, 1993.
 *
 D. Nussbaum, and J.R. Sack, Disassembling twodimensional
Composite Parts via Translations, International Journal on Computational
Geometry and Applications, 3:1, pp. 7184, 1993.
 *
 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 on Computational Geometry and Applications, 2:3, 221239, 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 and
Computational Geometry, 8, pp. 131152, 1992.
 *
 M.D. Atkinson and J.R. Sack, "Generating Binary Trees at
Random", Information Processing Letters, 41, pp. 2123, 1992.
 *
 F. Dehne, A.L. Hassenklover, J.R. Sack, and N. Santoro,
"Computational Geometry Algorithms for the Systolic Screen", Algorithmica,
6:5, pp. 734762, 1991.
 *
 J.R. Sack, and Th. Strothotte, "A Characterization of Heaps
and Its Applications", Information and Computation, 86,1, pp. 6986, 1990.
 *
 J.R. Sack, and S. Suri, "An Optimal Algorithm for Detecting
Weak Visibility of a Polygon", IEEE Transactions on Computers, 39, 10, pp.
12131219, 1990.
Chapters in Books:
 *
 A. Maheshwari, J.R. Sack and H. Djidjev,
"Link Distance Problems", in Handbook of Computational Geometry,
J.R. Sack and J. Urrutia eds., Elsevier Science, January, 2000, pp. 519558.
Papers in refereed conference proceedings
 *
 S. Asaduzzaman, B. Franks, K. Lu, D. Nussbaum, and J.R. Sack,
"The GlobeCon Context Processing Middleware in an Opportunistic Environment"
presented at the Opportunity 2010 Workshop, held in
conjunction with the UbiComp2010, 2010.
 *
 D. Nussbaum, J.R. Sack, T. Uno, H. ZarrabiZadeh
"Finding Maximum Edge Bicliques in Convex Bipartite Graphs"
In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010), volume 6196 of Lecture Notes in Computer Science, pages 140149, 2010.
 *
 F. Dehne, M.T. Omran, and J.R. Sack
"Shortest Paths in
TimeDependent 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. 16, 2009
 *
 F. Berger, R. Klein, D. Nussbaum, J.R. Sack, and Jihua Yi,
"A meeting scheduling problem respecting time and space"
4th International Conference on
Algorithmic Aspects in Information and Management, AAIM'08, June 2325, 2008,
Proceedings AAIM'08, Lecture Notes in Computer Science, Vol. 5034, pp. 200211.
 *
 H. Guo, A. Maheshwari, and J.R. Sack,
"Shortest path queries in polygonal domains"
4th International Conference on
Algorithmic Aspects in Information and Management, AAIM'08, June 2325, 2008,
Proceedings AAIM'08, Lecture Notes in Computer Science, Vol. 5034, pp. 5059.
 *
 A. Maheshwari, D. Nussbaum, J.R. Sack, and Jihua Yi
"An O(n**2log n) Time Algorithm for Computing Shortest Paths amidst
growing Discs in the Plane",
ISAAC 2007, December 1719, 2007;
Proceedings ISAAC 2007, Lecture Notes in Computer Science, Vol. 4835, pp. 668680.
 *
 Kaiyuan Lu, D. Nussbaum, and J.R. Sack,
"GlobeCon  A Scalable Framework for Context Aware Computing",
2nd European Conference on Smart Sensing and Context, October 2325, 2007, Kendal, UK;
Proceedings EuroSSC 2007, Lecture Notes in Computer Science, Vol. 4793, pp. 190206.
 *
 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, November 2006; IEEE XPlore.
 *
 L. Aleksandrov, H. Djidjev, G. Huo, A. Maheshwari, D. Nussbaum, and J.R. Sack,
"Approximate Shortest Path Queries on Weighted Polyhedral Surfaces",
31st International Symposium on Mathematical Foundations of Computer Science,
MFCS'06, Bratislava, Slovak Republic, August/September 2006,
LNCS Vol. 4162, Springer Verlag, pp. 98109, 2006.
 *
 D. Nussbaum, and J.R. Sack, H. Ye,
"Concurrent Parallel Shortest Path Computation",
Proceedings of the International Conference, PARCO 2005;
Malaga, Spain, September 2005;
edited as Parallel Computing: Current&Future Issues of
HighEnd Computing by G.R. Joubert, W.E. Nagel, F.J. Peters, O. Plata,
R. Tirado, and E. Zapata, NIC, Vol. 33, 2006.
 *
 E. Gervais, D. Nussbaum, and J.R. Sack,
"DynaMap: a Context Aware Dynamic Map Application",
presented at GISPlanet,
Estoril, Lisbon, Portugal, May 2005.
 *
 A. Frankel, D. Nussbaum, and J.R. Sack,
"FloatingPoint Filter for the Line Intersection Algorithm"
in Proceedings GIScience,
Third International Conference, GIScience 2004, Adelphi, MD, USA, October 2023, 2004,
Lecture Notes in Computer Science, Vol. 3234, Springer Verlag, pp. 94105, 2004.
 *
 D. Nussbaum, S. Pu, and J.R. Sack,
"Fast Algorithms for Computing the Maximum Edge Cardinality Biclique in Convex Bipartite Graphs",
in Proc. 2nd International Conference on Computer Science and its Applications (ICCSA2004), pp. 255261, 2004.
 *
 L. Aleksandrov, A. Maheshwari, and J.R. Sack,
"An Improved Approximation Algorithm for Computing Geometric
Shortest Paths",
in Proc. 14th annual Symposium on the Fundamentals of Computation Theory,
FCT 2003, Malmo, Sweden, August 1215, pp. 246257, 2003.
 *
 V. Audet, P. Bose, D. Nussbaum, J.R. Sack, J. Szantos, and A. Whitehead,
"Automatic Seed Detection in OnLine Portal Images for Prostate Cancer",
in Proc. 2nd IASTED International Conference on Visualization, Imaging and Image Processing (VIIP), Malaga, Spain, pp. 361366, 2002.
 *
 L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.R. Sack,
"Approximation Algorithms for Geometric Shortest Path Problems", Proceedings, ACM Symposium on
Theory of Computing, Portland, May 2000, pp. 286295.
 *
 M. Lanthier, A. Maheshwari, and J.R. Sack,
"Shortest Anisotropic Paths on Terrains",
in Proc. ICALP'99, Prague, LNCS 1644, pp. 524533, 1999.
 *
 L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.R. Sack,
"An epsilon  Approximation Algorithm for Weighted Shortest Paths
on Polyhedral Surfaces", in Proc. SWAT'98, Stockholm, LNCS 1432, pp. 1122, 1998.
 *
 A. Maheshari, Patrick Morin and J.R. Sack, "Progressive TINs: Algorithms and Applications", in Proc. ACMGIS'97, 5th International Workshop
on Adavances in Geographic Information Systems, pp. 2429, 1997.
 *
 M. Lanthier, A. Maheshwari, and J.R. Sack, "Approximating Weighted Shortest Paths on
Polyhedral Surfaces", in Proc. 13th annual ACM Symposium on Computational Geometry, pp. 274283, 1997.
 *

D. Hutchinson, A. Maheshwari, J.R. Sack, and R. Velicescu,
"Early Experiences in Implementing the Buffer Tree",
Proc. Workshop on Algorithm Engineering, 1997.
 *
 D. Hutchinson, M. Lanthier, A. Maheshwari, D. Nussbaum,
D. Roytenberg, and J.R. Sack, "Parallel Neighbourhood Modeling",
(full conference version), Proc. ACM GIS, pp. 2634, 1997.
 *

D. Hutchinson, L. Küttner, M. Lanthier, A. Maheshwari, D. Nussbaum,
D. Roytenberg, and J.R. Sack, "Parallel Neighbourhood Modeling",
research summary,
Proc. 8th Annual ACM Symposium on Parallel Algorithms
and Architectures (SPAA'96), Padua, Italy, pp. 204207, 1996.
 *
 F. Bauernöppel, E. Kranankis, D. Krizanc, A. Maheshwari, M. Noy, J.R. Sack, J. Urrutia, "Optimal shooting: characterizations and applications", Proc. 22nd ICALP, Szeged, Hungary, LNCS Vol. 944, Springer Verlag, pp. 220231, 1995.
 *
 A. Datta, A. Maheshwari, and J.R. Sack, "Optimal CREWPRAM algorithms for direct dominance problems", Proc. 1st European Sypmosium on Algorithms'93, Bad Honnef, Germany, LNCS Vol. 726, Springer Verlag, pp. 109120, 1993.
 *
 A. Lingas, A. Maheshwari, and J.R. Sack, "Parallel Algorithms
for Rectilinear Link Distance Problems", Proc. 7th International Parallel Processing Symposium, IPPS '93, Newport Beach, pp. 6572, 1993.
 *
 P. Epstein, A. Knight, J. May, T. Nguyen, J.R. Sack, "A
Workbench for Computational Geometry (WOCG)", demonstrated at 6thAnnual
Symposium on Computational Geometry (by invitation of PC committee), Berkeley, CA, June 68, 1990; abstract in
proceedings p.370.
 *
 D. Nussbaum, and J.R. Sack, "Dissassembling twodimensional
Composite Parts via Translations", Proc. Int. Workshop on Optimal Algorithms,
Varna, Bulgaria, June 1989, Lecture Notes in Computer Science, Springer Verlag
(invited paper), pp. 153167, 1989.
 *
 F. Dehne, A.L. Hassenklover, and J.R. Sack, "Computing the
Configuration Space For a Robot on a MeshOfProcessors", Proc. 1989
International Conf. on Parallel Processing, Vol. III, Chicago, pp. 4048, 1989.
 *
 D. Djidjev, A. Lingas, and J.R. Sack, "An O(n log n)
Algorithm for Constructing a Link Center in a Simple Polygon", Proc.STACS'89,
Paderborn, F.R. of Germany, Lecture Notes in Computer Science, Vol. 349, eds.
B. Monien, R. Cori, pp. 96108, 1989.
 *
 F. Dehne, and J.R. Sack, "Parallel Computational Geometry: A
Survey", Parcella '88, Berlin, Lecture Notes in Computer Science, Vol. 342,
eds. G. Wolf, T. Legendi, U. Schendel, pp. 7388 (invited paper), 1988.
 *
 F. Dehne, I. Stojmenovic, and J.R. Sack, "A Note on
Determining the 3Dimensional Convex Hull of a Set of Points on a Mesh of
Processors", Proc. Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, Lecture Notes in Computer Science, Vol. 318, eds. R. Karlsson and A.
Lingas, pp. 154  162, 1988.
 *
 O. Nurmi, and J.R. Sack, "Separating a Polyhedron by One
Translation from a Set of Obstacles", Proc. Workshop on GraphTheoretic
Concepts in Computer Science, Amsterdam, The Netherlands, Lecture Notes in
Computer Science, Vol. 344, ed. J. van Leeuwen, pp. 202212, 1988.
 *
 J.R. Sack, and S. Suri, "An Optimal Algorithm for Detecting
Weak Visibility of a Polygon", Proc.STACS'88, Bordeaux, France, Lecture Notes
in Computer Science, Vol. 294, eds. R. Cori, M. Wirsing, pp. 312322, 1988.
 *
 Th. Strothotte and J.R. Sack, "Knowledge Aquisition using
Diagrams", Proc. 3rd IFIP Conference on ManMachine Systems, Oulo, Finland,
1988.
 *
 F. Dehne, A. Hassenklover, J.R. Sack, and N. Santoro,
"Parallel Visibility on a MeshConnected Parallel Computer", Proc
International Conference on Parallel Processing and Applications 87, Aquilla,
Italy, North Holland, pp. 203210, 1987.
 *
 C. Levcopoulos, A. Lingas, and J.R. Sack, "Nearly Optimal
Heuristics for Binary Search Trees with Geometric Generalizations", Proc ICALP
'87 , Karlsruhe, Germany, Lecture Notes in Computer Science 267, Springer,
Berlin Heidelberg New York Tokyo, pp. 376385, 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", Proc 3rd ACM Conference on Computational
Geometry, Waterloo, pp. 110, 1987.
 *
 F. Dehne, J.R. Sack, and N. Santoro, "Computing on a
Systolic Screen: Hulls, Contours and Applications", Proc Conference on
Parallel Architectures and Languages Europe (Parle), Eindhoven, The
Netherlands, June 1987, Lecture Notes in Computer Science 258, editors J.W. de
Bakker, A.J. Nijman, P.C. Trealeaven, Springer, Berlin Heidelberg New York
Tokyo, pp. 121133, 1987.
 *
 A. Hasham and J.R. Sack, "A Note on Lower Bounds for MinMax
Heaps", Proc 24 rd Allerton Conference on Communication, Control and
Computing, UrbanaChampaign, Ill., pp. 306307 (summary), 1986.
 *
 J. A. Dean, A. Lingas, and J.R. Sack, "Recognizing Polygons:
or How to Eavesdrop", Proc 24 rd Allerton Conference on Communication, Control
and Computing, UrbanaChampaign, Ill., pp. 324333, 1986.
 *
 F. Dehne, and J.R. Sack, "Separability of Sets of Polygons
Through Single Translations", Proc WG'87, Bernried, FRG, Lecture Notes in
Computer Science 246, Springer, Berlin Heidelberg New York Tokyo, pp.
237251, 1987.
Nonrefereed contributions
Papers in conference proceedings:
 *
 A. Maheshwari, J.R. Sack, and K. Shahbaz, and Hamid ZarrabiZadeh
"SpeedConstrained Geodesic Frechet Distance Inside a Simple Polygon"
In Proceedings of the 22nd Canadian Conference on Computational Geometry
(CCCG2010), Winnipeg, pp. 179182, 2010.
 *
 A. Maheshwari, J.R. Sack, and K. Shahbaz
"Computing Frechet Distance with Speed Limits"
In Proceedings of the 21st Canadian Conference on Computational Geometry
(CCCG2009), Vancouver, pp. 107110, 2009.
 *
 A. Maheshwari P. Morin J.R. Sack,
"A Framework for Multiresolution Modelling",
in Workshop: MultiResolution Representation of 3D Geometry for Progressive
Transmission, Visualization'98, Raleigh, Oct. 1998.
 *
 M. Ghodsi and J.R. Sack
"A Coarse Grained Parallel Solution to Terrain Simplification",
presented at CCCG'98, Montreal, 1998.
 *
 L. Aleksandrov, M.Lanthier, A. Maheshwari, J.R. Sack
"An 1#1Approximation Algorithm for Weighted Shortest Path
Queries on Polyhedral Surfaces", Proc. 14th EURO'CG, Barcelona, pp. 1921, 1998.
 *
 D. Dubrule, P. Morin, J.R. Sack,
"A Parallel Cartographic Modelling System: design, implementation
and performance", Proc. GIS'97, Vancouver, pp. 1620, 1997.
 *
 D. Roytenberg, J.R. Sack,
"A Simulator for the AlexAVX Parallel MultiComputer"
in Proc. HPCS '96 Conference, paper No. 48, Ottawa, 1996.
 *
 F. Dehne, H. Djidjev, J.R. Sack, "An optimal PRAM Algorithm for Convex Embedding of Planar Graphs", International Workshop on Graph Drawing and
Topological Graph Algorithms, Paris, 1993.
 *
 F. Dehne, B. Flach, J.R. Sack, and N. Valiveti, "Analog
Parallel Computational Geometry", Proc. of the 4th CCCG, pp. 143153, 1992.
 *
 P. Epstein and J.R. Sack, "Generating Triangulations at
Random", Proc. of the 4th CCCG, pp. 305310, 1992.
 *
 D. Nussbaum and J.R. Sack, "Translation Separability of
Polyhedra", 1st Canadian Conference on Computation Geometry, Montrèal, Canada,
abstract in Proc., 1989.
Proceedings (edited):
 *

Proc. 14th Algorithms and Data Structures Symposium, eds. F. Dehne,
J.R. Sack, and U. Steege (Eds.) Lecture Notes in Computer Science, Vol. 9214, Springer Verlag, 2015
 *

Proc. Algorithms and Data Structures Symposium, eds. F. Dehne,
R. SolisOba, J.R. Sack (Eds.) Lecture Notes in Computer Science, Vol. 8037, Springer Verlag, 2013
 *

Proc. 12th Algorithms and Data Structures Symposium, eds. F. Dehne, J. Iacono, and J.R. Sack, Lecture Notes in Computer Science, Vol. 6844, Springer Verlag, 2011.
 *
 Proc. 11th Algorithms and Data Structures Symposium, eds.
F. Dehne, M. Gavrilova, J.R. Sack, and C. Toth, Lecture Notes in Computer Science, Vol. 5665, Springer Verlag, 2009.
 *
 Proc. 10th Workshop on Algorithms and Data Structures, eds.
F. Dehne, J.R. Sack, and N. Zeh, Lecture Notes in Computer Science, Vol. 3608, Springer Verlag, 2007.
 *
 Proc. 9th Workshop on Algorithms and Data Structures, eds.
F. Dehne, A. LopezOrtiz, and J.R. Sack, Lecture Notes in Computer Science, Vol. 3608, Springer Verlag, 2005.
 *
 Proc. 8th Workshop on Algorithms and Data Structures, eds.
F. Dehne, J.R. Sack, and M. Smid, Lecture Notes in Computer Science, Vol. 2748, Springer Verlag, 2003.
 *
 Proc. 7th Workshop on Algorithms and Data Structures, eds.
F. Dehne, A. Gupta, J.R. Sack, and R. Tamassia, Lecture Notes in Computer Science, Vol. 2125, Springer Verlag, 2001.
 *
 Proc. 6th Workshop on Algorithms and Data Structures, eds.
F. Dehne, A. Gupta, J.R. Sack, and R. Tamassia, Lecture Notes in Computer Science, Vol. 1663, Springer Verlag, 1999.
 *
 Proc. 5th Workshop on Algorithms and Data Structures, eds.
A. RauChaplin, F. Dehne, J.R. Sack, and R. Tamassia, Lecture Notes in Computer Science, Vol. 1272 , Springer Verlag, 1997.
 *
 Proc. 8th Canadian Conference on Computational Geometry, eds.
F. Fiala, E. Kranakis and J.R. Sack, in International Informatics Series 5,
1996.
 *
 Proc. 4th Workshop on Algorithms and Data Structures, eds.
S. Akl, F. Dehne, J.R. Sack, and N. Santoro, Lecture Notes in Computer Science,
Vol. 955, Springer Verlag, 1995.
 *
 Proc. 3rd Workshop on Algorithms and Data Structures, eds. F. Dehne, J.R. Sack, N. Santoro, and S. Whitesides, Lecture Notes in Computer Science, Vol. 709, Springer Verlag, 1993.
 *
 Proc. Workshop on Algorithms and Data Structures, eds.
F. Dehne, J.R. Sack, and N. Santoro, Lecture Notes in Computer Science, Vol.
519, Springer Verlag, 1991.
 *
 Proc. Workshop on Algorithms and Data Structures, eds.
F. Dehne, J.R. Sack, and N. Santoro, Lecture Notes in Computer Science, Vol.
382, Springer Verlag, 1989.
Videos (refereed and edited):
 *
 M. Lanthier, A. Maheshwari, and J.R. Sack, "Approximating Weighted Shortest Paths on
Polyhedral Surfaces", in 6th annual Video Review of Computational Geometry,
13th ACM SoCG, video ed. J. Snoeyink; abstract in Proc. 13th annual ACM Symposium on Computational Geometry, pp. 485486, 1997 (illustrating the paper in same proceedings).
 *
 P. Epstein, J. Kavanagh, A. Knight, J.R. Sack, "A Workbench
for Computational Geometry", in Animation Geometric Algorithms: A Video
Review, video eds. M. Brown and J. Hershberger, presented at the 8th ACM
Conf. on Computational Geometry, Berlin 1992.
Videos (other):
 *
 D. Roytenberg and J.R. Sack,
"Spatial Modelling in Parallel",
an Educational Video Production, 1997.
 *
 D. Roytenberg and J.R. Sack,
"An Introduction to the ALEX Informatique Parallel Computer",
Educational Video Production, 1996.
Editorials (other):
 *
K. Mehlhorn, J.R. Sack: CGTAAwards 2011. Comput. Geom. 45(4): 139 (2012)
JörgRüdiger Sack: Editorial. J. Spatial Information Science 3(1): 12 (2011)
