Most of these papers are under the various copyright agreements. I request you to kindly refer to these agreements by checking the web-sites of the corresponding publication agencies.

Publications of Anil Maheshwari

    Currently Under Review

• S. Roy, A. Maheshwari and S. C. Nandy, Minimum perimeter convex object enclosing a given number of points, submitted April 2010.

• J. Augustine, S. Das, A. Maheshwari, S.C. Nandy, S. Roy and Swami Sarvattomananda, Recognizing largest empty axis-parallel rectangle and circle in desired location, submitted April 2010.

• A. Maheshwari, J.-R. Sack, K. Shahbaz and H. Zarrabi-Zadeh, Frechet distance with speed limits, submitted November 2009 (preliminary version in CCCG 2009).

• P. Bose, A. Maheshwari, C. Shu and S. Wuhrer, A survey of geodesic paths on 3D surfaces, submitted August 2009

• M. Ahmed, A. Maheshwari, S. Nandy and S. Roy, On the number of shortest descent paths on the surface of a convex terrain, submitted July 2009.

• C. Dillabaugh, M. He and A. Maheshwari, Succinct and I/O efficient data structures for traversal in trees, submitted January 2008 (preliminary version appeared in ISAAC 2008).

• S. Ghosh, P. Goswami, A. Maheshwari, S. Nandy, S. P. Pal and Swami Sarvattomananda, Algorithms for computing diffuse reflection paths in polygons, submitted December 2009 (preliminary version to appear in WALCOM 2009).

• F. DEHNE, A. MAHESHWARI and R. TAYLOR, An improved algorithm for Hausdorff Voronoi Diagram for non-crossing sets, submitted in May 2006 (preliminary version appeared in ICPP 2006).

  Refereed Journal Publications

• G. Hickey, M. Blanchette, P. Carmi, A. Maheshwari and N. Zeh, NAPX: A polynomial time approximation scheme for the Noah's ark problem, to appear in IEEE/ACM Trans. on Comp. Bio and Bioinformatics.(preliminary version appeared in 8th International Workshop on Algorithms in Bioinformatics (WABI), LNCS 5252: 76-86, Germany, September 2008)

• P. Bose, E.Y. Chen, M. He, A. Maheshwari and P. Morin, Succinct geometric indexes supporting point location queries, to appear in Transaction on Algorithms (preliminary version appeared in 20th ACM-SIAM SODA 2009: 635-644).

• L. Aleksandrov, H. Djidjev, H. Guo. A. Maheshwari, D. Nussbaum and J.-R. Sack, Approximate shortest path queries on weighted polyhedral surfaces, to appear in Discrete and Computational Geometry, accepted June 2009 (preliminary version appeared in 31st MFCS, Stara Lesna, Slovakia, August 2006).

• M. Ahmed, S. Das, S. Lodha, A. Lubiw, A. Maheshwari and S. Roy, Approximation algorithms for shortest descending paths, to appear in Discrete Algorithms (preliminary version appeared in CCCG 2007 + WALCOM 2009).

• P. Bose, P. Carmi, M. Farshi, A. Maheshwari and M. Smid, Computing the greedy spanner in near-quadratic time, to appear in Algorithmica (preliminary version appeared in 11th SWAT, LNCS, July 2008).

• P. BOSE, S. COLLETTE, S. LANGERMAN, A. MAHESHWARI, P. MORIN, M. SMID, Sigma-Local Graphs, to appear in Discrete Algorithms.

• P. Bose, P. Carmi, M. Couture, A. Maheshwari, P. Morin and M. Smid, Spanners of Complete k-Partite Geometric Graphs, SIAM Journal of Computing 38 (5): 1803-1820 (preliminary version appeared in LATIN 2008).

• P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid and N. Zeh, Geometric Spanners With Small Chromatic Number, Computational Geometry: Theory and Applications 42(2): 134-146, 2009 (preliminary version appeared in WAOA 2007).

• T. Asano, P. Bose, P. Carmi, A. Maheshwari, C. Shu, M. Smid and S. Wuhrer, Linear apace algorithms for distance preserving embedding, Computational Geometry: Theory and Applications 42(4): 289-304, 2009 (preliminary version appeared in 19th Canadian Conference on Computational Geometry, Ottawa, 2007).

• P. BOSE, H. GUO, E. KRANAKIS, A. MAHESHWARI, P. MORIN, J. MORRISON, M. SMID, and Y. TANG. On the false-positive rate of Bloom filters. Information Processing Letters 108(4): 210-213, 2008.

• R. ATANASSOV, P. BOSE, M. COUTURE, A. MAHESHWARI, P. MORIN, M. PAQUETTE, M. SMID, S. WUHRER, Algorithms for optimal outlier removal, Journal of Discrete Algorithms 7(2): 239-248, 2009.

• A. MAHESHWARI and N. ZEH, I/O-Efficient Algorithms for Planar Separators, SIAM Journal on Computing 38(3): 767-801, 2008 (preliminary version appeared in 13th ACM-SIAM SODA 2002).

• A. MAHESHWARI and N. ZEH, I/O-Efficient Algorithms for Graphs of Bounded Treewidth, Algorithmica 54 (3): 413-469 (preliminary version appeared in 12th ACM-SIAM SODA 2001).

• A. MAHESHWARI, M. SMID, and N. ZEH, I/O-Efficient Algorithms for Computing Planar Geometric Spanners, Computational Geometry: Theory and Applications 40(3): 252-271, 2008 (preliminary version appeared in WADS 2001).

• P. BOSE, A. MAHESHWARI, P. MORIN, J. MORRISON, M. SMID, and J. VAHRENHOLD, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory and Applications 37(3): 209-227, 2007.

• L. ALEKSANDROV, H. DJIDJEV, H. GUO and A. MAHESHWARI, Partitioning planar graphs with costs and weights, ACM Journal of Experimental Algorithms 11, 2006 (preliminary version appeared in 4th ALENEX 2002).

• S. GOVINDARAJAN, T. LUKOVSZKI, A. MAHESHWARI, and N. ZEH, I/O-Efficient Well-Separated Pair Decomposition and its Applications, Algorithmica, 45 (4): 585-614, 2006 (preliminary version appeared in ESA 2000).

• A. MAHESHWARI and M. SMID, A Dynamic Dictionary for Priced Information with Application, ALGORITHMICA, 44 (2): 151-165, 2006 (Special issue on 14th ISAAC).

• L. ALEKSANDROV, A. MAHESHWARI and J.-R. SACK, Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces, Journal of ACM, 52 (1): 25-53, 2005 (preliminary version appeared in 32nd ACM-STOC, 2000).

• A. MAHESHWARI and N. ZEH, I/O-Optimal Algorithms for Outerplanar Graphs, Journal of Graph Algorithms and Applications, 8: 47-87, 2004 (preliminary version appeared in 10th ISAAC, 1999).

• P. BOSE, A. MAHESHWARI, G. NARASIMHAN, M. SMID, and N. ZEH, Approximating Geometric Bottleneck Shortest Paths, Computational Geometry: Theory and Applications, 29:233-249, 2004 (preliminary version appeared in 20th STACS).

• P. BOSE, M. van KREVELD, A. MAHESHWARI, J. MORRISON and P. MORIN, Translating a regular grid over a point set, Computational Geometry: Theory and Applications, 25(1/2): 21-34, May 2003 (special issue on the 17th Euro-CG, 2001).

• P. BOSE, A. MAHESHWARI and P. MORIN, Fast approximations for sums of distances, clustering and the Fermat-Weber problem, Computational Geometry: Theory and Applications, 24(3): 135-146, April 2003.

• D. HUTCHINSON, A. MAHESHWARI and N. ZEH, An external-memory data structure for shortest path queries, Discrete and Applied Mathematics, 126(1): 55-82, March 2003 (special issue on the 5th ACM-SIAM COCOON Conference).

• F. DEHNE, W. DITTRICH, D. HUTCHINSON and A. MAHESHWARI, Bulk-synchronous parallel algorithms as External Memory Algorithms, Theory of Computing Systems, 35: 567-597, 2002 (preliminary version appeared in IPPS 1999, 10th ACM-SIAM SODA 1999)

• P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC and A. MAHESHWARI, Cutting circles and squares into equal area pieces, Geombinatorics, 11 (1): 13-20, July 2001.

• W. DITTRICH, D. HUTCHINSON and A. MAHESHWARI, Blocking in Parallel Multisearch Problems, Theory of Computing Systems (Mathematical Systems Theory) 34(2): 145-189, 2001 (special issue on ACM-SPAA 1998).

• M. LANTHIER, A. MAHESHWARI and J.-R. SACK, Approximating Weighted Shortest Paths on Polyhedral Surfaces, Algorithmica, 30 (4): 527-562, 2001 (Special issue on Algorithmic Engineering).

• E. KRANAKIS, D. KRIZANC, A. MAHESHWARI, J.-R. SACK, J. URRUTIA, Ray shooting from convex ranges, Discrete and Applied Mathematics, 108(3): 259-267, March 2001.

• A. MAHESHWARI and J.-R. SACK, Simple optimal algorithms for rectilinear link path and polygon separation problems, Parallel Processing Letters 9(1): 31-42, 1999.

• S. ARIKATI, A. MAHESHWARI and C.D. ZAROLIAGIS, Efficient computation of compact representation of sparse graphs, Discrete Applied Mathematics 78(3): 1-16, October 1997.

• F. BAUERNOPPEL, E. KRANAKIS, D. KRIZANC, A. MAHESHWARI, J.-R. SACK, J. URRUTIA, Planar Stage Graphs: Characterizations and Applications,Theoretical Computer Science 175(2): 239-255, April 1997.

• E. KRANAKIS, D. KRIZANC, A. MAHESHWARI, M. NOY, J.-R. SACK, J. URRUTIA, Stage Graph Representations, Discrete Applied Mathematics, 75: 71-80, May 1997.

• J. BHADURY, V. CHANDRU, A. MAHESHWARI and R. CHANDRASEKARAN, Art Gallery Problems for Convex Nested Polygons, INFORMS Journal on Computing 9(1): 100-110, Winter 1997.

• A. LINGAS and A. MAHESHWARI, A simple optimal parallel algorithm for reporting paths in a tree, Parallel Processing Letters 7(1):3-11, 1997.

• S. ARIKATI and A. MAHESHWARI, Realizing Degree Sequences in Parallel, SIAM Journal on Discrete Mathematics 9(2): 317-338, 1996.

• A. DATTA, A. MAHESHWARI and J.-R. SACK, Optimal parallel algorithms for direct dominance problems, Nordic Journal of Computing 3(1): 72-88, Spring 1996.

• V. CHANDRU, S. K. GHOSH, A. MAHESHWARI, V. T. RAJAN and S. SALUJA, NC-Algorithms for minimum link path and related problems, Journal of Algorithms 9(4): 507-537, December 1995.

• A. LINGAS, A. MAHESHWARI and J.-R. SACK, Optimal parallel algorithms for rectilinear link distance problems, Algorithmica 14(3): 261-289, September 1995.

• A. DESSMARK, A. LINGAS, A. MAHESHWARI, Multi list layering : Complexity and Applications, Theoretical Computer Science 141(1-2): 337-350, 17 April 1995.

• S. K. GHOSH, A. MAHESHWARI, S. P. PAL and C. E. Veni MADHAVAN, An algorithm for recognizing palm polygons, Special Issue on Computational Geometry, ed. G. Toussaint, The Visual Computer 10(8):443-451, 1994.

• S. K. GHOSH, A. MAHESHWARI, S. P. PAL, S. SALUJA and C. E. Veni MADHAVAN, Characterizing and recognizing weak visibility polygons, Computational Geometry: Theory and Applications 3(4): 213-233, 1993.

• S. K. GHOSH and A. MAHESHWARI, An optimal algorithm for computing a minimum nested nonconvex polygon, Information Processing Letters 44(3): 155-160, 30 November 1992.

• S. K. GHOSH, A. MAHESHWARI, An optimal parallel algorithm for computing furthest neighbors in a tree, Information Processing Letters 36(6): 277-280, 15 December 1990.
  
  

  Refereed Conference Proceedings

• P. Bose, P. Carmi, D. Jansens, A. Maheshwari, P. Morin and M. Smid, Improved methods for generating quasi-Gray codes to appear in SWAT 2010.

