Ahmad Biniaz

From MaRDI portal
Person:390151

Available identifiers

zbMath Open biniaz.ahmadMaRDI QIDQ390151

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61475082024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60591732023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60575432023-10-05Paper
Simple linear time algorithms for piercing pairwise intersecting disks2023-07-31Paper
Piercing pairwise intersecting convex shapes in the plane2023-07-26Paper
https://portal.mardi4nfdi.de/entity/Q61593452023-06-01Paper
Token Swapping on Trees2023-05-31Paper
The Minimum Moving Spanning Tree Problem2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q58815452023-03-10Paper
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs2022-11-14Paper
A short proof of the non-biplanarity of \(K_9\)2022-07-01Paper
A short proof of the non-biplanarity of $K_9$2022-06-28Paper
On the spanning and routing ratios of the directed \(\Theta_6\)-graph2022-06-13Paper
On the spanning and routing ratios of the directed \(\varTheta_6\)-graph2022-03-25Paper
The minimum moving spanning tree problem2022-03-25Paper
Euclidean maximum matchings in the plane -- local to global2022-03-25Paper
Bounded-angle minimum spanning trees2022-02-01Paper
Euclidean bottleneck bounded-degree spanning tree ratios2022-01-14Paper
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs2021-10-04Paper
https://portal.mardi4nfdi.de/entity/Q50026842021-07-28Paper
On the minimum consistent subset problem2021-06-30Paper
A short proof of the toughness of Delaunay triangulations2021-03-17Paper
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios2021-02-02Paper
Minimum ply covering of points with disks and squares2021-01-07Paper
Faster algorithms for some optimization problems on collinear points2020-11-12Paper
Plane hop spanners for unit disk graphs: simpler and better2020-10-23Paper
Packing plane spanning trees into a point set2020-10-23Paper
https://portal.mardi4nfdi.de/entity/Q51164742020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51164752020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51164782020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51157752020-08-18Paper
Packing boundary-anchored rectangles and squares2020-03-23Paper
Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs2020-02-24Paper
Plane and planarity thresholds for random geometric graphs2020-02-18Paper
Plane hop spanners for unit disk graphs2020-01-16Paper
On the minimum consistent subset problem2020-01-16Paper
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs2019-11-21Paper
Flip distance to some plane configurations2019-10-25Paper
Rollercoasters: Long Sequences without Short Runs2019-08-29Paper
Improved bounds for guarding plane graphs with edges2019-05-03Paper
Maximum plane trees in multipartite geometric graphs2019-04-25Paper
Spanning trees in multipartite geometric graphs2019-01-11Paper
An optimal algorithm for plane matchings in multipartite geometric graphs2018-11-01Paper
Plane bichromatic trees of low degree2018-07-13Paper
https://portal.mardi4nfdi.de/entity/Q46365012018-04-19Paper
Strong matching of points with geometric shapes2018-02-19Paper
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon2018-01-19Paper
https://portal.mardi4nfdi.de/entity/Q53695272017-10-17Paper
Maximum plane trees in multipartite geometric graphs2017-09-22Paper
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem2017-05-16Paper
A plane 1.88-spanner for points in convex position2017-03-30Paper
Towards plane spanners of degree 32017-03-30Paper
Plane bichromatic trees of low degree2016-09-29Paper
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon2016-04-01Paper
Higher-order triangular-distance Delaunay graphs: graph-theoretical properties2016-01-15Paper
Approximating the bottleneck plane perfect matching of a point set2016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q34550352015-12-03Paper
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs2015-10-30Paper
On the hardness of full Steiner tree problems2015-08-24Paper
Matchings in higher-order Gabriel graphs2015-07-24Paper
On full Steiner trees in unit disk graphs2015-06-17Paper
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties2015-02-19Paper
Fixed-orientation equilateral triangle matching of point sets2014-10-06Paper
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem2014-01-22Paper
Fixed-Orientation Equilateral Triangle Matching of Point Sets2013-04-12Paper
A faster circle-sweep Delaunay triangulation algorithm2012-06-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ahmad Biniaz