9 citations · 50 across the 22 of their papers we have counts for
4 papers · 1 filter
Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
Martina Cerulli, Marianna De Santis, Elisabeth Gaar +1
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper,…
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
Eranda Cela, Elisabeth Gaar
In a representation of a graph as an edge intersection graph of paths on a grid (EPG) every vertex of is represented by a path on a grid and two paths share a grid edge iff…
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…
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…