• C. Dillabaugh, M. He, A. Maheshwari and N. Zeh, I/O efficient and succint path traversal in planar graphs, Proc. of 20th ISAAC 2009, LNCS 5878: 1175-1184.

• P. Bose, M. He, A. Maheshwari and P. Morin, Succint orthogonal range search structures on a grid with applications to text indexing, 10th WADS 2009, LNCS 5664: 98-109.

• M. Ahmed, A. Lubiw and A. Maheshwari, Shortest gently descending paths, . 3rd International Workshop on Algorithms and Computations (WALCOM), LNCS 5431: 59-70, 2009.

• S. Ghosh, P. Goswami, A. Maheshwari, S. Nandy, S. P. Pal and Swami Sarvattomananda, Algorithms for computing diffuse reflection paths in polygons, 3rd International Workshop on Algorithms and Computations (WALCOM), LNCS 5431: 47-58, 2009.

• P. Bose, E.Y. Chen, M. He, A. Maheshwari and P. Morin, Succinct geometric indexes supporting point location queries, 20th ACM-SIAM SODA 2009: 635-644.

• C. Dillabaugh, M. He and A. Maheshwari, Succinct and I/O efficient data structures for traversal in trees, 19th ISAAC. LNCS 5369: 112-123, Australia, December 2008.

• G. Hickey, P. Carmi, A. Maheshwari and N. Zeh, NAPX: A polynomial time approximation scheme for the Noah's ark problem, 8th International Workshop on Algorithms in Bioinformatics (WABI), LNCS 5252: 76-86, Germany, September 2008

• P. Bose, P. Carmi, M. Farshi, A. Maheshwari and M. Smid, Computing the greedy spanner in near-quadratic time, 11th SWAT, LNCS 5124: 390-401, Sweden, July 2008.

• H. GUO, A. MAHESHWARI, J.-R. SACK, Shortest path queries in polygonal domains, 4th Algorithmic aspects in information and management, LNCS 5034: 200-211, Fudan University, Shanghai, June 2008.

• P. Bose, P. Carmi, M. Couture, A. Maheshwari, P. Morin and M. Smid, Spanners of Complete k-Partite Geometric Graphs, 8th LATIN 2008, LNCS 4957: 170-181, Rio de Janeiro, Brazil, April 2008.

• A. MAHESHWARI, D. NUSSBAUM, J.-R. SACK, J. Yi, Shortest paths amidst growing discs, 18th ISAAC, LNCS 4835: 668-680, Japan, December 2007.

• H. Guo, A. Maheshwari, D. Nussbaum and J.-R. Sack, Shortest path queries among objects, 7th Intl. Workshop on Computational Geometry and Applications, LNCS 4705: 82-95, Malaysia, August 2007

• P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid and N. Zeh, Chromatic Spanners, 5th Workshop on Approximation and Online Algorithms (WAOA), LNCS 4927: 75-88, Israel, October 2007.

• M. Niksereht, A. Maheshwari and D. Hutchinson, Experimental results on simulating BSP algorithms as external memory algorithms, 14th IEEE Intl. Conference on High Performance Computing, India, LNCS, December 2007.

• F. Dehne, A. Maheshwari and R. Taylor, A coarse grained parallel algorithm for Hausdorff Voronoi diagrams, In Proceedings of ICPP, Columbus, Ohio, August 2006.

• L. Aleksandrov, H. Djidjev, H. Guo. A. Maheshwari, D. Nussbaum and J.-R. Sack, Approximate shortest path queries on weighted polyhedral surfaces, to appear in 31st MFCS, Stara Lesna, Slovakia, August 2006.

• A. MAHESHWARI and M. SMID, A Dynamic Dictionary for Priced Information with Application, 14th International Symposium on Algorithms and Computation, LNCS 2906:16-25, Kyoto, December 2003.

• L. ALEKSANDROV, A. MAHESHWARI and J.-R. SACK, An Improved Approximation Algorithm for Computing Geometric Shortest Paths, 14th International Foundations of Computing Theory, LNCS 2751:246-257, Malmo 2003.

