default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard J. Woeginger
- > Home > Persons > Gerhard J. Woeginger
Publications
- 2025
[j303]Eranda Çela
, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. Math. Program. 210(1): 165-188 (2025)- 2023
- [j300]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-Preemptive Tree Packing. Algorithmica 85(3): 783-804 (2023) - [c131]Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO 2023: 466-479 - [i40]Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR abs/2303.00569 (2023) - 2022
- [j295]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous facility location on graphs. Math. Program. 192(1): 207-227 (2022) - 2021
- [j293]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83(6): 1734-1749 (2021) - [j291]Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger:
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303: 94-107 (2021) - [c130]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-preemptive Tree Packing. IWOCA 2021: 456-468 - [c129]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. IPEC 2021: 19:1-19:14 - [c128]Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf:
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - 2020
- [c127]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. IPCO 2020: 171-181 - [i38]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. CoRR abs/2010.11456 (2020) - 2019
- [c126]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - 2018
- [i34]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing obnoxious facilities on a graph. CoRR abs/1811.08918 (2018)
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.
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.
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.
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 2025-08-06 23:11 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:
