The following pages link to Elisabeth Gaar (Q2029004):
Displayed 15 items.
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- A bundle approach for SDPs with exact subgraph constraints (Q2293089) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
- On $k$-Bend and Monotonic $\ell$-Bend Edge Intersection Graphs of Paths on a Grid (Q6334802) (← links)
- A scaleable projection-based branch-and-cut algorithm for the $p$-center problem (Q6375349) (← links)