default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Lendl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Marc Goerigk
, Stefan Lendl, Lasse Wulf:
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343: 355-370 (2024)- [i14]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR abs/2402.00921 (2024) - 2023
- [j12]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-Preemptive Tree Packing. Algorithmica 85(3): 783-804 (2023) - [j11]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023) - [j10]Hung P. Hoang, Stefan Lendl, Lasse Wulf:
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340: 153-170 (2023) - [c8]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 - [i13]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) - [i12]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR abs/2312.01804 (2023) - 2022
- [j9]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302(1): 62-78 (2022) - [j8]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303(2): 567-580 (2022) - [j7]Ante Custic, Stefan Lendl:
The Steiner cycle and path cover problem on interval graphs. J. Comb. Optim. 43(1): 226-234 (2022) - [j6]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous facility location on graphs. Math. Program. 192(1): 207-227 (2022) - [j5]Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid bases with cardinality constraints on the intersection. Math. Program. 194(1): 661-684 (2022) - [c7]Tim A. Hartmann, Stefan Lendl:
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. MFCS 2022: 55:1-55:14 - [i11]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of Indivisible Items with Individual Preference Graphs. CoRR abs/2202.04465 (2022) - [i10]Tim A. Hartmann, Stefan Lendl:
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. CoRR abs/2206.11337 (2022) - [i9]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR abs/2209.01011 (2022) - 2021
- [j4]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83(6): 1734-1749 (2021) - [j3]Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger:
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303: 94-107 (2021) - [j2]Marc Goerigk, Stefan Lendl:
Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. 2: 1-18 (2021) - [c6]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy:
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - [c5]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-preemptive Tree Packing. IWOCA 2021: 456-468 - [c4]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. IPEC 2021: 19:1-19:14 - [c3]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 - [i8]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR abs/2104.03043 (2021) - [i7]Hung P. Hoang, Stefan Lendl, Lasse Wulf:
Assistance and Interdiction Problems on Interval Graphs. CoRR abs/2107.14550 (2021) - [i6]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the Recoverable Traveling Salesman Problem. CoRR abs/2111.09691 (2021) - 2020
- [c2]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. IPCO 2020: 171-181 - [i5]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR abs/2008.12727 (2020) - [i4]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. CoRR abs/2010.11456 (2020)
2010 – 2019
- 2019
- [j1]Stefan Lendl, Ante Custic, Abraham P. Punnen:
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33: 101-117 (2019) - [c1]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - [i3]Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid Bases with Cardinality Constraints on the Intersection. CoRR abs/1907.04741 (2019) - 2018
- [i2]Ante Custic, Stefan Lendl:
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. CoRR abs/1802.08577 (2018) - [i1]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing obnoxious facilities on a graph. CoRR abs/1811.08918 (2018)
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-08-05 21:15 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:
