Elisabeth Gaar

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 26

Top Topics

Subgraph Mining

Semi Definite Programming

Top Venues

Discret. Appl. Math.

Publications

Elisabeth Gaar
On different versions of the exact subgraph hierarchy for the stable set problem. Discret. Appl. Math. 356 (2024)
Elisabeth Gaar, Melanie Siebenhofer
Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases. J. Symb. Comput. 120 (2024)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206 (1) (2024)
Elisabeth Gaar, Diane Puges, Angelika Wiegele
Strong SDP based bounds on the cutwidth of a graph. Comput. Oper. Res. 161 (2024)
Elisabeth Gaar, Markus Sinnl
-center problem. Networks 82 (4) (2023)
Elisabeth Gaar, Daniel Krenn
A characterization of graphs with regular distance-2 graphs. Discret. Appl. Math. 324 (2023)
Eranda Çela, Elisabeth Gaar
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid. Discret. Appl. Math. 331 (2023)
Elisabeth Gaar, Diane Puges, Angelika Wiegele
Strong SDP based bounds on the cutwidth of a graph. CoRR (2023)
Eranda Çela, Elisabeth Gaar
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 26 (1) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO (2022)
Elisabeth Gaar, Markus Sinnl
-center problem. Eur. J. Oper. Res. 303 (1) (2022)
Elisabeth Gaar, Markus Sinnl
Exact solution approaches for the discrete α-neighbor p-center problem. CoRR (2022)
Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele
An SDP-based approach for computing the stability number of a graph. Math. Methods Oper. Res. 95 (1) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR (2021)
Elisabeth Gaar, Markus Sinnl
A scaleable projection-based branch-and-cut algorithm for the p-center problem. CoRR (2021)
Martina Cerulli, Marianna De Santis, Elisabeth Gaar, Angelika Wiegele
Improving ADMMs for solving doubly nonnegative programs through dual factorization. 4OR 19 (3) (2021)
Elisabeth Gaar, Markus Sinnl
Experiments with graph convolutional networks for solving the vertex p-center problem. CoRR (2021)
Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. J. Symb. Comput. 107 (2021)
Elisabeth Gaar
On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem. CoRR (2020)
Elisabeth Gaar, Franz Rendl
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. 183 (1) (2020)
Eranda Çela, Elisabeth Gaar
Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid. CoRR (2020)
Elisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. ISSAC (2019)
Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. CoRR (2019)
Elisabeth Gaar, Franz Rendl
A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO (2019)
Eranda Çela, Elisabeth Gaar
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. CoRR (2019)