• P. BOSE, A. MAHESHWARI, G. NARASIMHAN, M. SMID, and N. ZEH, Approximating geometric bottleneck shortest paths, 20th STACS, LNCS 2607:38-49, Berlin (Germany), February 2003.

• L. ALEKSANDROV, H. DJIDJEV, H. GUO, and A. MAHESHWARI, Partitioning Planar Graphs with Costs and Weights, 4th ALENEX, LNCS 2409:98-107, San Francisco, January 2002.

• A. MAHESHWARI and N. ZEH, I/O-efficient algorithms for planar graphs using separators, 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 372-381, San Francisco, January 2002.

• T. LUKOVSZKI, A. MAHESHWARI and N. ZEH, I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems, 21st FSTTCS, LNCS 2245:244-255, Bangalore (India), December 2001.

• P. BOSE, A. MAHESHWARI, P. MORIN and J. MORRISON, The grid placement problem, Workshop on Algorithms and Data Structures, LNCS 2125:180-191, Providence (RI), August 2001.

• A. MAHESHWARI, M. SMID and N. ZEH, I/O-efficient shortest path queries in geometric spanners, Workshop on Algorithms and Data Structures, LNCS 2125:287-299, Providence (RI), August 2001.

• A. MAHESHWARI and N. ZEH, External memory algorithms for bounded treewidth graphs, 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 89-90, Washington D.C., January 2001.

• S. GOVINDARAJAN, T. LUKOVSZKI, A. MAHESHWARI and N. ZEH, I/O-efficient well-separated pair decomposition and its applications, European Symposium on Algorithms, LNCS 1879:220-231, Saarbrucken (Germany), September 2000.

• L. ALEKSANDROV, A. MAHESHWARI and J.-R. SACK, Approximation algorithms for geometric shortest path problems, Proc. 32nd ACM Symposium on Theory of Computing, Portland (Oregon), May 2000, pp. 286-295.

• A. MAHESHWARI and N. ZEH, External memory algorithms for outerplanar graphs, 10th International Symposium on Algorithms and Computation, LNCS 1741:307-316, Chennai (India), December 1999.

• D. HUTCHINSON, A. MAHESHWARI and N. ZEH, An external-memory data structure for shortest path queries, 5th ACM-SIAM Computing and Combinatorics Conference, LNCS 1627:51-60, Tokyo, July 1999.

• M. LANTHIER, A. MAHESHWARI and J.-R. SACK, Shortest anisotropic paths in terrains, 26th International Colloquium on Automata, Languages and Programming, LNCS 1644:524-533, Prague, July 1999.

• F. DEHNE, W. DITTRICH, D. HUTCHINSON and A. MAHESHWARI, Reducing I/O complexity by simulating coarse grained parallel algorithms, International Parallel Processing Symposium, pp. 65-72, Peurto Rico, April 1999.

• F. DEHNE, W. DITTRICH, D. HUTCHINSON and A. MAHESHWARI, Parallel Virtual Memory, 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, January 1999, pp. 889-890.

• P. BOSE, J. CZYZOWICZ, E. KRANAKIS and A. MAHESHWARI, Algorithms for packing two circles in a simple polygon, Discrete and Computational Geometry (JCDCG), LNCS 1763:93-103, Tokyo, December 1998.

• P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC and A. MAHESHWARI, Polygon cutting theorem revisited, Discrete and Computational geometry (JCDCG), LNCS 1763: 81-92, Tokyo, December 1998, pp. 114-118.

• W. DITTRICH, D. HUTCHINSON and A. MAHESHWARI, Blocking in Parallel Multisearch Problems, 10th ACM Symposium on Parallel Algorithms and Architecture, Puerto Vallarta (Mexico), June 1998, pp. 98-107.

• P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC and A. MAHESHWARI, Cutting circles and squares into equal area pieces, Proc. FUN'98, Italy, June 1998.

• L. ALEKSANDROV, M. LANTHIER, A. MAHESHWARI and J.-R. SACK, An $\epsilon$-approximation scheme for weighted shortest paths, 6th Scandinavian Workshop on Algorithmic Theory, LNCS 1432:11-22, Stockholm, July 1998.

• A. MAHESHWARI, P. MORIN, and J.-R. SACK, Progressive TINs: Algorithms and Applications, 5th ACM International Workshop on Advances in GIS, Las Vegas, ACM-GIS:24-29, November 1997.

• D. HUTCHINSON, A. MAHESHWARI, J.-R. SACK and R. VELICESCU, Early experiences in implementing the buffer tree, 1st Workshop on Algorithm Engineering, Venice, September 1997.

• M. LANTHIER, A. MAHESHWARI and J.-R. SACK, Approximating Weighted Shortest Paths on Polyhedral Surfaces, 13th Annual ACM Computational Geometry Conference, ACM-SoCG:274-283, Nice (France), June 1997.

• D. HUTCHINSON, M. LANTHIER, A. MAHESHWARI, D. ROYTENBERG, D. NUSSBAUM and J.-R. SACK, Parallel neighbourhood modeling, 4th ACM International Workshop on Advances in GIS, ACM-GIS:26-34, Rockville, U.S.A., November 1996.

• L. KUTTNER, M. LANTHIER, A. MAHESHWARI, D. ROYTENBERG, D. NUSSBAUM and J.-R. SACK, Parallel Neighbourhood Modeling, 8th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM-SPAA:204-207, Padua (Italy), June 1996.

• F. BAUERNOPPEL, E. KRANAKIS, D. KRIZANC, A. MAHESHWARI, M. NOY, J.-R. SACK and J. URRUTIA, Optimal Shooting: characterization, solutions and applications, 22nd International Colloquium on Automata, Languages and Programming, LNCS 944:220-231, Szeged (Hungary), July 1995.

• S. ARIKATI and A. MAHESHWARI, An $O(n)$-algorithm for realizing sequences, Foundations of Software Technology and Theoretical Computer Science Conference, LNCS 880: 125-136, Madras (India), Dec. 1994.

• S. ARIKATI and A. MAHESHWARI, Realizing degree sequences in parallel, 5th International Symposium Algorithms and computation, LNCS 834:1-9, Beijing, August 1994.

• A. LINGAS and A. MAHESHWARI, A simple optimal parallel algorithm for reporting paths in a tree, 11th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 775:487-495, Caen (France), February 1994.

• A. DATTA, A. MAHESHWARI and J.-R. SACK, Optimal CREW-PRAM algorithms for direct dominance problems, European Symposium on Algorithms, LNCS 726: 109-120, Bad Honnef (Germany), September-October 1993.

• A. LINGAS, A. MAHESHWARI and J.-R. SACK, Parallel algorithms for rectilinear link distance problems, 7th IEEE International Parallel Processing Symposium, New Port Beach (USA), IPPS:65-72, April 1993.

• A. DESSMARK, A. LINGAS and A. MAHESHWARI, Multi list ranking: Complexity and Applications, 10th STACS, LNCS 665:306-316, W�rzburg (Germany), February 1993.

• S.K. GHOSH and A. MAHESHWARI, Parallel algorithms for all minimum link paths and link center problems, SWAT, LNCS 621:106-117, Helsinki, July 1992.

• S.K. GHOSH, A. MAHESHWARI, S.P. PAL, S. SALUJA and C.E. Veni MADHAVAN, Computing the shortest path tree in a weak visibility polygon, FSTTCS, LNCS 560:369-389, New-Delhi (India), December 1991.
  
  

  Theses

• A. MAHESHWARI, Polynomial time algorithms for linear programming, Masters Thesis, Birla Institute of Technology and Sciences, Pilani, India, 1987.

• A. MAHESHWARI, Parallel algorithms for link distance related problems, Ph.D. Thesis, Tata Institute of Fundamental Research, Bombay, India, 1993.
  
  

  In Books

• A. MAHESHWARI and N. ZEH, A Survey of Techniques for Designing I/O-Efficient Algorithms, Algorithms for Memory Hierarchies, eds. U. Meyer, P. Sanders, J. Sibeyn, LNCS 2625: 36-61, 2003 (Springer-Verlag).

• A. MAHESHWARI, J.R. SACK and H. DJIDJEV, Link Distance Problems, Handbook on Computational Geometry, 2000 Elsevier Science B.V., pp. 519-558.
  
  

  Conference Proceedings/Presentations/Videos(Not-Refereed)

