Anil Maheshwari

Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013)

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)

Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid: The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207

Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid: Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28

Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid: Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013)

Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012)

Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. ACM Transactions on Algorithms 8(2): 10 (2012)

Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for computing diffuse reflection paths in polygons. The Visual Computer 28(12): 1229-1237 (2012)

Gregory Bint, Anil Maheshwari, Michiel H. M. Smid: xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40

Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid: On Farthest-Point Information in Networks. CCCG 2012: 199-204

Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy: On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137

Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh: α-Visibility. SWAT 2012: 1-12

Minati De, Anil Maheshwari, Subhas C. Nandy: Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012)

Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid: Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012)

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012)

Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer: Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012)

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011)

Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer: A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011)

Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011)

Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)

Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh: An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE/ACM Trans. Comput. Biology Bioinform. 8(2): 551-556 (2011)

Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari: Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011

Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011

Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid: Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Staying Close to a Curve. CCCG 2011

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529

Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari: Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146

Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack: An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011)

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010)

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)

Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010)

Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182

Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)

Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)

Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari: Customer Appeasement Scheduling. CoRR abs/1012.3452 (2010)

Anil Maheshwari, Norbert Zeh: I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009)

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009)

Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer: Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009)

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009)

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh: I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184

Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. SODA 2009: 635-644

Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109

Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58

Mustaq Ahmed, Anna Lubiw, Anil Maheshwari: Shortest Gently Descending Paths. WALCOM 2009: 59-70

Anil Maheshwari, Stefanie Wuhrer: Geodesic Paths On 3D Surfaces: Survey and Open Problems. CoRR abs/0904.2550 (2009)

Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)

Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang: On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008)

Anil Maheshwari, Norbert Zeh: I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008)

Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211

Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401

Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86

Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008)

Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. CoRR abs/0805.1661 (2008)

Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008)

Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold: Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188

Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192

Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari: Experiments with a Parallel External Memory System. HiPC 2007: 59-70

Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95

Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi: An O ( n ²log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007)

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007)

Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006)

Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006)

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning planar graphs with costs and weights. ACM Journal of Experimental Algorithmics 11 (2006)

Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor: A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. ICPP 2006: 497-504

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005)

Anil Maheshwari, Jiehua Yi: On computing Fréchet distance of two paths on a convex polyhedron. EuroCG 2005: 41-44

Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)

Anil Maheshwari, Norbert Zeh: I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004)

Prosenjit Bose, Anil Maheshwari, Pat Morin: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3): 135-146 (2003)

Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison: Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003)

David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An external memory data structure for shortest path queries. Discrete Applied Mathematics 126(1): 55-82 (2003)

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257

Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25

Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49

Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002)

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110

Anil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132

Anil Maheshwari, Norbert Zeh: A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61

Anil Maheshwari, Norbert Zeh: I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381

Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001)

Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Ray shooting from convex ranges. Discrete Applied Mathematics 108(3): 259-267 (2001)

Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001)

Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255

Anil Maheshwari, Norbert Zeh: I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90

Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison: The Grid Placement Problem. WADS 2001: 180-191

Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299

Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295

Anil Maheshwari: Database Security for the Web. IS Management 16(2): 85-88 (1999)

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

David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60

Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533

Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich: Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20

Anil Maheshwari, Norbert Zeh: External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316

Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Parallel Virtual Memory. SODA 1999: 889-890

Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari: Polygon Cutting: Revisited. JCDCG 1998: 81-92

Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari: Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103

Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107

Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22

Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Stage-graph Representations. Discrete Applied Mathematics 75(1): 71-80 (1997)

Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Efficient Computation of Implicit Representations of Sparse Graphs. Discrete Applied Mathematics 78(1-3): 1-16 (1997)

Andrzej Lingas, Anil Maheshwari: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Processing Letters 7(1): 3-11 (1997)

Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997)

Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 274-283

Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 485-486

Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack: Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29

Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996)

Srinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. SIAM J. Discrete Math. 9(2): 317-338 (1996)

David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack: Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34

David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack: Parallel Neighborhood Modeling. SPAA 1996: 204-207

Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995)

Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja: NC-Algorithms for Minimum Link Path and Related Problems. J. Algorithms 19(2): 173-203 (1995)

Anders Dessmark, Andrzej Lingas, Anil Maheshwari: Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995)

Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231

Anil Maheshwari, Richard J. Boland Jr.: Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking. ICIS 1995: 189-195

Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan: An algorithm for recognizing palm polygons. The Visual Computer 10(8): 443-451 (1994)

Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Saving Bits Made Easy. CCCG 1994: 140-146

Srinivasa Rao Arikati, Anil Maheshwari: An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136

Srinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269

Anil Maheshwari, Andrzej Lingas: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS 1994: 487-495

Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3: 213-233 (1993)

Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA 1993: 109-120

Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72

Anders Dessmark, Andrzej Lingas, Anil Maheshwari: Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316

Subir Kumar Ghosh, Anil Maheshwari: An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. Inf. Process. Lett. 44(3): 155-160 (1992)

Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi: Sharing Perspectives in Distributed Decision Making. CSCW 1992: 306-313

Subir Kumar Ghosh, Anil Maheshwari: Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT 1992: 106-117

Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991: 369-389

Subir Kumar Ghosh, Anil Maheshwari: An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. Inf. Process. Lett. 36(6): 277-280 (1990)