Остановите войну!
for scientists:
default search action
Elisabeth Gaar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Elisabeth Gaar, Diane Puges, Angelika Wiegele:
Strong SDP based bounds on the cutwidth of a graph. Comput. Oper. Res. 161: 106449 (2024) - [j10]Elisabeth Gaar, Melanie Siebenhofer:
Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases. J. Symb. Comput. 120: 102236 (2024) - 2023
- [j9]Elisabeth Gaar, Daniel Krenn:
A characterization of graphs with regular distance-2 graphs. Discret. Appl. Math. 324: 181-218 (2023) - [j8]Eranda Çela, Elisabeth Gaar:
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid. Discret. Appl. Math. 331: 88-103 (2023) - [j7]Elisabeth Gaar, Markus Sinnl:
Exact solution approaches for the discrete α-neighbor p-center problem. Networks 82(4): 371-399 (2023) - [i10]Elisabeth Gaar, Diane Puges, Angelika Wiegele:
Strong SDP based bounds on the cutwidth of a graph. CoRR abs/2301.03900 (2023) - 2022
- [j6]Elisabeth Gaar, Markus Sinnl:
A scaleable projection-based branch-and-cut algorithm for the p-center problem. Eur. J. Oper. Res. 303(1): 78-98 (2022) - [j5]Eranda Çela, Elisabeth Gaar:
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 26(1): 519-552 (2022) - [j4]Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele:
An SDP-based approach for computing the stability number of a graph. Math. Methods Oper. Res. 95(1): 141-161 (2022) - [c3]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: 262-276 - [i9]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 abs/2207.05014 (2022) - [i8]Elisabeth Gaar, Markus Sinnl:
Exact solution approaches for the discrete α-neighbor p-center problem. CoRR abs/2211.12908 (2022) - 2021
- [j3]Martina Cerulli, Marianna De Santis, Elisabeth Gaar, Angelika Wiegele:
Improving ADMMs for solving doubly nonnegative programs through dual factorization. 4OR 19(3): 415-448 (2021) - [j2]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: 67-105 (2021) - [i7]Elisabeth Gaar, Markus Sinnl:
Experiments with graph convolutional networks for solving the vertex p-center problem. CoRR abs/2106.00357 (2021) - [i6]Elisabeth Gaar, Markus Sinnl:
A scaleable projection-based branch-and-cut algorithm for the p-center problem. CoRR abs/2108.07045 (2021) - [i5]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR abs/2111.06824 (2021) - 2020
- [j1]Elisabeth Gaar, Franz Rendl:
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. 183(1): 283-308 (2020) - [i4]Eranda Çela, Elisabeth Gaar:
Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid. CoRR abs/2002.05998 (2020) - [i3]Elisabeth Gaar:
On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem. CoRR abs/2003.13605 (2020)
2010 – 2019
- 2019
- [c2]Elisabeth Gaar, Franz Rendl:
A Bundle Approach for SDPs with Exact Subgraph Constraints. IPCO 2019: 205-218 - [c1]Elisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. ISSAC 2019: 155-162 - [i2]Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. CoRR abs/1901.10288 (2019) - [i1]Eranda Çela, Elisabeth Gaar:
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. CoRR abs/1908.01981 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint