default search action
Lasse Wulf
Person information
- affiliation: Technical University of Denmark, Copenhagen, Denmark
- affiliation (former): Graz University of Technology, Institute of Discrete Mathematics, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Marc Goerigk
, Stefan Lendl, Lasse Wulf:
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343: 355-370 (2024) - [c7]Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf:
On the Exact Matching Problem in Dense Graphs. STACS 2024: 33:1-33:17 - [i14]Michael Hoffmann, Tillmann Miltzow, Simon Weber
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR abs/2401.02172 (2024) - [i13]Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf:
On the Exact Matching Problem in Dense Graphs. CoRR abs/2401.03924 (2024) - 2023
- [j4]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-Preemptive Tree Packing. Algorithmica 85(3): 783-804 (2023) - [j3]Hung P. Hoang
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340: 153-170 (2023) - [c6]Anita Dürr, Nicolas El Maalouly, Lasse Wulf:
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. APPROX/RANDOM 2023: 18:1-18:21 - [c5]Eranda Çela
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO 2023: 466-479 - [c4]Nicolas El Maalouly, Raphael Steiner, Lasse Wulf:
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ISAAC 2023: 28:1-28:18 - [i12]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) - [i11]Anita Dürr, Nicolas El Maalouly, Lasse Wulf:
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. CoRR abs/2307.02205 (2023) - [i10]Christoph Grüne, Lasse Wulf:
A large and natural Class of Σp2- and Σp3-complete Problems in Bilevel and Robust Optimization. CoRR abs/2311.10540 (2023) - 2022
- [j2]Marc Goerigk
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302(1): 62-78 (2022) - [j1]Marc Goerigk
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303(2): 567-580 (2022) - [i9]Nicolas El Maalouly, Raphael Steiner
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. CoRR abs/2207.09797 (2022) - [i8]Marc Goerigk, Stefan Lendl
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR abs/2209.01011 (2022) - [i7]Nicolas El Maalouly, Lasse Wulf:
Exact Matching and the Top-k Perfect Matching Problem. CoRR abs/2209.09661 (2022) - [i6]Milos Stojakovic, Lasse Wulf:
On the Multi-Robber Damage Number. CoRR abs/2209.10965 (2022) - 2021
- [c3]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-preemptive Tree Packing. IWOCA 2021: 456-468 - [c2]Eranda Çela
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - [i5]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR abs/2104.03043 (2021) - [i4]Hung P. Hoang, Stefan Lendl, Lasse Wulf:
Assistance and Interdiction Problems on Interval Graphs. CoRR abs/2107.14550 (2021) - [i3]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the Recoverable Traveling Salesman Problem. CoRR abs/2111.09691 (2021) - 2020
- [i2]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR abs/2008.12727 (2020)
2010 – 2019
- 2018
- [c1]Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze
A Greedy Heuristic for Crossing-Angle Maximization. GD 2018: 286-299 - [i1]Almut Demel, Dominik Dürrschnabel
A Greedy Heuristic for Crossing-Angle Maximization. CoRR abs/1807.09483 (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 20:18 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: