default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElisabeth Gassner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j15]Elisabeth Gassner:
An inverse approach to convex ordered median problems in trees. J. Comb. Optim. 23(2): 261-273 (2012)- 2011
- [j14]Fahimeh Baroughi Bonab
, Rainer E. Burkard, Elisabeth Gassner:
Inverse p-median problems with variable edge lengths. Math. Methods Oper. Res. 73(2): 263-280 (2011) - 2010
- [j13]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba:
clever or smart: Strategies for the online target date assignment problem. Discret. Appl. Math. 158(1): 71-79 (2010) - [j12]Rainer E. Burkard, Mohammadreza Galavii, Elisabeth Gassner:
The inverse Fermat-Weber problem. Eur. J. Oper. Res. 206(1): 11-17 (2010) - [j11]Elisabeth Gassner:
The Steiner Forest Problem revisited. J. Discrete Algorithms 8(2): 154-163 (2010) - [j10]Elisabeth Gassner, Bettina Klinz:
A fast parametric assignment algorithm with applications in max-algebra. Networks 55(2): 61-77 (2010) - [j9]Elisabeth Gassner:
The partial inverse minimum cut problem with L 1-norm is strongly NP-hard. RAIRO Oper. Res. 44(3): 241-249 (2010)
2000 – 2009
- 2009
- [j8]Elisabeth Gassner, Bettina Klinz:
The computational complexity of bilevel assignment problems. 4OR 7(4): 379-394 (2009) - [j7]Elisabeth Gassner:
A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. Ann. Oper. Res. 172(1): 393-404 (2009) - [j6]Elisabeth Gassner:
Up- and downgrading the 1-center in a network. Eur. J. Oper. Res. 198(2): 370-377 (2009) - [j5]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger:
How hard is it to find extreme Nash equilibria in network congestion games? Theor. Comput. Sci. 410(47-49): 4989-4999 (2009) - 2008
- [j4]Elisabeth Gassner, Johannes Hatzl:
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. Computing 82(2-3): 171-187 (2008) - [j3]Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
Reverse 2-median problem on trees. Discret. Appl. Math. 156(11): 1963-1976 (2008) - [j2]Elisabeth Gassner:
The inverse 1-maxian problem with edge length modification. J. Comb. Optim. 16(1): 50-67 (2008) - [c4]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger:
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? WINE 2008: 82-93 - 2007
- [c3]Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Geometric Graph Embeddings. GD 2007: 280-290 - 2006
- [j1]Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48(1): 16-23 (2006) - [c2]Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges. WG 2006: 325-335 - 2005
- [c1]Elisabeth Gassner, Sven Oliver Krumke:
Deterministic Online Optical Call Admission Revisited. WAOA 2005: 190-202
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
