Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Wulf, Lasse
32  Ergebnisse:
Personensuche X
?
1

A linear time algorithm for linearizing quadratic and highe..:

Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan..
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

On the complexity of robust multi-stage problems with discr..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
Discrete Applied Mathematics.  343 (2024)  - p. 355-370 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Assistance and interdiction problems on interval graphs:

Hoang, Hung P. ; Lendl, Stefan ; Wulf, Lasse
Discrete Applied Mathematics.  340 (2023)  - p. 153-170 , 2023
Link: https://doi.org/10.1016/..
 
?
4

A Linear Time Algorithm for Linearizing Quadratic and Highe..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan.. - p. 466-479 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Two-Stage robust optimization problems with two-stage uncer..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
European Journal of Operational Research.  302 (2022)  1 - p. 62-78 , 2022
Link: https://doi.org/10.1016/..
 
?
6

Recoverable robust representatives selection problems with ..:

Goerigk, Marc ; Lendl, Stefan ; Wulf, Lasse
European Journal of Operational Research.  303 (2022)  2 - p. 567-580 , 2022
Link: https://doi.org/10.1016/..
 
?
7

Non-Preemptive Tree Packing:

Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse
Algorithmica.  85 (2022)  3 - p. 783-804 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Non-preemptive Tree Packing:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse - p. 456-468 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Linearizable Special Cases of the Quadratic Shortest Path P..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan... - p. 245-256 , 2021
Link: https://doi.org/10.1007/..
 
?
10

A Greedy Heuristic for Crossing-Angle Maximization:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Demel, Almut ; Dürrschnabel, Dominik ; Mchedlidze, Tamara.. - p. 286-299 , 2018
Link: https://doi.org/10.1007/..
 
?
11

Recognition of Unit Segment and Polyline Graphs is $\exists..:

Hoffmann, Michael ; Miltzow, Tillmann ; Weber, Simon.
http://arxiv.org/abs/2401.02172.  , 2024
Link: http://arxiv.org/abs/240..
 
?
12

On the Exact Matching Problem in Dense Graphs:

Maalouly, Nicolas El ; Haslebacher, Sebastian ; Wulf, Lasse
http://arxiv.org/abs/2401.03924.  , 2024
Link: http://arxiv.org/abs/240..
 
?
13

Non-Preemptive Tree Packing:

Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse
info:eu-repo/semantics/altIdentifier/wos/WOS:000843410900001.  , 2023
Link: https://publications.rwt..
 
?
14

Exact Matching: Correct Parity and FPT Parameterized by Ind..:

El Maalouly, Nicolas ; Steiner, Raphael ; Wulf, Lasse
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.ISAAC.2023.28.  , 2023
Link: https://hdl.handle.net/2..
 
?
15

An Approximation Algorithm for the Exact Matching Problem i..:

Dürr, Anita ; Maalouly, Nicolas El ; Wulf, Lasse
http://arxiv.org/abs/2307.02205.  , 2023
Link: http://arxiv.org/abs/230..
 
1-15