113320
Lehr- und Forschungsgebiet Diskrete Optimierung Also known as:Lehr- und Forschungsgebiet Mathematik (Diskrete Optimierung)| ID | I:(DE-82)113320_20140620 |
All known publications ...
Download: BibTeX | EndNote XML, Text | RIS |
Journal Article
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
Networks : an international journal 86(2), 220-237 (2025) [10.1002/net.22286]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article/Contribution to a conference proceedings
Upper bounds and approximation results for the k-slow burning problem
19. Cologne-Twente Workshop on graphs and Combinatorial Optimization, CTW 2023, Garmisch-PartenkirchenGarmisch-Partenkirchen, Germany, 20 Jun 2023 - 22 Jun 2023
Discrete applied mathematics 363, 88-104 (2025) [10.1016/j.dam.2024.11.025] special issue: "Graphs and Combinatorial Optimization (CTW 2023) / Guest Editors: Stefan Pickl, Andreas Brieden, Markus Siegle"
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article/Contribution to a conference proceedings
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
24. Conference on Integer Programming and Combinatorial Optimization, IPCO, Madison, WIMadison, WI, USA, 21 Jun 2023 - 23 Jun 2023
Mathematical programming 210(1/2), 97-146 (2024) [10.1007/s10107-024-02135-7] special issue: "Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023 / Issue Editors: Alberto Del Pia, Volker Kaibel"
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Contribution to a book/Contribution to a conference proceedings
k-Slow Burning: Complexity and Upper Bounds
Graphs and combinatorial optimization: from theory to applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 / Andreas Brieden, Stefan Pickl, Markus Siegle editors
19. Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2023, Garmisch-PartenkirchenGarmisch-Partenkirchen, Germany, 20 Jun 2023 - 22 Jun 2023
Cham, Switzerland : Springer, AIRO Springer series 13, 67-79 (2024) [10.1007/978-3-031-46826-1_6]
BibTeX |
EndNote:
XML,
Text |
RIS
Master Thesis
Generalized temporally repeated flows for the quickest transshipment and related problems
Aachen : RWTH Aachen University 1 Online-Ressource: Illustrationen (2024) [10.18154/RWTH-2024-07726] = Masterarbeit, RWTH Aachen University, 2022
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article/Contribution to a conference proceedings
Robust two-dose vaccination schemes and the directed b-matching problem
7. International Symposium on Combinatorial Optimization, ISCO 2022, onlineonline, 18 May 2022 - 20 May 2022
Discrete applied mathematics 356, 369-392 (2024) [10.1016/j.dam.2024.06.029] special issue: "Special issue paper: combinatorial optimization ISCO 2022 / edited by Ivana Ljubic, A. Ridha Mahjoub, Santanu Dey, Francisco Barahona"
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
Characterising clique convergence for locally cyclic graphs of minimum degree δ ≥ 6
Discrete mathematics 347(11), 114144 (2024) [10.1016/j.disc.2024.114144]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
Robust transshipment problem under consistent flow constraints
Networks : an international journal 83(1), 53-82 (2024) [10.1002/net.22184]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
Γ-robust optimization of project scheduling problems
Computers & operations research 161, 106453 (2024) [10.1016/j.cor.2023.106453]
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
Counterexamples to the Characterisation of Graphs with Equal Independence and Annihilation Number
Journal of combinatorics 30(4), P4.25 (2023) [10.37236/11458]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
All known publications ...
Download: BibTeX | EndNote XML, Text | RIS |