14 citations · 64 across the 19 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 14 cited
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Guilherme D. da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá +1
A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc ne…
cs.DM2012★ 3 cited
The Cost of Perfection for Matchings in Graphs
Emilio Vital Brazil, Guilherme D. da Fonseca, Celina de Figueiredo +1
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum…