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

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

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

Parallel Algorithms for All Minimum Link Paths and Link Center Problems. - Subir Kumar Ghosh; Anil Maheshwari (SWAT, 1992)

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

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

Parallel Algorithms for Rectilinear Link Distance Problems. - Andrzej Lingas; Anil Maheshwari; Jörg-Rüdiger Sack (IPPS, 1993)

Multi-List Ranking: Complexity and Applications. - Anders Dessmark; Andrzej Lingas; Anil Maheshwari (STACS, 1993)

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

Saving Bits Made Easy. - Srinivasa Rao Arikati; Anil Maheshwari; Christos D. Zaroliagis (CCCG, 1994)

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

An algorithm for recognizing palm polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan (Vis. Comput., 1994)

A note on approximations of rectilinear polygons. - Jian Huang; Anil Maheshwari; Doron Nussbaum; Jörg-Rüdiger Sack (CCCG, 1995)

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

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

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

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

Multilist Layering: Complexity and Applications. - Anders Dessmark; Andrzej Lingas; Anil Maheshwari (Theor. Comput. Sci., 1995)

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

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

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

Realizing Degree Sequences in Parallel. - Srinivasa Rao Arikati; Anil Maheshwari (SIAM J. Discret. Math., 1996)

Approximating Weighted Shortest Paths on Polyhedral Surfaces. - Mark Lanthier; Anil Maheshwari; Jörg-Rüdiger Sack (SCG, 1997)

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

Early Experiences in Implementing the Buffer Tree. - David A. Hutchinson; Anil Maheshwari; Jörg-Rüdiger Sack; Radu Velicescu (WAE, 1997)

Efficient Computation of Implicit Representations of Sparse Graphs. - Srinivasa Rao Arikati; Anil Maheshwari; Christos D. Zaroliagis (Discret. Appl. Math., 1997)

Stage-graph Representations. - Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (Discret. Appl. Math., 1997)

A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. - Andrzej Lingas; Anil Maheshwari (Parallel Process. Lett., 1997)

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

Polygon Cutting: Revisited. - Prosenjit Bose; Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari (JCDCG, 1998)

Algorithms for Packing Two Circles in a Convex Polygon. - Prosenjit Bose; Jurek Czyzowicz; Evangelos Kranakis; Anil Maheshwari (JCDCG, 1998)

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

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

Shortest Anisotropic Paths on Terrains. - Mark Lanthier; Anil Maheshwari; Jörg-Rüdiger Sack (ICALP, 1999)

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

External Memory Algorithms for Outerplanar Graphs. - Anil Maheshwari; Norbert Zeh (ISAAC, 1999)

Parallel Virtual Memory. - Frank K. H. A. Dehne; Wolfgang Dittrich; David A. Hutchinson; Anil Maheshwari (SODA, 1999)

Database Security for the Web. - Anil Maheshwari (Inf. Syst. Manag., 1999)

Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. - Anil Maheshwari; Jörg-Rüdiger Sack (Parallel Process. Lett., 1999)

Link Distance Problems. - Anil Maheshwari; Jörg-Rüdiger Sack; Hristo N. Djidjev (Handbook of Computational Geometry, 2000)

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

Approximation algorithms for geometric shortest path problems. - Lyudmil Aleksandrov; Anil Maheshwari; Jörg-Rüdiger Sack (STOC, 2000)

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

The Grid Placement Problem. - Prosenjit Bose; Anil Maheshwari; Pat Morin; Jason Morrison (WADS, 2001)

I/O-Efficient Shortest Path Queries in Geometric Spanners. - Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (WADS, 2001)

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

Ray shooting from convex ranges. - Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Jörg-Rüdiger Sack; Jorge Urrutia (Discret. Appl. Math., 2001)

Blocking in Parallel Multisearch Problems. - Wolfgang Dittrich; David A. Hutchinson; Anil Maheshwari (Theory Comput. Syst., 2001)

On reverse nearest neighbor queries. - Anil Maheshwari; Jan Vahrenhold; Norbert Zeh (CCCG, 2002)

A Survey of Techniques for Designing I/O-Efficient Algorithms. - Anil Maheshwari; Norbert Zeh (Algorithms for Memory Hierarchies, 2002)

I/O-optimal algorithms for planar graphs using separators. - Anil Maheshwari; Norbert Zeh (SODA, 2002)

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

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

Translating a regular grid over a point set. - Prosenjit Bose; Marc J. van Kreveld; Anil Maheshwari; Pat Morin; Jason Morrison (Comput. Geom., 2003)

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

An external memory data structure for shortest path queries. - David A. Hutchinson; Anil Maheshwari; Norbert Zeh (Discret. Appl. Math., 2003)

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

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

On computing Fréchet distance of two paths on a convex polyhedron. - Anil Maheshwari; Jiehua Yi (EuroCG, 2005)

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

A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. - Frank K. H. A. Dehne; Anil Maheshwari; Ryan Taylor (ICPP, 2006)

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

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

A Dynamic Dictionary for Priced Information with Application. - Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2006)

Partitioning planar graphs with costs and weights. - Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari (ACM J. Exp. Algorithmics, 2006)

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

Approximate Shortest Descent Path on a Terrain. - Sasanka Roy; Sachin Lodha; Sandip Das 001; Anil Maheshwari (CCCG, 2007)

Experiments with a Parallel External Memory System. - Mohammad R. Nikseresht; David A. Hutchinson; Anil Maheshwari (HiPC, 2007)

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

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

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

Shortest Path Queries in Polygonal Domains. - Hua Guo; Anil Maheshwari; Jörg-Rüdiger Sack (AAIM, 2008)

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

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

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

I/O-Efficient Planar Separators. - Anil Maheshwari; Norbert Zeh (SIAM J. Comput., 2008)

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

I/O and Space-Efficient Path Traversal in Planar Graphs. - Craig Dillabaugh; Meng He 001; Anil Maheshwari; Norbert Zeh (ISAAC, 2009)

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. - Prosenjit Bose; Meng He 001; Anil Maheshwari; Pat Morin (WADS, 2009)

Shortest Gently Descending Paths. - Mustaq Ahmed; Anna Lubiw; Anil Maheshwari (WALCOM, 2009)

I/O-Efficient Algorithms for Graphs of Bounded Treewidth. - Anil Maheshwari; Norbert Zeh (Algorithmica, 2009)

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

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

Geodesic Paths On 3D Surfaces: Survey and Open Problems - Anil Maheshwari; Stefanie Wuhrer (CoRR, 2009)

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

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

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

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

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

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

Customer Appeasement Scheduling - Mohammad R. Nikseresht; Anil Somayaji; Anil Maheshwari (CoRR, 2010)

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. - Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari; Doron Nussbaum; Jörg-Rüdiger Sack (Discret. Comput. Geom., 2010)

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

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

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

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

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

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

A survey of geodesic paths on 3D surfaces. - Prosenjit Bose; Anil Maheshwari; Chang Shu 001; Stefanie Wuhrer (Comput. Geom., 2011)

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

Low-interference networks in metric spaces of bounded doubling dimension. - Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Inf. Process. Lett., 2011)

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

An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. - Glenn Hickey; Mathieu Blanchette; Paz Carmi; Anil Maheshwari; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

xy-Monotone Path Existence Queries in a Rectilinear Environment. - Gregory Bint; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2012)

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

Succinct and I/O Efficient Data Structures for Traversal in Trees. - Craig Dillabaugh; Meng He 001; Anil Maheshwari (Algorithmica, 2012)

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

Visiting All Sites with Your Dog - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz (CoRR, 2012)

Succinct geometric indexes supporting point location queries. - Prosenjit Bose; Eric Y. Chen; Meng He 001; Anil Maheshwari; Pat Morin (ACM Trans. Algorithms, 2012)

Algorithms for computing diffuse reflection paths in polygons. - Subir Kumar Ghosh; Partha P. Goswami; Anil Maheshwari; Subhas C. Nandy; Sudebkumar Prasant Pal; Swami Sarvattomananda (Vis. Comput., 2012)

Weighted Region Problem in Arrangement of Lines. - Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack (CCCG, 2013)

Localized geometric query problems. - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (Comput. Geom., 2013)

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

Approximating the Bottleneck Plane Perfect Matching of a Point Set. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CoRR, 2013)

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. - Lyudmil Aleksandrov; Hristo N. Djidjev; Anil Maheshwari; Jörg-Rüdiger Sack (Discret. Comput. Geom., 2013)

Network Farthest-Point Diagrams. - Prosenjit Bose; Kai Dannies; Jean-Lou De Carufel; Christoph Doell; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (J. Comput. Geom., 2013)

On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. - Sandip Banerjee; Bhargab B. Bhattacharya; Sandip Das 001; Arindam Karmakar; Anil Maheshwari; Sasanka Roy (Trans. Comput. Sci., 2013)

A Facility Coloring Problem in 1-D. - Sandip Das 001; Anil Maheshwari; Ayan Nandy; Michiel H. M. Smid (AAIM, 2014)

Voronoi Games and Epsilon Nets. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Approximating Full Steiner Tree in a Unit Disk Graph. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Bottleneck Bichromatic Plane Matching of Points. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Minimum backward fréchet distance. - Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack; Christian Scheffer (SIGSPATIAL/GIS, 2014)

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. - Prosenjit Bose; Paz Carmi; Mirela Damian; Robin Y. Flatland; Matthew J. Katz; Anil Maheshwari (Algorithmica, 2014)

Improved Algorithms for Partial Curve Matching. - Anil Maheshwari; Jörg-Rüdiger Sack; Kaveh Shahbaz; Hamid Zarrabi-Zadeh (Algorithmica, 2014)

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2014)

A note on the unsolvability of the weighted region shortest path problem. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Megan Owen; Michiel H. M. Smid (Comput. Geom., 2014)

Similarity of polygonal curves in the presence of outliers. - Jean-Lou De Carufel; Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack; Christian Scheffer (Comput. Geom., 2014)

α-Visibility. - Mohammad Ghodsi; Anil Maheshwari; Mostafa Nouri Baygi; Jörg-Rüdiger Sack; Hamid Zarrabi-Zadeh (Comput. Geom., 2014)

Matching in Gabriel Graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CoRR, 2014)

Fixed-orientation equilateral triangle matching of point sets. - Jasine Babu; Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2014)

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid; Paul Liu 001 (CCCG, 2015)

Parallel Framework for Efficient k-means Clustering. - Sonal Kumari; Anil Maheshwari; Poonam Goyal; Navneet Goyal (COMPUTE, 2015)

Minimizing Walking Length in Map Matching. - Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack (TTCS, 2015)

Approximating the bottleneck plane perfect matching of a point set. - A. Karim Abu-Affash; Ahmad Biniaz; Paz Carmi; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

On full Steiner trees in unit disk graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Approximation algorithms for the two-center problem of convex polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (CoRR, 2015)

Packing Plane Perfect Matchings into a Point Set. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Math. Theor. Comput. Sci., 2015)

On the hardness of full Steiner tree problems. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (J. Discrete Algorithms, 2015)

Optimal Data Structures for Farthest-Point Queries in Cactus Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2015)

Matchings in higher-order Gabriel graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2015)

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2016)

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (SWAT, 2016)

Counting Subgraphs in Relational Event Graphs. - Farah Chanchary; Anil Maheshwari (WALCOM, 2016)

Discrete Voronoi games and ϵ-nets, in two and three dimensions. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Analysis of farthest point sampling for approximating geodesics in a graph. - Pegah Kamousi; Sylvain Lazard; Anil Maheshwari; Stefanie Wuhrer (Comput. Geom., 2016)

The Runaway Rectangle Escape Problem. - Aniket Basu Roy; Anil Maheshwari; Sathish Govindarajan; Neeldhara Misra; Subhas C. Nandy; Shreyas Shetty (CoRR, 2016)

A plane 1.88-spanner for points in convex position. - Ahmad Biniaz; Mahdi Amani; Anil Maheshwari; Michiel H. M. Smid; Prosenjit Bose; Jean-Lou De Carufel (J. Comput. Geom., 2016)

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. - Michiel H. M. Smid; Prosenjit Bose; Paz Carmi; Mirela Damian; Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Yuyang Liu (J. Comput. Geom., 2016)

Packing Boundary-Anchored Rectangles. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (CCCG, 2017)

I/O-Efficient Path Traversal in Succinct Planar Graphs. - Craig Dillabaugh; Meng He 001; Anil Maheshwari; Norbert Zeh (Algorithmica, 2017)

Approximation algorithms for the unit disk cover problem in 2D and 3D. - Ahmad Biniaz; Paul Liu 001; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2017)

An optimal algorithm for plane matchings in multipartite geometric graphs. - Ahmad Biniaz; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (Comput. Geom., 2017)

Rectilinear path problems in restricted memory setup. - Binay K. Bhattacharya; Minati De; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2017)

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Towards plane spanners of degree 3. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; Anil Maheshwari; Michiel H. M. Smid (J. Comput. Geom., 2017)

Window Queries for Problems on Intersecting Objects and Maximal Points. - Farah Chanchary; Anil Maheshwari; Michiel H. M. Smid (CALDAM, 2018)

Compatible 4-Holes in Point Sets. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2018)

Time-Dependent Shortest Path Queries Among Growing Discs. - Anil Maheshwari; Arash Nouri; Jörg-Rüdiger Sack (CCCG, 2018)

Rectilinear Shortest Paths Among Transient Obstacles. - Anil Maheshwari; Arash Nouri; Jörg-Rüdiger Sack (COCOA, 2018)

Spanning Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; David Eppstein; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (Algorithmica, 2018)

Path Refinement in Weighted Regions. - Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack; Christian Scheffer (Algorithmica, 2018)

Geometric Path Problems with Violations. - Anil Maheshwari; Subhas C. Nandy; Drimit Pattanayak; Sasanka Roy; Michiel H. M. Smid (Algorithmica, 2018)

Strong matching of points with geometric shapes. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2018)

Approximating the integral Fréchet distance. - Anil Maheshwari; Jörg-Rüdiger Sack; Christian Scheffer (Comput. Geom., 2018)

Approximating Dominating Set on Intersection Graphs of L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (CoRR, 2018)

Plane Bichromatic Trees of Low Degree. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Comput. Geom., 2018)

Localized Query: Color Spanning Variations. - Ankush Acharyya; Anil Maheshwari; Subhas C. Nandy (CALDAM, 2019)

Maximum Plane Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; Kimberly Crosbie; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2019)

Approximating dominating set on intersection graphs of rectangles and L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (Comput. Geom., 2019)

Flip distance to some plane configurations. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2019)

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (Fundam. Informaticae, 2019)

Partial Enclosure Range Searching. - Gregory Bint; Anil Maheshwari; Michiel H. M. Smid; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2019)

The Most Likely Object to be Seen Through a Window. - Paz Carmi; Farah Chanchary; Anil Maheshwari; Michiel H. M. Smid (Int. J. Comput. Geom. Appl., 2019)

Time Windowed Data Structures for Graphs. - Farah Chanchary; Anil Maheshwari (J. Graph Algorithms Appl., 2019)

The discrete Voronoi game in a simple polygon. - Aritra Banik; Sandip Das 001; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2019)

Approximability of covering cells with line segments. - Paz Carmi; Anil Maheshwari; Saeed Mehrabi 001; Luís Fernando Schultz Xavier da Silveira (Theor. Comput. Sci., 2019)

Weighted minimum backward Fréchet distance. - Amin Gheibi; Anil Maheshwari; Jörg-Rüdiger Sack (Theor. Comput. Sci., 2019)

Covering Points with Pairs of Concentric Disks. - Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy; Michiel Smid (CCCG, 2020)

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvottamananda (COCOA, 2020)

An $ varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. - Frank Bauernöppel; Anil Maheshwari; Jörg-Rüdiger Sack (LATIN, 2020)

Maximum Bipartite Subgraph of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (WALCOM, 2020)

Packing boundary-anchored rectangles and squares. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (Comput. Geom., 2020)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. - Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (Comput. Geom., 2020)

Querying relational event graphs using colored range searching data structures. - Farah Chanchary; Anil Maheshwari; Michiel H. M. Smid (Discret. Appl. Math., 2020)

Preface: CALDAM 2016. - Sathish Govindarajan; Anil Maheshwari (Discret. Appl. Math., 2020)

Plane and planarity thresholds for random geometric graphs. - Ahmad Biniaz; Evangelos Kranakis; Anil Maheshwari; Michiel H. M. Smid (Discret. Math. Algorithms Appl., 2020)

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid (Inf. Process. Lett., 2020)

Faster algorithms for some optimization problems on collinear points. - Ahmad Biniaz; Prosenjit Bose; Paz Carmi; Anil Maheshwari; J. Ian Munro; Michiel H. M. Smid (J. Comput. Geom., 2020)

A simple randomized $O(n log n)$-time closest-pair algorithm in doubling metrics. - Michiel Smid; Anil Maheshwari; Wolfgang Mulzer (J. Comput. Geom., 2020)

An Acrophobic Guard Watchtower Problem on Terrains. - Ritesh Seth; Anil Maheshwari; Subhas C. Nandy (CCCG, 2021)

Minimum Consistent Subset Problem for Trees. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (FCT, 2021)

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. - Sayan Bandyapadhyay; Anil Maheshwari; Michiel Smid (ISAAC, 2021)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel Smid (Algorithmica, 2021)

Window queries for intersecting objects, maximal points and approximations using coresets. - Farah Chanchary; Anil Maheshwari; Michiel Smid (Discret. Appl. Math., 2021)

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. - A. Karim Abu-Affash; Paz Carmi; Anil Maheshwari; Pat Morin; Michiel Smid; Shakhar Smorodinsky (Discret. Comput. Geom., 2021)

Color-spanning localized query. - Ankush Acharyya; Anil Maheshwari; Subhas C. Nandy (Theor. Comput. Sci., 2021)

Voronoi game on polygons. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (Theor. Comput. Sci., 2021)

Voronoi Games Using Geodesics. - Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (CALDAM, 2022)

Weighted shortest path in equilateral triangular meshes. - Prosenjit Bose; Guillermo Esteban; Anil Maheshwari (CCCG, 2022)

Half-Guarding Weakly-Visible Polygons and Terrains. - Nandhana Duraisamy; Hannah Miller Hillberg; Ramesh K. Jallu; Erik Krohn; Anil Maheshwari; Subhas C. Nandy; Alex Pahlow (FSTTCS, 2022)

Bounded-Angle Minimum Spanning Trees. - Ahmad Biniaz; Prosenjit Bose; Anna Lubiw; Anil Maheshwari (Algorithmica, 2022)

Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. - Ahmad Biniaz; Anil Maheshwari; Michiel Smid (Comput. Geom. Topol., 2022)

An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. - Frank Bauernöppel; Anil Maheshwari; Jörg-Rüdiger Sack (Comput. Geom., 2022)

Computing maximum independent set on outerstring graphs and their relatives. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Anil Maheshwari; Saeed Mehrabi 001; Debajyoti Mondal; Michiel Smid (Comput. Geom., 2022)

Linear-size planar Manhattan network for convex point sets. - Satyabrata Jana; Anil Maheshwari; Sasanka Roy (Comput. Geom., 2022)

Shortest paths among transient obstacles. - Anil Maheshwari; Arash Nouri; Jörg-Rüdiger Sack (J. Comb. Optim., 2022)

Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. - Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (CALDAM, 2023)

Acrophobic guard watchtower problem. - Ritesh Seth; Anil Maheshwari; Subhas C. Nandy (Comput. Geom., 2023)

Maximum Bipartite Subgraphs of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (Int. J. Comput. Geom. Appl., 2023)

