Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAnil Maheshwari
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
showing all ?? records
2010 – today
- 2017
[j77]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017)- [j76]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: 8-18 (2017) - [j75]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63: 1-9 (2017) - [j74]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discrete Applied Mathematics 228: 80-87 (2017) - [c98]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - [c97]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. WADS 2017: 193-204 - [i36]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CoRR abs/1706.08105 (2017) - 2016
- [j73]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55: 41-58 (2016) - [j72]Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of farthest point sampling for approximating geodesics in a graph. Comput. Geom. 57: 1-7 (2016) - [j71]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57: 27-39 (2016) - [j70]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. JoCG 7(1): 444-472 (2016) - [j69]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. JoCG 7(1): 520-539 (2016) - [c96]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c95]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c94]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c93]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c92]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. SWAT 2016: 26:1-26:14 - [c91]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14 - [c90]Farah Chanchary, Anil Maheshwari:
Counting Subgraphs in Relational Event Graphs. WALCOM 2016: 194-206 - [e1]
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookSathish Govindarajan, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9602, Springer 2016, ISBN 978-3-319-29220-5 [contents]
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9602, Springer 2016, ISBN 978-3-319-29220-5 [contents]
[i35]
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty:
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016)
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016)
[i34]
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016)
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016)
[i33]
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016)
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016)
[j68]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015)
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015)
[j67]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015)
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015)
[j66]
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid:
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9): 718-731 (2015)
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9): 718-731 (2015)
[j65]
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discrete Mathematics & Theoretical Computer Science 17(2): 119-142 (2015)
Packing Plane Perfect Matchings into a Point Set. Discrete Mathematics & Theoretical Computer Science 17(2): 119-142 (2015)
[j64]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015)
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015)
[j63]
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015)
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015)
[j62]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015)
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015)
[c89]
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12
[c88]
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80
[c87]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100
[c86]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015
[c85]
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Minimum Backward Frechet Distance. CCCG 2015
Weighted Minimum Backward Frechet Distance. CCCG 2015
[c84]
Sonal Kumari, Anil Maheshwari, Poonam Goyal, Navneet Goyal:
Parallel Framework for Efficient k-means Clustering. COMPUTE 2015: 63-71
Parallel Framework for Efficient k-means Clustering. COMPUTE 2015: 63-71
[c83]
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71
[c82]
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Minimizing Walking Length in Map Matching. TTCS 2015: 105-120
Minimizing Walking Length in Map Matching. TTCS 2015: 105-120
[c81]
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS 2015: 66-78
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS 2015: 66-78
[i32]
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015)
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015)
[i31]
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015)
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015)
[i30]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong Matching of Points with Geometric Shapes. CoRR abs/1503.04871 (2015)
Strong Matching of Points with Geometric Shapes. CoRR abs/1503.04871 (2015)
[i29]
Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015)
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015)
[i28]
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015)
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. CoRR abs/1512.02257 (2015)
[i27]
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015)
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015)
[i26]
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015)
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015)
[i25]
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. CoRR abs/1512.03359 (2015)
Approximating the Integral Fréchet Distance. CoRR abs/1512.03359 (2015)
[j61]
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014)
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014)
[j60]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014)
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014)
[j59]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47(3): 377-380 (2014)
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem. Comput. Geom. 47(3): 377-380 (2014)
[j58]
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. Comput. Geom. 47(3): 435-446 (2014)
α-Visibility. Comput. Geom. 47(3): 435-446 (2014)
[j57]
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014)
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014)
[j56]
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014)
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014)
[j55]
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555: 55-70 (2014)
Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555: 55-70 (2014)
[c80]
Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99
[c79]
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. CCCG 2014
Voronoi Games and Epsilon Nets. CCCG 2014
[c78]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG 2014
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG 2014
[c77]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck Bichromatic Plane Matching of Points. CCCG 2014
Bottleneck Bichromatic Plane Matching of Points. CCCG 2014
[c76]
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Minimum backward fréchet distance. SIGSPATIAL/GIS 2014: 381-388
Minimum backward fréchet distance. SIGSPATIAL/GIS 2014: 381-388
[i24]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR abs/1409.5466 (2014)
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR abs/1409.5466 (2014)
[i23]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matching in Gabriel Graphs. CoRR abs/1410.0540 (2014)
Matching in Gabriel Graphs. CoRR abs/1410.0540 (2014)
[i22]
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014)
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014)
[j54]
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013)
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (2013)
[j53]
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013)
[j52]
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry 50(1): 124-184 (2013)
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry 50(1): 124-184 (2013)
[j51]
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. JoCG 4(1): 182-211 (2013)
Network Farthest-Point Diagrams. JoCG 4(1): 182-211 (2013)
[j50]
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Computational Science 20: 22-38 (2013)
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Computational Science 20: 22-38 (2013)
[c75]
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013
[c74]
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Region Problem in Arrangement of Lines. CCCG 2013
Weighted Region Problem in Arrangement of Lines. CCCG 2013
[c73]
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207
[c72]
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28
[i21]
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013)
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013)
[i20]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013)
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013)
[i19]
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013)
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013)
[i18]
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer:
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph. CoRR abs/1311.4665 (2013)
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph. CoRR abs/1311.4665 (2013)
[i17]
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR abs/1311.5197 (2013)
Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR abs/1311.5197 (2013)
[j49]
Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012)
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012)
[j48]
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012)
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012)
[j47]
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for computing diffuse reflection paths in polygons. The Visual Computer 28(12): 1229-1237 (2012)
Algorithms for computing diffuse reflection paths in polygons. The Visual Computer 28(12): 1229-1237 (2012)
[c71]
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid:
xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40
xy-Monotone Path Existence Queries in a Rectilinear Environment. CCCG 2012: 35-40
[c70]
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. CCCG 2012: 199-204
On Farthest-Point Information in Networks. CCCG 2012: 199-204
[c69]
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy:
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137
[c68]
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. SWAT 2012: 1-12
α-Visibility. SWAT 2012: 1-12
[i16]
Minati De, Anil Maheshwari, Subhas C. Nandy:
Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012)
Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012)
[i15]
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012)
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012)
[i14]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012)
Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012)
[i13]
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012)
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012)
[j46]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011)
Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011)
[j45]
Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer:
A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011)
A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011)
[j44]
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011)
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111(23-24): 1120-1123 (2011)
[j43]
Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)
[j42]
Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh:
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE/ACM Trans. Comput. Biology Bioinform. 8(2): 551-556 (2011)
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE/ACM Trans. Comput. Biology Bioinform. 8(2): 551-556 (2011)
[c67]
Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari:
Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011
Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011
[c66]
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. CCCG 2011
An In-Place Priority Search Tree. CCCG 2011
[c65]
Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid:
Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011
Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011
[c64]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Staying Close to a Curve. CCCG 2011
Staying Close to a Curve. CCCG 2011
[c63]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529
Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529
[c62]
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146
[i12]
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011)
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011)
[i11]
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011)
[j41]
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010)
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010)
[j40]
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)
[j39]
Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010)
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010)
[j38]
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)
[c61]
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182
Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182
[c60]
Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235
[i10]
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)
[i9]
Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
[i8]
Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari:
Customer Appeasement Scheduling. CoRR abs/1012.3452 (2010)
Customer Appeasement Scheduling. CoRR abs/1012.3452 (2010)
2000 – 2009
- 2009
- [j37]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009) - [j36]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [j35]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) - [j34]Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009) - [j33]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [c59]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz:
Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110 - [c58]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184 - [c57]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 - [c56]Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109 - [c55]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58 - [c54]
- [i7]Anil Maheshwari, Stefanie Wuhrer:
Geodesic Paths On 3D Surfaces: Survey and Open Problems. CoRR abs/0904.2550 (2009) - 2008
- [j32]Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008) - [j31]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - [j30]Anil Maheshwari, Norbert Zeh:
I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008) - [c53]Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack:
Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211 - [c52]