Elisabeth Gaar

MaRDI QIDQ2029004zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A note on the maximal covering location problem with customer preference ordering Computers & Operations Research	2026-09-15	Paper
The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs Discrete Applied Mathematics	2025-12-11	Paper
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs Mathematical Programming. Series A. Series B	2024-08-20	Paper
On different versions of the exact subgraph hierarchy for the stable set problem Discrete Applied Mathematics	2024-08-09	Paper
Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem Networks	2024-01-18	Paper
Strong SDP based bounds on the cutwidth of a graph Computers & Operations Research	2023-11-15	Paper
Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases Journal of Symbolic Computation	2023-08-10	Paper
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid Journal of Graph Algorithms and Applications	2023-03-30	Paper
On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid Discrete Applied Mathematics	2023-03-29	Paper
A characterization of graphs with regular distance-2 graphs Discrete Applied Mathematics	2022-11-11	Paper
A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem European Journal of Operational Research	2022-06-10	Paper
An SDP-based approach for computing the stability number of a graph Mathematical Methods of Operations Research	2022-04-08	Paper
Improving ADMMs for solving doubly nonnegative programs through dual factorization 4OR	2021-11-04	Paper
A scaleable projection-based branch-and-cut algorithm for the p-center problem (available as arXiv preprint)	2021-08-16	Paper
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares Journal of Symbolic Computation	2021-06-03	Paper
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation	2020-09-10	Paper
A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring Mathematical Programming. Series A. Series B	2020-08-28	Paper
On k-Bend and Monotonic \ell-Bend Edge Intersection Graphs of Paths on a Grid (available as arXiv preprint)	2020-02-14	Paper
A bundle approach for SDPs with exact subgraph constraints (available as arXiv preprint)	2020-02-06	Paper

Research outcomes over time

This page was built for person: Elisabeth Gaar