Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnil Maheshwari
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j115]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
Acrophobic guard watchtower problem. Comput. Geom. 109: 101918 (2023)- [j114]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): 1-18 (2023) - [c128]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - 2022
- [j113]Ahmad Biniaz
, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. Algorithmica 84(1): 150-175 (2022) - [j112]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100: 101819 (2022) - [j111]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: 101852 (2022) - [j110]Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. Comput. Geom. 107: 101897 (2022) - [j109]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Shortest paths among transient obstacles. J. Comb. Optim. 43(5): 1036-1074 (2022) - [c127]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi Games Using Geodesics. CALDAM 2022: 195-207 - [c126]Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67 - [c125]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: 18:1-18:17 - 2021
- [j108]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): 2273-2302 (2021) - [j107]Farah Chanchary, Anil Maheshwari, Michiel Smid:
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305: 295-310 (2021) - [j106]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): 1401-1414 (2021) - [j105]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color-spanning localized query. Theor. Comput. Sci. 861: 85-101 (2021) - [j104]Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [c124]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset of Simple Graph Classes. CALDAM 2021: 471-484 - [c123]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CCCG 2021: 107-113 - [c122]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
An Acrophobic Guard Watchtower Problem on Terrains. CCCG 2021: 351-361 - [c121]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset Problem for Trees. FCT 2021: 204-216 - [c120]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - [c119]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: 15-28 - [c118]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - [i54]Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant Delay Lattice Train Schedules. CoRR abs/2107.04657 (2021) - [i53]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR abs/2109.02142 (2021) - [i52]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR abs/2109.07524 (2021) - [i51]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR abs/2111.05780 (2021) - 2020
- [j103]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing boundary-anchored rectangles and squares. Comput. Geom. 88: 101610 (2020) - [j102]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: 101631 (2020) - [j101]Sathish Govindarajan, Anil Maheshwari:
Preface: CALDAM 2016. Discret. Appl. Math. 280: 1 (2020) - [j100]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286: 51-61 (2020) - [j99]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12(1): 2050005:1-2050005:21 (2020) - [j98]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020) - [j97]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): 418-432 (2020) - [j96]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): 507-524 (2020) - [c117]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c116]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: 515-529 - [c115]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: 235-246 - [c114]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - [c113]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169 - [i50]Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid:
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR abs/2004.05883 (2020)
2010 – 2019
- 2019
- [j95]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): 1512-1534 (2019) - [j94]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip distance to some plane configurations. Comput. Geom. 81: 12-21 (2019) - [j93]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82: 32-44 (2019) - [j92]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): 119-138 (2019) - [j91]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy:
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29(1): 73-93 (2019) - [j90]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): 269-287 (2019) - [j89]Farah Chanchary, Anil Maheshwari:
Time Windowed Data Structures for Graphs. J. Graph Algorithms Appl. 23(2): 191-226 (2019) - [j88]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted minimum backward Fréchet distance. Theor. Comput. Sci. 783: 9-21 (2019) - [j87]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. Theor. Comput. Sci. 784: 133-141 (2019) - [j86]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c112]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Localized Query: Color Spanning Variations. CALDAM 2019: 150-160 - [c111]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: 155-167 - [c110]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: 211-224 - [i49]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 abs/1903.07024 (2019) - [i48]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. CoRR abs/1905.00791 (2019) - [i47]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color spanning Localized query. CoRR abs/1905.05066 (2019) - [i46]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles and Squares. CoRR abs/1906.11948 (2019) - [i45]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR abs/1909.03896 (2019) - [i44]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR abs/1909.06457 (2019) - 2018
- [j85]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j84]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j83]Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Path Refinement in Weighted Regions. Algorithmica 80(12): 3766-3802 (2018) - [j82]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. Comput. Geom. 68: 186-205 (2018) - [j81]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the integral Fréchet distance. Comput. Geom. 70-71: 13-30 (2018) - [j80]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [c109]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM 2018: 199-213 - [c108]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CCCG 2018: 288-295 - [c107]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CCCG 2018: 346-352 - [c106]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. COCOA 2018: 19-34 - [c105]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. COCOA 2018: 436-448 - [c104]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: 2:1-2:12 - [c103]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: 8:1-8:14 - [c102]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15 - [c101]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. SWAT 2018: 11:1-11:14 - [i43]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 abs/1802.09505 (2018) - [i42]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR abs/1803.06216 (2018) - [i41]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Time-Dependent Shortest Path Queries Among Growing Discs. CoRR abs/1808.01984 (2018) - [i40]Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. CoRR abs/1809.08898 (2018) - [i39]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. CoRR abs/1809.09979 (2018) - [i38]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR abs/1809.10737 (2018) - [i37]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 abs/1810.09232 (2018) - 2017
- [j79]Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017) - [j78]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) - [j77]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) - [j76]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j75]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [j74]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [c100]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - [c99]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - [c98]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. J. Comput. Geom. 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. J. Comput. Geom. 7(1): 520-539 (2016) - [c97]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 - [c96]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 - [c95]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c94]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 - [c93]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. SWAT 2016: 26:1-26:14 - [c92]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 - [c91]Farah Chanchary, Anil Maheshwari:
Counting Subgraphs in Relational Event Graphs. WALCOM 2016: 194-206 - [e1]Sathish 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] - [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) - [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) - [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) - 2015
- [j68]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
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) - [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) - [j65]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 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) - [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) - [j62]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015) - [c90]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12 - [c89]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - [c88]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - [c87]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [c86]