The Minimum Moving Spanning Tree Problem. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luís Fernando Schultz Xavier da Silveira; Michiel Smid (J. Graph Algorithms Appl., 2023)

Minimum consistent subset of simple graph classes. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (Discret. Appl. Math., 2023)

A linear-time algorithm for semitotal domination in strongly chordal graphs. - Vikash Tripathi; Arti Pandey; Anil Maheshwari (Discret. Appl. Math., 2023)

Constant delay lattice train schedules. - Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Sasanka Roy; Luís Fernando Schultz Xavier da Silveira (Discret. Appl. Math., 2023)

Computing shortest paths amid non-overlapping weighted disks. - Prosenjit Bose; Jean-Lou De Carufel; Guillermo Esteban; Anil Maheshwari (CCCG, 2024)

Minimum Consistent Subset in Trees and Interval Graphs. - Aritra Banik; Sayani Das; Anil Maheshwari; Bubai Manna; Subhas C. Nandy; Krishna Priya K. M.; Bodhayan Roy; Sasanka Roy; Abhishek Sahu (FSTTCS, 2024)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

Geometric Covering via Extraction Theorem. - Sayan Bandyapadhyay; Anil Maheshwari; Sasanka Roy; Michiel Smid; Kasturi R. Varadarajan (ITCS, 2024)

Online class cover problem. - Minati De; Anil Maheshwari; Ratnadip Mandal (Comput. Geom., 2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid (CoRR, 2024)

Contiguous Boundary Guarding. - Ahmad Biniaz; Anil Maheshwari; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Thomas C. Shermer (CoRR, 2024)

The basis number of 1-planar graphs. - Saman Bazargani; Therese Biedl; Prosenjit Bose; Anil Maheshwari; Babak Miraftab (CoRR, 2024)

Distance-Preserving Graph Compression Techniques. - Amirali Madani; Anil Maheshwari (J. Graph Algorithms Appl., 2024)

A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. - Prosenjit Bose; Guillermo Esteban; Anil Maheshwari (Theor. Comput. Sci., 2024)

Partial Domination in Some Geometric Intersection Graphs. - Madhura Dutta; Anil Maheshwari; Subhas C. Nandy (CALDAM, 2025)

Algorithms and Hardness Results for the (3, 1)-Cover Problem. - Amirali Madani; Anil Maheshwari; Babak Miraftab; Bodhayan Roy (CALDAM, 2025)

Polychromatic Coloring of Tuples in Hypergraphs. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid; Shakhar Smorodinsky; Milos Stojakovic (SoCG, 2025)

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. - Ahmad Biniaz; Anil Maheshwari; Magnus Christian Ring Merrild; Joseph S. B. Mitchell; Saeed Odak; Valentin Polishchuk; Eliot W. Robson; Casper Moldrup Rysgaard; Jens Kristian Refsgaard Schou; Thomas C. Shermer; Jack Spalding-Jamieson; Rolf Svenning; et al. (SoCG, 2025)

Computing Oriented Spanners and Their Dilation. - Kevin Buchin; Antonia Kalb; Anil Maheshwari; Saeed Odak; Carolin Rehs; Michiel Smid; Sampson Wong (SoCG, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

On 1-planar graphs with bounded cop-number. - Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Karthik Murali 001 (Theor. Comput. Sci., 2025)

Euclidean Maximum Matchings in the Plane - Local to Global. - Ahmad Biniaz; Anil Maheshwari; Michiel Smid (Algorithmica, 2025)

Algorithms and Hardness Results for the (k,ℓ)-Cover Problem. - Amirali Madani; Anil Maheshwari; Babak Miraftab; Bodhayan Roy (CoRR, 2025)

Deciding if a DAG is Interesting is Hard. - Jean-Lou De Carufel; Anil Maheshwari; Saeed Odak; Bodhayan Roy; Michiel Smid; Marc Vicuna (CoRR, 2025)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results. - Madhura Dutta; Anil Maheshwari; Subhas C. Nandy; Bodhayan Roy (CoRR, 2025)