• A. Maheshwari, J.-R. Sack and K. Shanbaz, Frechet distance with speed limits, CCCG 2009, Vancouver, Canada.

• T. Asano, P. Bose, P. Carmi, A. Maheshwari, C. Shu, M. Smid and S. Wuhrer, Linear apace algorithms for distance preserving embedding, 19th Canadian Conference on Computational Geometry, Ottawa, 2007.

• S. Roy, S. Lodha, S. Das, A. Maheshwari, Approximate Shortest Descent Path on a Terrain, 19th Canadian Conference on Computational Geometry, Ottawa, 2007.

• A. MAHESHWARI and J. YI, On computing Frechet distance of two paths on a convex polyhedron, Proceedings of the 21st European Workshop on Computational Geometry, 41-44, Eindhoven March 2005.

• P. BOSE, A. MAHESHWARI, P. MORIN, J. MORRISON, M. SMID, and J. VAHRENHOLD, Space-efficient geometric divide-and-conquer algorithms, Proceedings of the 20th European Workshop on Computational Geometry (EWCG 2004).

• A. MAHESHWARI, J. VAHRENHOLD and N. ZEH, On Reverse Nearest Neighbour Queries, 14th Canadian Conference on Computational Geometry, pp. 128-132, Lethbridge (Alberta), August 2002.

• P. BOSE, A. MAHESHWARI, P. MORIN and J. MORRISON, The grid placement problem, Proceedings of the 17th European Computational Geometry Workshop, Berlin, March 2001.

• A. MAHESHWARI, P. MORIN and J.-R. SACK, A framework for multiresolution modeling, Visualization Workshop on Multi-Resolution Representation of 3D Geometry for Progressive Transmissions, Durham (NC), Oct., 1998.

• L. ALEKSANDROV, M. LANTHIER, A. MAHESHWARI and J.-R. SACK, An $\epsilon$-approximation algorithm for weighted shortest path queries on polyhedral surfaces, 14th European Workshop on Computational Geometry, Spain, March 1998.

• J. HUANG, A. MAHESHWARI, D. NUSSBAUM and J.-R. SACK, A note on approximations of rectilinear polygons, 7th Canadian Conference in Computational Geometry, Quebec City, pp. 43-48, August 1995.

• S. ARIKATI, A. MAHESHWARI, C.D. ZAROLIAGIS, Saving bits made easy, 6th Canadian Conference in Computational Geometry, Waterloo, pp. 140-146, August 1994.

• S.K. GHOSH and A. MAHESHWARI, Optimal parallel algorithm for determining the intersection type of two star-shaped polygons, 3rd Canadian Conference in Computational Geometry, Saskatoon, pp. 3-7, August 1991.

• S.K. GHOSH, A. MAHESHWARI, S.P. PAL, S. SALUJA and C.E. Veni MADHAVAN, Characterizing weak visibility polygons and related problems, 2nd Canadian Conference in Computational Geometry, Ottawa, pp. 93-97, August 1990.

• S.K. GHOSH, A. MAHESHWARI, S.P. PAL and C.E. Veni MADHAVAN, An algorithm for recognizing palm polygons, 2nd Canadian Conference in Computational Geometry, Ottawa, pp. 246-251, August 1990.

• A. MAHESHWARI and N. ZEH, External memory algorithms for outerplanar graphs, DIMACS-HongKong Workshop on Computational Graph Theory, City University of Hong Kong, Hongkong, July 1999.

• F. DEHNE, W. DITTRICH, D. HUTCHINSON, and A. MAHESHWARI, Coarse Grained Parallel Algorithms Yield Better Parallel I/O Complexity, DIMACS Workshop on External Memory Algorithms and Visualization, Piscataway (NJ), May 1998.

• M. LANTHIER, A. MAHESHWARI and J.-R. SACK, Approximating Weighted Shortest Paths on Polyhedral Surfaces, 13th Annual ACM Computational Geometry Conference, Nice, France, June 1997, pp. 485-86.

• A. MAHESHWARI, Richard Karp speaks on the future trends in Computer Science, Carleton Journal of Computer Science, Vol. 3, pp. 10-13, 1999.