Anil Maheshwari

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 146

Top Venues

Publications

Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001 (2024)
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M, Bodhayan Roy, Sasanka Roy, Abhishek Sahu
Minimum Consistent Subset in Trees and Interval Graphs. CoRR (2024)
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
Geometric Covering via Extraction Theorem. ITCS (2024)
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR (2024)
Minati De, Anil Maheshwari, Ratnadip Mandal
Online class cover problem. Comput. Geom. 123 (2024)
Amirali Madani, Anil Maheshwari
Distance-Preserving Graph Compression Techniques. J. Graph Algorithms Appl. 28 (1) (2024)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR (2024)
Minati De, Anil Maheshwari, Ratnadip Mandal
Online Class Cover Problem. CoRR (2023)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27 (1) (2023)
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM (2023)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum consistent subset of simple graph classes. Discret. Appl. Math. 338 (2023)
Amirali Madani, Anil Maheshwari
Distance-Preserving Graph Compression Techniques. CoRR (2023)
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
Acrophobic guard watchtower problem. Comput. Geom. 109 (2023)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant delay lattice train schedules. Discret. Appl. Math. 339 (2023)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
On Separating Path and Tree Systems in Graphs. CoRR (2023)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33 (3&4) (2023)
Vikash Tripathi, Arti Pandey, Anil Maheshwari
A linear-time algorithm for semitotal domination in strongly chordal graphs. Discret. Appl. Math. 338 (2023)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. Algorithmica 84 (1) (2022)
Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
Weighted shortest path in equilateral triangular meshes. CCCG (2022)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103 (2022)
Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS (2022)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1 (1) (2022)
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100 (2022)
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Voronoi Games Using Geodesics. CALDAM (2022)
Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
-dimensional polyhedral structures. Comput. Geom. 107 (2022)
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Shortest paths among transient obstacles. J. Comb. Optim. 43 (5) (2022)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
On the Minimum Consistent Subset Problem. Algorithmica 83 (7) (2021)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. WADS (2021)
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
An Acrophobic Guard Watchtower Problem on Terrains. CCCG (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC (2021)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Color-spanning localized query. Theor. Comput. Sci. 861 (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. WADS (2021)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66 (4) (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset of Simple Graph Classes. CALDAM (2021)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Voronoi game on polygons. Theor. Comput. Sci. 882 (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset Problem for Trees. FCT (2021)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant Delay Lattice Train Schedules. CCCG (2021)
Farah Chanchary, Anil Maheshwari, Michiel Smid
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305 (2021)
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
Constant Delay Lattice Train Schedules. CoRR (2021)
Vikash Tripathi, Arti Pandey, Anil Maheshwari
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR (2021)
Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. LATIN (2020)
Michiel Smid, Anil Maheshwari, Wolfgang Mulzer
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. J. Comput. Geom. 11 (1) (2020)
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89 (2020)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12 (1) (2020)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020)
Sathish Govindarajan, Anil Maheshwari
Preface: CALDAM 2016. Discret. Appl. Math. 280 (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid
Covering Points with Pairs of Concentric Disks. CCCG (2020)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA (2020)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286 (2020)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM (2020)
Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR (2020)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. SWAT (2020)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing boundary-anchored rectangles and squares. Comput. Geom. 88 (2020)
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR (2019)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of covering cells with line segments. Theor. Comput. Sci. 784 (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip distance to some plane configurations. Comput. Geom. 81 (2019)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. CoRR (2019)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164 (1) (2019)
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29 (4) (2019)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82 (2019)
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793 (2019)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81 (4) (2019)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing Boundary-Anchored Rectangles and Squares. CoRR (2019)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. WADS (2019)
Farah Chanchary, Anil Maheshwari
Time Windowed Data Structures for Graphs. J. Graph Algorithms Appl. 23 (2) (2019)
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
Weighted minimum backward Fréchet distance. Theor. Comput. Sci. 783 (2019)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Localized Query: Color Spanning Variations. CALDAM (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS (2019)
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR (2019)
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29 (1) (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR (2019)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Color spanning Localized query. CoRR (2019)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS (2018)
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Rectilinear Shortest Paths Among Transient Obstacles. COCOA (2018)
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Time-Dependent Shortest Path Queries Among Growing Discs. CoRR (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Flip Distance to some Plane Configurations. SWAT (2018)
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Rectilinear Shortest Paths Among Transient Obstacles. CoRR (2018)
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59 (4) (2018)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR (2018)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG (2018)
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
Approximating the integral Fréchet distance. Comput. Geom. (2018)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM (2018)
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80 (11) (2018)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of Covering Cells with Line Segments. CoRR (2018)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of Covering Cells with Line Segments. COCOA (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR (2018)
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR (2018)
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
Path Refinement in Weighted Regions. Algorithmica 80 (12) (2018)
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Time-Dependent Shortest Path Queries Among Growing Discs. CCCG (2018)
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
Geometric Path Problems with Violations. Algorithmica 80 (2) (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Strong matching of points with geometric shapes. Comput. Geom. 68 (2018)
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. CoRR (2018)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CCCG (2018)
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM (2017)
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
Compatible 4-Holes in Point Sets. CoRR (2017)
Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60 (2017)

Anil Maheshwari.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anil Maheshwari