7 citations · 9 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 7 cited
More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj +8
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical…
cs.DS2012★ 2 cited
Optimal Orthogonal Graph Drawing with Convex Bend Costs
Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
Traditionally, the quality of orthogonal planar drawings is quantified by either the total number of bends, or the maximum number of bends per edge. However, this neglects that in…