Elisabeth Gaar

According to our database, Elisabeth Gaar authored at least 20 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Strong SDP based bounds on the cutwidth of a graph.

Elisabeth Gaar, Diane Puges, Angelika Wiegele

Comput. Oper. Res., January, 2024

Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases.

Elisabeth Gaar, Melanie Siebenhofer

J. Symb. Comput., 2024

2023

Exact solution approaches for the discrete <i>α</i>-neighbor <i>p</i>-center problem.

Elisabeth Gaar, Markus Sinnl

Networks, December, 2023

On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid.

Eranda Çela, Elisabeth Gaar

Discret. Appl. Math., May, 2023

A characterization of graphs with regular distance-2 graphs.

Elisabeth Gaar, Daniel Krenn

Discret. Appl. Math., 2023

2022

An SDP-based approach for computing the stability number of a graph.

Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele

Math. Methods Oper. Res., 2022

Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid.

Eranda Çela, Elisabeth Gaar

J. Graph Algorithms Appl., 2022

A scaleable projection-based branch-and-cut algorithm for the <i>p</i>-center problem.

Elisabeth Gaar, Markus Sinnl

Eur. J. Oper. Res., 2022

Exact solution approaches for the discrete α-neighbor p-center problem.

Elisabeth Gaar, Markus Sinnl

CoRR, 2022

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis

CoRR, 2022

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.

Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.

Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele

J. Symb. Comput., 2021

A scaleable projection-based branch-and-cut algorithm for the p-center problem.

Elisabeth Gaar, Markus Sinnl

CoRR, 2021

Experiments with graph convolutional networks for solving the vertex p-center problem.

Elisabeth Gaar, Markus Sinnl

CoRR, 2021

Improving ADMMs for solving doubly nonnegative programs through dual factorization.

Martina Cerulli, Marianna De Santis, Elisabeth Gaar, Angelika Wiegele

4OR, 2021

2020

A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.

Elisabeth Gaar, Franz Rendl

Math. Program., 2020

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem.

Elisabeth Gaar

CoRR, 2020

Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid.

Eranda Çela, Elisabeth Gaar

CoRR, 2020

2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture.

Elisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

A Bundle Approach for SDPs with Exact Subgraph Constraints.

Elisabeth Gaar, Franz Rendl

Proceedings of the Integer Programming and Combinatorial Optimization, 2019