8 citations · 24 across the 27 of their papers we have counts for
4 papers · 1 filter
Improved approximation ratios for two Euclidean maximum spanning tree problems
Ahmad Biniaz
We study the following two maximization problems related to spanning trees in the Euclidean plane. It is not known whether or not these problems are NP-hard. We present approximati…
A short proof of the non-biplanarity of
Ahmad Biniaz
Battle, Harary, and Kodama (1962) and independently Tutte (1963) proved that the complete graph with nine vertices is not biplanar. Aiming towards simplicity and brevity, in this n…
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
Ahmad Biniaz
Given a connected vertex-weighted graph , the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of that maximizes the total weight of internal…
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …