activity
20122025
most citedFixed-Orientation Equilateral Triangle Matching of Point Sets

2 citations · 3 across the 9 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2020

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…