A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem E Gaar, M Sinnl European Journal of Operational Research 303 (1), 78-98, 2022 | 18 | 2022 |
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring E Gaar, F Rendl Mathematical Programming 183 (1), 283-308, 2020 | 8 | 2020 |
Efficient implementation of SDP relaxations for the stable set problem E Gaar Ph. D. thesis, Alpen-Adria-Universität Klagenfurt, 2018 | 7 | 2018 |
Monotonic representations of outerplanar graphs as edge intersection graphs of paths on a grid E Çela, E Gaar Journal of Graph Algorithms and Applications 26 (4), 519-552, 2022 | 6 | 2022 |
A bundle approach for SDPs with exact subgraph constraints E Gaar, F Rendl Integer Programming and Combinatorial Optimization: 20th International …, 2019 | 6 | 2019 |
An SDP-based approach for computing the stability number of a graph E Gaar, M Siebenhofer, A Wiegele Mathematical Methods of Operations Research 95 (1), 141-161, 2022 | 5 | 2022 |
Strong SDP based bounds on the cutwidth of a graph E Gaar, D Puges, A Wiegele Computers & Operations Research 161, 106449, 2024 | 3 | 2024 |
An optimization-based sum-of-squares approach to Vizing's conjecture E Gaar, A Wiegele, D Krenn, S Margulies Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019 | 3 | 2019 |
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs E Gaar, J Lee, I Ljubić, M Sinnl, K Tanınmış International Conference on Integer Programming and Combinatorial …, 2022 | 2 | 2022 |
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares E Gaar, D Krenn, S Margulies, A Wiegele Journal of Symbolic Computation 107, 67-105, 2021 | 2 | 2021 |
Improving ADMMs for solving doubly nonnegative programs through dual factorization M Cerulli, M De Santis, E Gaar, A Wiegele 4OR 19, 415-448, 2021 | 2 | 2021 |
On different versions of the exact subgraph hierarchy for the stable set problem E Gaar arXiv preprint arXiv:2003.13605, 2020 | 2 | 2020 |
A characterization of graphs with regular distance-2 graphs E Gaar, D Krenn Discrete Applied Mathematics 324, 181-218, 2023 | 1 | 2023 |
Experiments with graph convolutional networks for solving the vertex -center problem E Gaar, M Sinnl arXiv preprint arXiv:2106.00357, 2021 | 1 | 2021 |
Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases E Gaar, M Siebenhofer Journal of Symbolic Computation 120, 102236, 2024 | | 2024 |
Exact solution approaches for the discrete α‐neighbor p‐center problem E Gaar, M Sinnl Networks 82 (4), 371-399, 2023 | | 2023 |
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid E Çela, E Gaar Discrete Applied Mathematics 331, 88-103, 2023 | | 2023 |
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs E Gaar, J Lee, I Ljubić, M Sinnl, K Tanınmış Mathematical Programming, 1-34, 2023 | | 2023 |
Busflotteneinsatzplanung für den Umstieg auf batterieelektrische und H2-Brennstoffzellen-Busse im Raum Salzburg X Haslinger, E Gaar, S Parragh, P Krisch, F Schöpflin, T Prinz | | 2023 |
High-performance computing in combinatorial optimization: presentation at the PRACE scientific & industrial conference 2018, 29-31 May 2018, Ljubljana, Slovenia E Gaar, T Hrga, B Lužar, J Povh, A Vegi Kalamar, A Wiegele | | 2018 |