Ahmad Biniaz - RankMe

151 papers A* 7A 5B 15C 2Journal 96Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	City guarding with cameras of bounded field of view. Comput. Geom. Ahmad Biniaz, Mohammad Hashemi
2026	J	`jnl`	Piercing unit geodesic disks. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
2025	A	`conf`	An Improved Bound for Plane Covering Paths. ESA Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025	J	`jnl`	An Improved Bound for Plane Covering Paths. CoRR Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025	J	`jnl`	Approximating average bounded-angle minimum spanning trees. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Patrick Devaney
2025	J	`jnl`	Art galleries and mobile guards: revisiting O'Rourke's proof. J. Comput. Geom. Ahmad Biniaz
2025	J	`jnl`	Euclidean Maximum Matchings in the Plane - Local to Global. Algorithmica Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2025	—	`conf`	Guarding Polygons With Mutually Visible π-Guards. CCCG Arash Ahadi, Ahmad Biniaz, Mohammad Hashemi, Ali Nakhaeisharif
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`	Minimum Plane Bichromatic Spanning Trees. ACM Trans. Algorithms Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
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 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	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
2024	J	`jnl`	Acute Tours in the Plane. Discret. Comput. Geom. Ahmad Biniaz
2024	A	`conf`	Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof. ESA Ahmad Biniaz
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`	Euclidean Maximum Matchings in the Plane - Local to Global. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2024	J	`jnl`	Improved bounds for covering paths and trees in the plane. J. Comput. Geom. Ahmad Biniaz
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	B	`conf`	Minimum Plane Bichromatic Spanning Trees. ISAAC Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2024	J	`jnl`	Minimum Plane Bichromatic Spanning Trees. CoRR Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
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`	The Minimum Consistent Spanning Subset Problem on Trees. J. Graph Algorithms Appl. Ahmad Biniaz, Parham Khamsepour
2023	J	`jnl`	A 10-Approximation of the π/2 -MST. J. Comput. Geom. Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour
2023	J	`jnl`	Approximating longest spanning tree with neighborhoods. J. Comput. Geom. Ahmad Biniaz
2023	—	`conf`	City Guarding with Cameras of Bounded Field of View. CCCG Ahmad Biniaz, Mohammad Hashemi
2023	A*	`conf`	Improved Bounds for Covering Paths and Trees in the Plane. SoCG Ahmad Biniaz
2023	J	`jnl`	Improved Bounds for Covering Paths and Trees in the Plane. CoRR Ahmad Biniaz
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	—	`conf`	Piercing Unit Geodesic Disks. CCCG Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
2023	J	`jnl`	Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
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	A	`conf`	A 10-Approximation of the π/2-MST. STACS Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour
2022	—	`conf`	A 13/9-approximation of the average-2π/3-MST. CCCG Ahmad Biniaz, Prosenjit Bose, Patrick Devaney
2022	J	`jnl`	A short proof of the non-biplanarity of K J. Graph Algorithms Appl. Ahmad Biniaz
2022	A*	`conf`	Acute Tours in the Plane. SoCG Ahmad Biniaz
2022	J	`jnl`	Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2022	J	`jnl`	Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. J. Graph Algorithms Appl. Ahmad Biniaz
2022	J	`jnl`	Bounded-Angle Minimum Spanning Trees. Algorithmica Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
2022	J	`jnl`	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. Ahmad Biniaz
2022	J	`jnl`	On the spanning and routing ratios of the directed Θ Comput. Geom. Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
2022	B	`conf`	Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN Saman Bazargani, Ahmad Biniaz, Prosenjit Bose
2022	J	`jnl`	Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
2021	A	`conf`	A Short Proof of the Non-biplanarity of $$K_9$$. GD Ahmad Biniaz
2021	J	`jnl`	A short proof of the toughness of Delaunay triangulations. J. Comput. Geom. Ahmad Biniaz
2021	J	`jnl`	Acute Tours in the Plane. CoRR Ahmad Biniaz
2021	B	`conf`	Approximating Longest Spanning Tree with Neighborhoods. ISAAC Ahmad Biniaz
2021	J	`jnl`	Approximating bottleneck spanning trees on partitioned tuples of points. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021	B	`conf`	Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. WALCOM Ahmad Biniaz
2021	B	`conf`	Euclidean Maximum Matchings in the Plane - Local to Global. WADS Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021	J	`jnl`	Minimum ply covering of points with disks and squares. Comput. Geom. Therese Biedl, Ahmad Biniaz, Anna Lubiw
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`	On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
2021	—	`conf`	Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
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
2020	—	`conf`	A Short Proof of the Toughness of Delaunay Triangulations. SOSA Ahmad Biniaz
2020	J	`jnl`	A short proof of the non-biplanarity of K CoRR Ahmad Biniaz
2020	J	`jnl`	Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. CoRR Ahmad Biniaz
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	J	`jnl`	Compatible Paths on Labelled Point Sets. CoRR Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
2020	A*	`conf`	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. SODA Ahmad Biniaz
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	J	`jnl`	Improved approximation ratios for two Euclidean maximum spanning tree problems. CoRR Ahmad Biniaz
2020	—	`conf`	Minimum Ply Covering of Points with Convex Shapes. CCCG Ahmad Biniaz, Zhikai Lin
2020	J	`jnl`	Packing boundary-anchored rectangles and squares. Comput. Geom. Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2020	J	`jnl`	Packing plane spanning trees into a point set. Comput. Geom. Ahmad Biniaz, Alfredo García
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`	Plane hop spanners for unit disk graphs: Simpler and better. Comput. Geom. Ahmad Biniaz
2019	J	`jnl`	A Short Proof of the Toughness of Delaunay Triangulations. CoRR Ahmad Biniaz
2019	J	`jnl`	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios. CoRR Ahmad Biniaz
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`	Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
2019	B	`conf`	Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
2019	J	`jnl`	Maximum Matchings and Minimum Blocking Sets in Θ CoRR Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
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	—	`conf`	Minimum Ply Covering of Points with Disks and Squares. CCCG Therese Biedl, Ahmad Biniaz, Anna Lubiw
2019	J	`jnl`	Minimum Ply Covering of Points with Disks and Squares. CoRR Therese Biedl, Ahmad Biniaz, Anna Lubiw
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	B	`conf`	Plane Hop Spanners for Unit Disk Graphs. WADS Ahmad Biniaz
2019	J	`jnl`	Plane Hop Spanners for Unit Disk Graphs: Simpler and Better. CoRR Ahmad Biniaz
2019	J	`jnl`	Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2019	—	`conf`	Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
2019	J	`jnl`	Token Swapping on Trees. CoRR Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
2018	—	`conf`	Compatible 4-Holes in Point Sets. CCCG Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2018	—	`conf`	Compatible Paths on Labelled Point Sets. CCCG Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
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	—	`conf`	Improved Bounds for Guarding Plane Graphs with Edges. SWAT Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
2018	J	`jnl`	Improved Bounds for Guarding Plane Graphs with Edges. CoRR Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
2018	—	`conf`	Integral Unit Bar-Visibility Graphs. CCCG Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte
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	—	`conf`	On the Size of Outer-String Representations. SWAT Therese Biedl, Ahmad Biniaz, Martin Derka
2018	—	`conf`	Packing Plane Spanning Trees into a Point Set. CCCG Ahmad Biniaz, Alfredo García
2018	J	`jnl`	Packing Plane Spanning Trees into a Point Set. CoRR Ahmad Biniaz, Alfredo García
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	A*	`conf`	Rollercoasters and Caterpillars. ICALP Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Rollercoasters and Caterpillars. CoRR Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
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
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	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	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	J	`jnl`	Matchings in Geometric Graphs. CoRR Ahmad Biniaz
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	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 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	—	`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	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 hardness of full Steiner tree problems. J. Discrete Algorithms Ahmad Biniaz, 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	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	J	`jnl`	Strong Matching of Points with Geometric Shapes. CoRR Ahmad Biniaz, Anil Maheshwari, 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`	Matching in Gabriel Graphs. CoRR Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
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`	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
2012	J	`jnl`	A faster circle-sweep Delaunay triangulation algorithm. Adv. Eng. Softw. Ahmad Biniaz, Gholamhossein Dastghaibyfard
2012	J	`jnl`	Fixed-Orientation Equilateral Triangle Matching of Point Sets CoRR Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2009	—	`conf`	Slope Preserving Terrain Simplification - An Experimental Study. CCCG Ahmad Biniaz