34 citations · 62 across the 8 of their papers we have counts for
Showing 2019 · math.OCShow all
2 papers · 2 filters
math.OC2019★ 5 cited
Lower Bounds for the Bandwidth Problem
Franz Rendl, Renata Sotirov, Christian Truden
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the…
math.OC2019★ 5 cited
A Bundle Approach for SDPs with Exact Subgraph Constraints
Elisabeth Gaar, Franz Rendl
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…