20 citations · 66 across the 52 of their papers we have counts for
4 papers · 2 filters
Computing Oriented Spanners and their Dilation
Kevin Buchin, Antonia Kalb, Anil Maheshwari +4
Given a point set in a metric space and a real number , an \emph{oriented -spanner} is an oriented graph , where for eve…
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
Euclidean Maximum Matchings in the Plane---Local to Global
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Let be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that is globally maximum if it is a maximum-length m…
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +1
Let be an edge-weighted graph, and let be a subgraph of . We say that is an -fault-tolerant -spanner for , if the following is true for any subset of at…