Anil Maheshwari
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
64
Venues
26
Active years
1992–2026
Best venue rank
A*
Where they publish
- BWADS11 papers
- BISAAC8 papers
- BWALCOM5 papers
- AESA4 papers
- A*SODA4 papers
- CCOCOA3 papers
- ASTACS3 papers
- BFCT2 papers
- BLATIN2 papers
- BMFCS2 papers
- CAAIM2 papers
- NationalCOCOON2 papers
- A*ICALP2 papers
- BSPAA2 papers
- AGD1 paper
- CIWOCA1 paper
- CAlgosensors1 paper
- CWABI1 paper
- NationalHiPC1 paper
- CICCSA1 paper
- BWAOA1 paper
- BICPP1 paper
- AALENEX1 paper
- A*STOC1 paper
- CICIS1 paper
- ACSCW1 paper
Papers
64 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Sparse Oriented Spanners in Metric Spaces. | Sujoy Bhore, Ahmad Biniaz, Kevin Buchin, Jean-Lou De Carufel, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid |
| 2025 | WADS | 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. Tth |
| 2024 | GD | 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. Tth, Pavel Valtr |
| 2021 | FCT | Minimum Consistent Subset Problem for Trees. | Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
| 2021 | ISAAC | Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. | Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid |
| 2021 | WADS | The Minimum Moving Spanning Tree Problem. | Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Lus Fernando Schultz Xavier da Silveira, Michiel Smid |
| 2021 | WADS | Euclidean Maximum Matchings in the Plane - Local to Global. | Ahmad Biniaz, Anil Maheshwari, Michiel Smid |
| 2020 | COCOA | Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. | Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda |
| 2020 | LATIN | An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. | Frank Bauernppel, Anil Maheshwari, Jrg-Rdiger Sack |
| 2020 | WALCOM | Maximum Bipartite Subgraph of Geometric Intersection Graphs. | Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy |
| 2019 | WADS | On the Minimum Consistent Subset Problem. | Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid |
| 2019 | WADS | Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. | Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid |
| 2018 | COCOA | Approximability of Covering Cells with Line Segments. | Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Lus Fernando Schultz Xavier da Silveira |
| 2018 | COCOA | Rectilinear Shortest Paths Among Transient Obstacles. | Anil Maheshwari, Arash Nouri, Jrg-Rdiger Sack |
| 2018 | MFCS | Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. | Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri |
| 2017 | WADS | 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 |
| 2016 | ISAAC | Towards Plane Spanners of Degree 3. | Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | IWOCA | Plane Bichromatic Trees of Low Degree. | Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | WALCOM | Counting Subgraphs in Relational Event Graphs. | Farah Chanchary, Anil Maheshwari |
| 2015 | Algosensors | Plane and Planarity Thresholds for Random Geometric Graphs. | Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid |
| 2015 | WADS | An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. | Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid |
| 2014 | AAIM | A Facility Coloring Problem in 1-D. | Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid |
| 2013 | COCOON | The Discrete Voronoi Game in a Simple Polygon. | Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid |
| 2013 | WALCOM | Fixed-Orientation Equilateral Triangle Matching of Point Sets. | Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid |
| 2011 | ESA | Improved Algorithms for Partial Curve Matching. | Anil Maheshwari, Jrg-Rdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh |
| 2011 | WADS | 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 |
| 2009 | ISAAC | I/O and Space-Efficient Path Traversal in Planar Graphs. | Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh |
| 2009 | SODA | Succinct geometric indexes supporting point location queries. | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
| 2009 | WADS | Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. | Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin |
| 2009 | WALCOM | Shortest Gently Descending Paths. | Mustaq Ahmed, Anna Lubiw, Anil Maheshwari |
| 2009 | WALCOM | Algorithms for Computing Diffuse Reflection Paths in Polygons. | Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda |
| 2008 | AAIM | Shortest Path Queries in Polygonal Domains. | Hua Guo, Anil Maheshwari, Jrg-Rdiger Sack |
| 2008 | ISAAC | Succinct and I/O Efficient Data Structures for Traversal in Trees. | Craig Dillabaugh, Meng He, Anil Maheshwari |
| 2008 | LATIN | Spanners of Complete k -Partite Geometric Graphs. | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid |
| 2008 | WABI | NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh |
| 2007 | HiPC | Experiments with a Parallel External Memory System. | Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari |
| 2007 | ICCSA | Shortest Path Queries Between Geometric Objects on Surfaces. | Hua Guo, Anil Maheshwari, Doron Nussbaum, Jrg-Rdiger Sack |
| 2007 | ISAAC | An | Anil Maheshwari, Doron Nussbaum, Jrg-Rdiger Sack, Jiehua Yi |
| 2007 | WAOA | Geometric Spanners with Small Chromatic Number. | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
| 2006 | ICPP | A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. | Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor |
| 2006 | MFCS | Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jrg-Rdiger Sack |
| 2003 | FCT | An Improved Approximation Algorithm for Computing Geometric Shortest Paths. | Lyudmil Aleksandrov, Anil Maheshwari, Jrg-Rdiger Sack |
| 2003 | ISAAC | A Dynamic Dictionary for Priced Information with Application. | Anil Maheshwari, Michiel H. M. Smid |
| 2003 | STACS | Approximating Geometric Bottleneck Shortest Paths. | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
| 2002 | ALENEX | Partitioning Planar Graphs with Costs and Weights. | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
| 2002 | SODA | I/O-optimal algorithms for planar graphs using separators. | Anil Maheshwari, Norbert Zeh |
| 2001 | SODA | I/O-efficient algorithms for graphs of bounded treewidth. | Anil Maheshwari, Norbert Zeh |
| 2001 | WADS | The Grid Placement Problem. | Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison |
| 2001 | WADS | I/O-Efficient Shortest Path Queries in Geometric Spanners. | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
| 2000 | ESA | I/O-Efficient Well-Separated Pair Decomposition and Its Applications. | Sathish Govindarajan, Tams Lukovszki, Anil Maheshwari, Norbert Zeh |
| 2000 | STOC | Approximation algorithms for geometric shortest path problems. | Lyudmil Aleksandrov, Anil Maheshwari, Jrg-Rdiger Sack |
| 1999 | COCOON | An External Memory Data Structure for Shortest Path Queries. | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
| 1999 | ICALP | Shortest Anisotropic Paths on Terrains. | Mark Lanthier, Anil Maheshwari, Jrg-Rdiger Sack |
| 1999 | ISAAC | External Memory Algorithms for Outerplanar Graphs. | Anil Maheshwari, Norbert Zeh |
| 1999 | SODA | Parallel Virtual Memory. | Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
| 1998 | SPAA | Blocking in Parallel Multisearch Problems (Extended Abstract). | Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
| 1996 | SPAA | Parallel Neighborhood Modeling. | David A. Hutchinson, L. Kttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jrg-Rdiger Sack |
| 1995 | ICALP | Optimal Shooting: Characterizations and Applications. | Frank Bauernppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jrg-Rdiger Sack, Jorge Urrutia |
| 1995 | ICIS | Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking. | Anil Maheshwari, Richard J. Boland Jr. |
| 1994 | ISAAC | Realizing Degree Sequences in Parallel. | Srinivasa Rao Arikati, Anil Maheshwari |
| 1994 | STACS | A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. | Anil Maheshwari, Andrzej Lingas |
| 1993 | ESA | Optimal CREW-PRAM Algorithms for Direct Dominance Problems. | Amitava Datta, Anil Maheshwari, Jrg-Rdiger Sack |
| 1993 | STACS | Multi-List Ranking: Complexity and Applications. | Anders Dessmark, Andrzej Lingas, Anil Maheshwari |
| 1992 | CSCW | Sharing Perspectives in Distributed Decision Making. | Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi |