default search action
Ahmad Biniaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Ahmad Biniaz:
Acute Tours in the Plane. Discret. Comput. Geom. 72(2): 665-673 (2024) - [j41]Ahmad Biniaz, Parham Khamsepour:
The Minimum Consistent Spanning Subset Problem on Trees. J. Graph Algorithms Appl. 28(1): 81-93 (2024) - [c48]Ahmad Biniaz:
Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof. ESA 2024: 27:1-27:4 - [i37]Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid:
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR abs/2405.18134 (2024) - [i36]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR abs/2405.20424 (2024) - [i35]Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. CoRR abs/2409.11614 (2024) - 2023
- [j40]Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114: 102011 (2023) - [j39]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) - [c47]Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. CCCG 2023: 43-49 - [c46]Ahmad Biniaz, Mohammad Hashemi:
City Guarding with Cameras of Bounded Field of View. CCCG 2023: 71-76 - [c45]Ahmad Biniaz:
Improved Bounds for Covering Paths and Trees in the Plane. SoCG 2023: 19:1-19:15 - [i34]Ahmad Biniaz:
Improved Bounds for Covering Paths and Trees in the Plane. CoRR abs/2303.04350 (2023) - [i33]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - 2022
- [j38]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. Algorithmica 84(1): 150-175 (2022) - [j37]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1(1): 3:1-3:18 (2022) - [j36]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the spanning and routing ratios of the directed Θ6-graph. Comput. Geom. 105-106: 101881 (2022) - [j35]Ahmad Biniaz:
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. 67(1): 311-327 (2022) - [j34]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j33]Ahmad Biniaz:
A short proof of the non-biplanarity of K9. J. Graph Algorithms Appl. 26(1): 75-80 (2022) - [j32]Ahmad Biniaz:
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. J. Graph Algorithms Appl. 26(2): 209-224 (2022) - [c44]Ahmad Biniaz, Prosenjit Bose, Patrick Devaney:
A 13/9-approximation of the average-2π/3-MST. CCCG 2022: 55-59 - [c43]Ahmad Biniaz:
Acute Tours in the Plane. SoCG 2022: 16:1-16:8 - [c42]Saman Bazargani, Ahmad Biniaz, Prosenjit Bose:
Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN 2022: 679-695 - [c41]Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour:
A 10-Approximation of the π/2-MST. STACS 2022: 13:1-13:15 - 2021
- [j31]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) - [j30]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum ply covering of points with disks and squares. Comput. Geom. 94: 101712 (2021) - [j29]Ahmad Biniaz:
A short proof of the toughness of Delaunay triangulations. J. Comput. Geom. 12(1): 35-39 (2021) - [c40]Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG 2021: 228-236 - [c39]Ahmad Biniaz:
A Short Proof of the Non-biplanarity of $$K_9$$. GD 2021: 101-106 - [c38]Ahmad Biniaz:
Approximating Longest Spanning Tree with Neighborhoods. ISAAC 2021: 7:1-7:11 - [c37]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS 2021: 1-14 - [c36]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 - [c35]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - [c34]Ahmad Biniaz:
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. WALCOM 2021: 260-271 - [i32]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR abs/2111.05780 (2021) - [i31]Ahmad Biniaz:
Acute Tours in the Plane. CoRR abs/2112.00064 (2021) - 2020
- [j28]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing boundary-anchored rectangles and squares. Comput. Geom. 88: 101610 (2020) - [j27]Ahmad Biniaz:
Plane hop spanners for unit disk graphs: Simpler and better. Comput. Geom. 89: 101622 (2020) - [j26]Ahmad Biniaz, Alfredo García:
Packing plane spanning trees into a point set. Comput. Geom. 90: 101653 (2020) - [j25]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) - [j24]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020) - [j23]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) - [c33]Ahmad Biniaz, Zhikai Lin:
Minimum Ply Covering of Points with Convex Shapes. CCCG 2020: 2-5 - [c32]Ahmad Biniaz:
A Short Proof of the Toughness of Delaunay Triangulations. SOSA 2020: 43-46 - [c31]Ahmad Biniaz:
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. SODA 2020: 826-836 - [c30]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - [i30]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020) - [i29]Ahmad Biniaz:
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. CoRR abs/2006.12561 (2020) - [i28]Ahmad Biniaz:
A short proof of the non-biplanarity of K9. CoRR abs/2008.05186 (2020) - [i27]Ahmad Biniaz:
Improved approximation ratios for two Euclidean maximum spanning tree problems. CoRR abs/2010.03870 (2020)
2010 – 2019
- 2019
- [j22]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) - [j21]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip distance to some plane configurations. Comput. Geom. 81: 12-21 (2019) - [j20]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. 35(2): 437-450 (2019) - [j19]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33(2): 845-861 (2019) - [c29]Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne:
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG 2019: 23-28 - [c28]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CCCG 2019: 226-235 - [c27]Ahmad Biniaz:
Plane Hop Spanners for Unit Disk Graphs. WADS 2019: 140-154 - [c26]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 - [c25]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG 2019: 258-270 - [i26]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. CoRR abs/1901.01476 (2019) - [i25]Ahmad Biniaz:
Plane Hop Spanners for Unit Disk Graphs: Simpler and Better. CoRR abs/1902.10051 (2019) - [i24]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. CoRR abs/1903.06981 (2019) - [i23]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CoRR abs/1905.00790 (2019) - [i22]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. CoRR abs/1905.00791 (2019) - [i21]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles and Squares. CoRR abs/1906.11948 (2019) - [i20]Ahmad Biniaz:
A Short Proof of the Toughness of Delaunay Triangulations. CoRR abs/1907.01617 (2019) - [i19]Ahmad Biniaz:
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. CoRR abs/1911.08529 (2019) - 2018
- [j18]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) - [j17]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. Comput. Geom. 68: 186-205 (2018) - [j16]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [c24]Ahmad Biniaz, Alfredo García:
Packing Plane Spanning Trees into a Point Set. CCCG 2018: 49-53 - [c23]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [c22]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte:
Integral Unit Bar-Visibility Graphs. CCCG 2018: 230-246 - [c21]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CCCG 2018: 346-352 - [c20]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 - [c19]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. ICALP 2018: 18:1-18:15 - [c18]Therese Biedl, Ahmad Biniaz, Martin Derka:
On the Size of Outer-String Representations. SWAT 2018: 10:1-10:14 - [c17]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. SWAT 2018: 11:1-11:14 - [c16]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. SWAT 2018: 14:1-14:12 - [i18]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. CoRR abs/1801.08565 (2018) - [i17]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) - [i16]Ahmad Biniaz, Alfredo García:
Packing Plane Spanning Trees into a Point Set. CoRR abs/1803.02385 (2018) - [i15]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. CoRR abs/1804.07150 (2018) - [i14]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR abs/1809.10737 (2018) - [i13]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
- [j15]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) - [j14]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) - [j13]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) - [j12]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) - [c15]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - [c14]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 - [i12]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CoRR abs/1706.08105 (2017) - 2016
- [j11]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) - [j10]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) - [c13]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 - [c12]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 - [c11]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c10]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 - [i11]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) - [i10]Ahmad Biniaz:
Matchings in Geometric Graphs. CoRR abs/1610.06457 (2016) - [i9]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
- [j9]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015) - [j8]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015) - [j7]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) - [j6]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) - [j5]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015) - [j4]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015) - [c9]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12 - [c8]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - [c7]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [c6]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 - [c5]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 - [i8]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015) - [i7]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong Matching of Points with Geometric Shapes. CoRR abs/1503.04871 (2015) - [i6]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015) - 2014
- [j3]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) - [j2]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) - [c4]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating Full Steiner Tree in a Unit Disk Graph. CCCG 2014 - [c3]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck Bichromatic Plane Matching of Points. CCCG 2014 - [i5]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CoRR abs/1409.5466 (2014) - [i4]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matching in Gabriel Graphs. CoRR abs/1410.0540 (2014) - 2013
- [c2]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. WALCOM 2013: 17-28 - [i3]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem. CoRR abs/1305.0172 (2013) - [i2]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Approximating the Bottleneck Plane Perfect Matching of a Point Set. CoRR abs/1311.5197 (2013) - 2012
- [j1]Ahmad Biniaz, Gholamhossein Dastghaibyfard:
A faster circle-sweep Delaunay triangulation algorithm. Adv. Eng. Softw. 43(1): 1-13 (2012) - [i1]Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Fixed-Orientation Equilateral Triangle Matching of Point Sets. CoRR abs/1211.2734 (2012)
2000 – 2009
- 2009
- [c1]Ahmad Biniaz:
Slope Preserving Terrain Simplification - An Experimental Study. CCCG 2009: 59-62
Coauthor Index
aka: Michiel Smid
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint