Anil Maheshwari

344 papers A* 12A 10B 34C 10Misc 3Journal 202Unranked 70
YearRankTypeTitle / Venue / Authors
2026 J jnl
Algorithms and hardness results for the (k,ℓ)-cover problem.
J. Comput. Syst. Sci.
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2026 J jnl
Linear-Time (1+ϵ)-Approximation Algorithms for Two-Line-Center Problems.
CoRR
Chaeyoon Chung, Anil Maheshwari, Michiel Smid
2026 J jnl
Triangle-covered graphs: Algorithms, complexity, and structure.
Theor. Comput. Sci.
Amirali Madani, Anil Maheshwari, Bobby Miraftab, Pawel Zylinski
2025 — conf
Algorithms and Hardness Results for the (3, 1)-Cover Problem.
CALDAM
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2025 J jnl
Algorithms and Hardness Results for the (k,ℓ)-Cover Problem.
CoRR
Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
2025 A* conf
Computing Oriented Spanners and Their Dilation.
SoCG
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong
2025 J jnl
Deciding if a DAG is Interesting is Hard.
CoRR
Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak, Bodhayan Roy, Michiel Smid, Marc Vicuna
2025 J jnl
Euclidean Maximum Matchings in the Plane - Local to Global.
Algorithmica
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2025 J jnl
Metric and geometric spanners that are resilient to degree-bounded edge faults.
J. Comput. Geom.
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
2025 J jnl
Noncrossing Longest Paths and Cycles.
Graphs Comb.
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2025 J jnl
On 1-planar graphs with bounded cop-number.
Theor. Comput. Sci.
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali
2025 J jnl
On Separating Path and Tree Systems in Graphs.
Discret. Math. Theor. Comput. Sci.
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2025 J jnl
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results.
CoRR
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy, Bodhayan Roy
2025 — conf
Partial Domination in Some Geometric Intersection Graphs.
CALDAM
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy
2025 A* conf
Polychromatic Coloring of Tuples in Hypergraphs.
SoCG
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Milos Stojakovic
2025 J jnl
Polychromatic Coloring of Tuples in Hypergraphs.
CoRR
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Milos Stojakovic
2025 A* conf
Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems.
SoCG
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, Da Wei Zheng
2025 B conf
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
WADS
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2025 J jnl
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2025 J jnl
Triangle-Covered Graphs: Algorithms, Complexity, and Structure.
CoRR
Amirali Madani, Anil Maheshwari, Babak Miraftab, Pawel Zylinski
2024 J jnl
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes.
Theor. Comput. Sci.
Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
2024 — ed.
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings
CALDAM
Subrahmanyam Kalyanasundaram, Anil Maheshwari
2024 J jnl
Computing Oriented Spanners and their Dilation.
CoRR
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Michiel Smid, Carolin Rehs, Sampson Wong
2024 — conf
Computing shortest paths amid non-overlapping weighted disks.
CCCG
Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari
2024 J jnl
Computing shortest paths amid non-overlapping weighted disks.
CoRR
Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari
2024 J jnl
Contiguous Boundary Guarding.
CoRR
Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Thomas C. Shermer
2024 J jnl
Distance-Preserving Graph Compression Techniques.
J. Graph Algorithms Appl.
Amirali Madani, Anil Maheshwari
2024 J jnl
Euclidean Maximum Matchings in the Plane - Local to Global.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2024 A conf
Geometric Covering via Extraction Theorem.
ITCS
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
2024 J jnl
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults.
CoRR
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
2024 — conf
Minimum Consistent Subset in Trees and Interval Graphs.
FSTTCS
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024 J jnl
Minimum Consistent Subset in Trees and Interval Graphs.
CoRR
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024 A conf
Noncrossing Longest Paths and Cycles.
GD
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
Noncrossing Longest Paths and Cycles.
CoRR
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
On 1-Planar Graphs with Bounded Cop-Number.
CoRR
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali
2024 J jnl
Online class cover problem.
Comput. Geom.
Minati De, Anil Maheshwari, Ratnadip Mandal
2024 J jnl
The basis number of 1-planar graphs.
CoRR
Saman Bazargani, Therese Biedl, Prosenjit Bose, Anil Maheshwari, Babak Miraftab
2023 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
Discret. Appl. Math.
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2023 J jnl
Acrophobic guard watchtower problem.
Comput. Geom.
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
2023 J jnl
Constant delay lattice train schedules.
Discret. Appl. Math.
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
2023 J jnl
Distance-Preserving Graph Compression Techniques.
CoRR
Amirali Madani, Anil Maheshwari
2023 J jnl
Maximum Bipartite Subgraphs of Geometric Intersection Graphs.
Int. J. Comput. Geom. Appl.
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2023 J jnl
Minimum consistent subset of simple graph classes.
Discret. Appl. Math.
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2023 J jnl
On Separating Path and Tree Systems in Graphs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2023 J jnl
Online Class Cover Problem.
CoRR
Minati De, Anil Maheshwari, Ratnadip Mandal
2023 — conf
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane.
CALDAM
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2023 J jnl
The Minimum Moving Spanning Tree Problem.
J. Graph Algorithms Appl.
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2022 J jnl
An Ω(
Comput. Geom.
Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
2022 J jnl
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points.
Comput. Geom. Topol.
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2022 J jnl
Bounded-Angle Minimum Spanning Trees.
Algorithmica
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
2022 J jnl
Computing maximum independent set on outerstring graphs and their relatives.
Comput. Geom.
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
2022 — conf
Half-Guarding Weakly-Visible Polygons and Terrains.
FSTTCS
Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow
2022 J jnl
Linear-size planar Manhattan network for convex point sets.
Comput. Geom.
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
2022 J jnl
Shortest paths among transient obstacles.
J. Comb. Optim.
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2022 — conf
Voronoi Games Using Geodesics.
CALDAM
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2022 — conf
Weighted shortest path in equilateral triangular meshes.
CCCG
Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
2021 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
CoRR
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2021 — conf
An Acrophobic Guard Watchtower Problem on Terrains.
CCCG
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
2021 J jnl
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
Discret. Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
2021 J jnl
Approximating bottleneck spanning trees on partitioned tuples of points.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021 J jnl
Color-spanning localized query.
Theor. Comput. Sci.
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2021 — conf
Constant Delay Lattice Train Schedules.
CCCG
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
2021 J jnl
Constant Delay Lattice Train Schedules.
CoRR
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira
2021 B conf
Euclidean Maximum Matchings in the Plane - Local to Global.
WADS
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021 B conf
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane.
ISAAC
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021 J jnl
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane.
CoRR
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021 B conf
Minimum Consistent Subset Problem for Trees.
FCT
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2021 — conf
Minimum Consistent Subset of Simple Graph Classes.
CALDAM
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2021 J jnl
On the Minimum Consistent Subset Problem.
Algorithmica
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
2021 B conf
The Minimum Moving Spanning Tree Problem.
WADS
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2021 J jnl
Voronoi game on polygons.
Theor. Comput. Sci.
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2021 J jnl
Window queries for intersecting objects, maximal points and approximations using coresets.
Discret. Appl. Math.
Farah Chanchary, Anil Maheshwari, Michiel Smid
2020 J jnl
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics.
CoRR
Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid
2020 J jnl
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics.
J. Comput. Geom.
Michiel Smid, Anil Maheshwari, Wolfgang Mulzer
2020 B conf
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures.
LATIN
Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack
2020 J jnl
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs.
Inf. Process. Lett.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2020 — conf
Bounded-Angle Minimum Spanning Trees.
SWAT
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
2020 — conf
Covering Points with Pairs of Concentric Disks.
CCCG
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid
2020 J jnl
Faster algorithms for some optimization problems on collinear points.
J. Comput. Geom.
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2020 B conf
Maximum Bipartite Subgraph of Geometric Intersection Graphs.
WALCOM
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2020 J jnl
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.
Comput. Geom.
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2020 C conf
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.
COCOA
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
2020 J jnl
Packing boundary-anchored rectangles and squares.
Comput. Geom.
Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2020 J jnl
Plane and planarity thresholds for random geometric graphs.
Discret. Math. Algorithms Appl.
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2020 J jnl
Preface: CALDAM 2016.
Discret. Appl. Math.
Sathish Govindarajan, Anil Maheshwari
2020 J jnl
Querying relational event graphs using colored range searching data structures.
Discret. Appl. Math.
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2019 J jnl
Approximability of covering cells with line segments.
Theor. Comput. Sci.
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2019 J jnl
Approximating dominating set on intersection graphs of rectangles and L-frames.
Comput. Geom.
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2019 J jnl
Color spanning Localized query.
CoRR
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2019 B conf
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
WADS
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019 J jnl
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
CoRR
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019 J jnl
Flip Distance to some Plane Configurations.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2019 J jnl
Flip distance to some plane configurations.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2019 J jnl
Linear Size Planar Manhattan Network for Convex Point Sets.
CoRR
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
2019 — conf
Localized Query: Color Spanning Variations.
CALDAM
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2019 J jnl
Maximum Bipartite Subgraph of Geometric Intersection Graphs.
CoRR
Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2019 J jnl
Maximum Plane Trees in Multipartite Geometric Graphs.
Algorithmica
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2019 B conf
On the Minimum Consistent Subset Problem.
WADS
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
2019 J jnl
Packing Boundary-Anchored Rectangles and Squares.
CoRR
Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2019 J jnl
Partial Enclosure Range Searching.
Int. J. Comput. Geom. Appl.
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
2019 J jnl
The Most Likely Object to be Seen Through a Window.
Int. J. Comput. Geom. Appl.
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2019 J jnl
The discrete Voronoi game in a simple polygon.
Theor. Comput. Sci.
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2019 J jnl
Time Windowed Data Structures for Graphs.
J. Graph Algorithms Appl.
Farah Chanchary, Anil Maheshwari
2019 J jnl
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model.
Fundam. Informaticae
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
2019 J jnl
Weighted minimum backward Fréchet distance.
Theor. Comput. Sci.
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2018 C conf
Approximability of Covering Cells with Line Segments.
COCOA
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Approximability of Covering Cells with Line Segments.
CoRR
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Approximating Dominating Set on Intersection Graphs of L-frames.
CoRR
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018 B conf
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames.
MFCS
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018 A* conf
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
SoCG
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
2018 J jnl
Approximating the integral Fréchet distance.
Comput. Geom.
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2018 — conf
Compatible 4-Holes in Point Sets.
CCCG
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018 A* conf
Faster Algorithms for some Optimization Problems on Collinear Points.
SoCG
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018 J jnl
Faster Algorithms for some Optimization Problems on Collinear Points.
CoRR
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018 — conf
Flip Distance to some Plane Configurations.
SWAT
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018 J jnl
Geometric Path Problems with Violations.
Algorithmica
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
2018 J jnl
On the Minimum Consistent Subset Problem.
CoRR
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
2018 J jnl
Path Refinement in Weighted Regions.
Algorithmica
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2018 J jnl
Plane Bichromatic Trees of Low Degree.
Discret. Comput. Geom.
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2018 J jnl
Plane and Planarity Thresholds for Random Geometric Graphs.
CoRR
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2018 C conf
Rectilinear Shortest Paths Among Transient Obstacles.
COCOA
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018 J jnl
Rectilinear Shortest Paths Among Transient Obstacles.
CoRR
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018 J jnl
Spanning Trees in Multipartite Geometric Graphs.
Algorithmica
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2018 J jnl
Strong matching of points with geometric shapes.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018 — conf
Time-Dependent Shortest Path Queries Among Growing Discs.
CCCG
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018 J jnl
Time-Dependent Shortest Path Queries Among Growing Discs.
CoRR
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018 — conf
Window Queries for Problems on Intersecting Objects and Maximal Points.
CALDAM
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2017 J jnl
An optimal algorithm for plane matchings in multipartite geometric graphs.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2017 J jnl
Approximation algorithms for the unit disk cover problem in 2D and 3D.
Comput. Geom.
Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid
2017 J jnl
Compatible 4-Holes in Point Sets.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2017 J jnl
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.
J. Graph Algorithms Appl.
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
2017 J jnl
I/O-Efficient Path Traversal in Succinct Planar Graphs.
Algorithmica
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
2017 B conf
Maximum Plane Trees in Multipartite Geometric Graphs.
WADS
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2017 — conf
Packing Boundary-Anchored Rectangles.
CCCG
Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2017 — conf
Querying Relational Event Graphs Using Colored Range Searching Data Structures.
CALDAM
Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2017 J jnl
Rectilinear path problems in restricted memory setup.
Discret. Appl. Math.
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2017 J jnl
Towards plane spanners of degree 3.
J. Comput. Geom.
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016 — conf
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.
CCCG
Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid
2016 — conf
A Plane 1.88-Spanner for Points in Convex Position.
SWAT
Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
A plane 1.88-spanner for points in convex position.
J. Comput. Geom.
Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel
2016 — ed.
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings
CALDAM
Sathish Govindarajan, Anil Maheshwari
2016 J jnl
Analysis of farthest point sampling for approximating geodesics in a graph.
Comput. Geom.
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer
2016 — conf
Approximating the Integral Fréchet Distance.
SWAT
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2016 B conf
Counting Subgraphs in Relational Event Graphs.
WALCOM
Farah Chanchary, Anil Maheshwari
2016 J jnl
Discrete Voronoi games and ϵ-nets, in two and three dimensions.
Comput. Geom.
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2016 — conf
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
SWAT
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.
J. Comput. Geom.
Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
2016 C conf
Plane Bichromatic Trees of Low Degree.
IWOCA
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.
Comput. Geom.
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
Spanning Trees in Multipartite Geometric Graphs.
CoRR
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2016 J jnl
The Runaway Rectangle Escape Problem.
CoRR
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
2016 B conf
Towards Plane Spanners of Degree 3.
ISAAC
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016 J jnl
Towards Plane Spanners of Degree 3.
CoRR
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.
CCCG
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu
2015 B conf
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs.
WADS
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2015 J jnl
Approximating the Integral Fréchet Distance.
CoRR
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2015 J jnl
Approximating the bottleneck plane perfect matching of a point set.
Comput. Geom.
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Approximation algorithms for the two-center problem of convex polygon.
CoRR
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
2015 J jnl
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions.
CoRR
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties.
CALDAM
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Matchings in higher-order Gabriel graphs.
Theor. Comput. Sci.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Minimizing Walking Length in Map Matching.
TTCS
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2015 J jnl
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.
CoRR
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
On full Steiner trees in unit disk graphs.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere.
CoRR
Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid
2015 J jnl
On the hardness of full Steiner tree problems.
J. Discrete Algorithms
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
J. Graph Algorithms Appl.
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Packing Plane Perfect Matchings into a Point Set.
CoRR
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Packing Plane Perfect Matchings into a Point Set.
Discret. Math. Theor. Comput. Sci.
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Parallel Framework for Efficient k-means Clustering.
COMPUTE
Sonal Kumari, Anil Maheshwari, Poonam Goyal, Navneet Goyal
2015 J jnl
Plane Bichromatic Trees of Low Degree.
CoRR
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon.
TTCS
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid
2015 C conf
Plane and Planarity Thresholds for Random Geometric Graphs.
ALGOSENSORS
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Rectilinear Path Problems in Restricted Memory Setup.
CALDAM
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2015 J jnl
Strong Matching of Points with Geometric Shapes.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2015 — conf
Weighted Minimum Backward Frechet Distance.
CCCG
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2014 C conf
A Facility Coloring Problem in 1-D.
AAIM
Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid
2014 J jnl
A note on the unsolvability of the weighted region shortest path problem.
Comput. Geom.
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2014 J jnl
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.
Comput. Geom.
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 — conf
Approximating Full Steiner Tree in a Unit Disk Graph.
CCCG
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 — conf
Bottleneck Bichromatic Plane Matching of Points.
CCCG
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
Fixed-orientation equilateral triangle matching of point sets.
Theor. Comput. Sci.
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
Improved Algorithms for Partial Curve Matching.
Algorithmica
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2014 J jnl
Matching in Gabriel Graphs.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2014 — conf
Minimum backward fréchet distance.
SIGSPATIAL/GIS
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2014 J jnl
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
CoRR
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
Similarity of polygonal curves in the presence of outliers.
Comput. Geom.
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2014 J jnl
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
Algorithmica
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
2014 — conf
Voronoi Games and Epsilon Nets.
CCCG
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
2014 J jnl
α-Visibility.
Comput. Geom.
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2013 J jnl
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
CoRR
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
2013 J jnl
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.
Discret. Comput. Geom.
Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2013 J jnl
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013 J jnl
An in-place min-max priority search tree.
Comput. Geom.
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2013 J jnl
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph.
CoRR
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer
2013 J jnl
Approximating the Bottleneck Plane Perfect Matching of a Point Set.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013 B conf
Fixed-Orientation Equilateral Triangle Matching of Point Sets.
WALCOM
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2013 J jnl
Localized geometric query problems.
Comput. Geom.
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2013 J jnl
Network Farthest-Point Diagrams
CoRR
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013 J jnl
Network Farthest-Point Diagrams.
J. Comput. Geom.
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid
2013 J jnl
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation.
Trans. Comput. Sci.
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy
2013 — conf
Optimal Data Structures for Farthest-Point Queries in Cactus Networks.
CCCG
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2013 Misc conf
The Discrete Voronoi Game in a Simple Polygon.
COCOON
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2013 — conf
Weighted Region Problem in Arrangement of Lines.
CCCG
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2012 J jnl
Algorithms for computing diffuse reflection paths in polygons.
Vis. Comput.
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2012 J jnl
Fixed-Orientation Equilateral Triangle Matching of Point Sets
CoRR
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2012 — conf
On Farthest-Point Information in Networks.
CCCG
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid
2012 — conf
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation.
ISVD
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy
2012 J jnl
Similarity of Polygonal Curves in the Presence of Outliers
CoRR
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2012 J jnl
Space-efficient Algorithms for Visibility Problems in Simple Polygon
CoRR
Minati De, Anil Maheshwari, Subhas C. Nandy
2012 J jnl
Succinct and I/O Efficient Data Structures for Traversal in Trees.
Algorithmica
Craig Dillabaugh, Meng He, Anil Maheshwari
2012 J jnl
Succinct geometric indexes supporting point location queries.
ACM Trans. Algorithms
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2012 J jnl
Visiting All Sites with Your Dog
CoRR
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
2012 — conf
xy-Monotone Path Existence Queries in a Rectilinear Environment.
CCCG
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid
2012 — conf
α-Visibility.
SWAT
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2011 J jnl
A survey of geodesic paths on 3D surfaces.
Comput. Geom.
Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer
2011 J jnl
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
CoRR
Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2011 J jnl
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.
IEEE ACM Trans. Comput. Biol. Bioinform.
Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh
2011 — conf
An In-Place Priority Search Tree.
CCCG
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011 — conf
Approximation Algorithms for a Triangle Enclosure Problem.
CCCG
Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid
2011 J jnl
Fréchet distance with speed limits.
Comput. Geom.
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011 A conf
Improved Algorithms for Partial Curve Matching.
ESA
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011 J jnl
Localized Geometric Query Problems
CoRR
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2011 J jnl
Low-interference networks in metric spaces of bounded doubling dimension.
Inf. Process. Lett.
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2011 J jnl
On the number of shortest descending paths on the surface of a convex terrain.
J. Discrete Algorithms
Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2011 — conf
Point Location in Well-Shaped Meshes Using Jump-and-Walk.
CCCG
Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari
2011 — conf
Staying Close to a Curve.
CCCG
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011 B conf
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
WADS
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
2010 J jnl
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Discret. Comput. Geom.
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2010 J jnl
Approximation algorithms for shortest descending paths in terrains.
J. Discrete Algorithms
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
2010 J jnl
Computing the Greedy Spanner in Near-Quadratic Time.
Algorithmica
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2010 J jnl
Customer Appeasement Scheduling
CoRR
Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari
2010 J jnl
Improved Methods For Generating Quasi-Gray Codes
CoRR
Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010 — conf
Improved Methods For Generating Quasi-gray Codes.
SWAT
Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010 J jnl
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
CoRR
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2010 J jnl
Sigma-local graphs.
J. Discrete Algorithms
Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010 — conf
Speed-constrained geodesic fréchet distance inside a simple polygon.
CCCG
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2009 J jnl
A linear-space algorithm for distance preserving graph embedding.
Comput. Geom.
Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2009 B conf
Algorithms for Computing Diffuse Reflection Paths in Polygons.
WALCOM
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009 J jnl
Algorithms for optimal outlier removal.
J. Discrete Algorithms
Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer
2009 — conf
Computing Fréchet Distance with Speed Limits.
CCCG
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
2009 J jnl
Geodesic Paths On 3D Surfaces: Survey and Open Problems
CoRR
Anil Maheshwari, Stefanie Wuhrer
2009 J jnl
Geometric spanners with small chromatic number.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2009 B conf
I/O and Space-Efficient Path Traversal in Planar Graphs.
ISAAC
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
2009 J jnl
I/O-Efficient Algorithms for Graphs of Bounded Treewidth.
Algorithmica
Anil Maheshwari, Norbert Zeh
2009 B conf
Shortest Gently Descending Paths.
WALCOM
Mustaq Ahmed, Anna Lubiw, Anil Maheshwari
2009 J jnl
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput.
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2009 B conf
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.
WADS
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
2009 A* conf
Succinct geometric indexes supporting point location queries.
SODA
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2008 J jnl
Approximation Algorithms for Shortest Descending Paths in Terrains
CoRR
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
2008 — conf
Computing the Greedy Spanner in Near-Quadratic Time.
SWAT
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2008 J jnl
I/O-Efficient Planar Separators.
SIAM J. Comput.
Anil Maheshwari, Norbert Zeh
2008 J jnl
I/O-efficient algorithms for computing planar geometric spanners.
Comput. Geom.
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2008 J jnl
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
CoRR
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
2008 C conf
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.
WABI
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
2008 J jnl
On the false-positive rate of Bloom filters.
Inf. Process. Lett.
Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang
2008 C conf
Shortest Path Queries in Polygonal Domains.
AAIM
Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack
2008 B conf
Spanners of Complete k -Partite Geometric Graphs.
LATIN
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2008 J jnl
Succinct Geometric Indexes Supporting Point Location Queries
CoRR
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2008 B conf
Succinct and I/O Efficient Data Structures for Traversal in Trees.
ISAAC
Craig Dillabaugh, Meng He, Anil Maheshwari
2007 B conf
An
ISAAC
Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2007 — conf
Approximate Shortest Descent Path on a Terrain.
CCCG
Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari
2007 Misc conf
Experiments with a Parallel External Memory System.
HiPC
Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari
2007 J jnl
Geometric Spanners With Small Chromatic Number
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007 B conf
Geometric Spanners with Small Chromatic Number.
WAOA
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007 — conf
Linear-Space Algorithms for Distance Preserving Embedding.
CCCG
Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2007 — conf
Shortest Path Queries Between Geometric Objects on Surfaces.
ICCSA (1)
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2007 J jnl
Space-efficient geometric divide-and-conquer algorithms.
Comput. Geom.
Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
2007 J jnl
Spanners of Complete $k$-Partite Geometric Graphs
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2006 B conf
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams.
ICPP
Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor
2006 J jnl
A Dynamic Dictionary for Priced Information with Application.
Algorithmica
Anil Maheshwari, Michiel H. M. Smid
2006 B conf
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
MFCS
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2006 J jnl
I/O-Efficient Well-Separated Pair Decomposition and Applications.
Algorithmica
Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
2006 J jnl
Partitioning planar graphs with costs and weights.
ACM J. Exp. Algorithmics
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2005 J jnl
Determining approximate shortest paths on weighted polyhedral surfaces.
J. ACM
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2005 C conf
On computing Fréchet distance of two paths on a convex polyhedron.
EuroCG
Anil Maheshwari, Jiehua Yi
2004 J jnl
Approximating geometric bottleneck shortest paths.
Comput. Geom.
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
2004 J jnl
I/O-Optimal Algorithms for Outerplanar Graphs.
J. Graph Algorithms Appl.
Anil Maheshwari, Norbert Zeh
2003 B conf
A Dynamic Dictionary for Priced Information with Application.
ISAAC
Anil Maheshwari, Michiel H. M. Smid
2003 B conf
An Improved Approximation Algorithm for Computing Geometric Shortest Paths.
FCT
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2003 J jnl
An external memory data structure for shortest path queries.
Discret. Appl. Math.
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
2003 A conf
Approximating Geometric Bottleneck Shortest Paths.
STACS
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
2003 J jnl
Fast approximations for sums of distances, clustering and the Fermat-Weber problem.
Comput. Geom.
Prosenjit Bose, Anil Maheshwari, Pat Morin
2003 J jnl
Translating a regular grid over a point set.
Comput. Geom.
Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison
2002 — conf
A Survey of Techniques for Designing I/O-Efficient Algorithms.
Algorithms for Memory Hierarchies
Anil Maheshwari, Norbert Zeh
2002 J jnl
Bulk Synchronous Parallel Algorithms for the External Memory Model.
Theory Comput. Syst.
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
2002 A* conf
I/O-optimal algorithms for planar graphs using separators.
SODA
Anil Maheshwari, Norbert Zeh
2002 — conf
On reverse nearest neighbor queries.
CCCG
Anil Maheshwari, Jan Vahrenhold, Norbert Zeh
2002 A conf
Partitioning Planar Graphs with Costs and Weights.
ALENEX
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2001 J jnl
Approximating Shortest Paths on Weighted Polyhedral Surfaces.
Algorithmica
Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
2001 J jnl
Blocking in Parallel Multisearch Problems.
Theory Comput. Syst.
Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
2001 — conf
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.
FSTTCS
Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
2001 B conf
I/O-Efficient Shortest Path Queries in Geometric Spanners.
WADS
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2001 A* conf
I/O-efficient algorithms for graphs of bounded treewidth.
SODA
Anil Maheshwari, Norbert Zeh
2001 J jnl
Ray shooting from convex ranges.
Discret. Appl. Math.
Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
2001 B conf
The Grid Placement Problem.
WADS
Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
2000 A* conf
Approximation algorithms for geometric shortest path problems.
STOC
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
2000 A conf
I/O-Efficient Well-Separated Pair Decomposition and Its Applications.
ESA
Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
2000 — ch.
Link Distance Problems.
Handbook of Computational Geometry
Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev
1999 Misc conf
An External Memory Data Structure for Shortest Path Queries.
COCOON
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
1999 J jnl
Database Security for the Web.
Inf. Syst. Manag.
Anil Maheshwari
1999 B conf
External Memory Algorithms for Outerplanar Graphs.
ISAAC
Anil Maheshwari, Norbert Zeh
1999 A* conf
Parallel Virtual Memory.
SODA
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
1999 — conf
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms.
IPPS/SPDP
Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich
1999 A* conf
Shortest Anisotropic Paths on Terrains.
ICALP
Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1999 J jnl
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems.
Parallel Process. Lett.
Anil Maheshwari, Jörg-Rüdiger Sack
1998 — conf
Algorithms for Packing Two Circles in a Convex Polygon.
JCDCG
Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari
1998 — conf
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.
SWAT
Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1998 B conf
Blocking in Parallel Multisearch Problems (Extended Abstract).
SPAA
Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
1998 — conf
Polygon Cutting: Revisited.
JCDCG
Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari
1997 J jnl
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.
Parallel Process. Lett.
Andrzej Lingas, Anil Maheshwari
1997 — conf
Approximating Weighted Shortest Paths on Polyhedral Surfaces.
SCG
Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1997 — conf
Approximating Weighted Shortest Paths on Polyhedral Surfaces.
SCG
Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
1997 — conf
Early Experiences in Implementing the Buffer Tree.
WAE
David A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu
1997 J jnl
Efficient Computation of Implicit Representations of Sparse Graphs.
Discret. Appl. Math.
Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
1997 J jnl
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci.
Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
1997 — conf
Progressive TINs: Algorithms and Applications.
ACM-GIS
Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack
1997 J jnl
Stage-graph Representations.
Discret. Appl. Math.
Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
1996 J jnl
Optimal Parallel Algorithms for Direct Dominance Problems.
Nord. J. Comput.
Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
1996 B conf
Parallel Neighborhood Modeling.
SPAA
David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
1996 — conf
Parallel Neighbourhood Modelling.
ACM-GIS
David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
1996 J jnl
Realizing Degree Sequences in Parallel.
SIAM J. Discret. Math.
Srinivasa Rao Arikati, Anil Maheshwari
1995 — conf
A note on approximations of rectilinear polygons.
CCCG
Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
1995 J jnl
Multilist Layering: Complexity and Applications.
Theor. Comput. Sci.
Anders Dessmark, Andrzej Lingas, Anil Maheshwari
1995 J jnl
NC-Algorithms for Minimum Link Path and Related Problems.
J. Algorithms
Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja
1995 J jnl
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
Algorithmica
Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1995 A* conf
Optimal Shooting: Characterizations and Applications.
ICALP
Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
1995 C conf
Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking.
ICIS
Anil Maheshwari, Richard J. Boland Jr.
1994 A conf
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.
STACS
Anil Maheshwari, Andrzej Lingas
1994 — conf
An O(n) Algorithm for Realizing Degree Sequences.
FSTTCS
Srinivasa Rao Arikati, Anil Maheshwari
1994 J jnl
An algorithm for recognizing palm polygons.
Vis. Comput.
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
1994 B conf
Realizing Degree Sequences in Parallel.
ISAAC
Srinivasa Rao Arikati, Anil Maheshwari
1994 — conf
Saving Bits Made Easy.
CCCG
Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
1993 J jnl
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom.
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
1993 A conf
Multi-List Ranking: Complexity and Applications.
STACS
Anders Dessmark, Andrzej Lingas, Anil Maheshwari
1993 A conf
Optimal CREW-PRAM Algorithms for Direct Dominance Problems.
ESA
Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
1993 — conf
Parallel Algorithms for Rectilinear Link Distance Problems.
IPPS
Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
1992 J jnl
An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree.
Inf. Process. Lett.
Subir Kumar Ghosh, Anil Maheshwari
1992 — conf
Parallel Algorithms for All Minimum Link Paths and Link Center Problems.
SWAT
Subir Kumar Ghosh, Anil Maheshwari
1992 A conf
Sharing Perspectives in Distributed Decision Making.
CSCW
Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi
1991 — conf
Computing the Shortest Path Tree in a Weak Visibility Polygon.
FSTTCS
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
1990 J jnl
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon.
Inf. Process. Lett.
Subir Kumar Ghosh, Anil Maheshwari