2022
|
Goerigk, Marc; Lendl, Stefan; Wulf, Lasse Two-stage robust optimization problems with two-stage uncertainty Journal Article European Journal of Operational Research, 2022. BibTeX @article{goerigk2022two,
title = {Two-stage robust optimization problems with two-stage uncertainty},
author = {Marc Goerigk and Stefan Lendl and Lasse Wulf},
year = {2022},
date = {2022-01-01},
journal = {European Journal of Operational Research},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
2021
|
Lendl, Stefan; Peis, Britta; Timmermans, Veerle Matroid bases with cardinality constraints on the intersection Journal Article Mathematical Programming, pp. 1–24, 2021. BibTeX @article{lendl2021matroid,
title = {Matroid bases with cardinality constraints on the intersection},
author = {Stefan Lendl and Britta Peis and Veerle Timmermans},
year = {2021},
date = {2021-01-01},
journal = {Mathematical Programming},
pages = {1--24},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J Continuous facility location on graphs Journal Article Mathematical Programming, 2021, (accepted). BibTeX @article{own-contfac,
title = {Continuous facility location on graphs},
author = {Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
year = {2021},
date = {2021-01-01},
journal = {Mathematical Programming},
note = {accepted},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Grigoriev, Alexander; Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J Dispersing Obnoxious Facilities on a Graph Journal Article Algorithmica, 2021. Links | BibTeX @article{own-obnoxious,
title = {Dispersing Obnoxious Facilities on a Graph},
author = {Alexander Grigoriev and Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
doi = {10.1007/s00453-021-00800-3},
year = {2021},
date = {2021-01-01},
journal = {Algorithmica},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Lachmann, Thomas; Lendl, Stefan; Woeginger, Gerhard J A linear time algorithm for the robust recoverable selection problem Journal Article Discrete Applied Mathematics, 303 , pp. 94–107, 2021. Links | BibTeX @article{own-recovsel,
title = {A linear time algorithm for the robust recoverable selection problem},
author = {Thomas Lachmann and Stefan Lendl and Gerhard J Woeginger},
doi = {10.1016/j.dam.2020.08.012},
year = {2021},
date = {2021-01-01},
journal = {Discrete Applied Mathematics},
volume = {303},
pages = {94--107},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Chiarelli, Nina; Dallard, Clément; Darmann, Andreas; Lendl, Stefan; č, Martin Milani; č, Peter Murši; č, Nevena Piva; Pferschy, Ulrich Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs Inproceedings International Conference on Algorithmic Decision Theory, pp. 243–257, Springer 2021. BibTeX @inproceedings{chiarelli2021allocating,
title = {Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs},
author = {Nina Chiarelli and Clément Dallard and Andreas Darmann and Stefan Lendl and Martin Milani{č} and Peter Murši{č} and Nevena Piva{č} and Ulrich Pferschy},
year = {2021},
date = {2021-01-01},
booktitle = {International Conference on Algorithmic Decision Theory},
pages = {243--257},
organization = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Lendl, Stefan; Woeginger, Gerhard; Wulf, Lasse Non-preemptive Tree Packing Inproceedings International Workshop on Combinatorial Algorithms, pp. 456–468, Springer 2021. BibTeX @inproceedings{lendl2021non,
title = {Non-preemptive Tree Packing},
author = {Stefan Lendl and Gerhard Woeginger and Lasse Wulf},
year = {2021},
date = {2021-01-01},
booktitle = {International Workshop on Combinatorial Algorithms},
pages = {456--468},
organization = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Ç, Eranda ; Klinz, Bettina; Lendl, Stefan; Orlin, James B; Woeginger, Gerhard J; Wulf, Lasse Linearizable Special Cases of the Quadratic Shortest Path Problem Inproceedings International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 245–256, Springer 2021. BibTeX @inproceedings{ccela2021linearizable,
title = {Linearizable Special Cases of the Quadratic Shortest Path Problem},
author = {Eranda {Ç}ela and Bettina Klinz and Stefan Lendl and James B Orlin and Gerhard J Woeginger and Lasse Wulf},
year = {2021},
date = {2021-01-01},
booktitle = {International Workshop on Graph-Theoretic Concepts in Computer Science},
pages = {245--256},
organization = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Grigoriev, Alexander; Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J Dispersing obnoxious facilities on a graph Journal Article Algorithmica, 83 (6), pp. 1734–1749, 2021. BibTeX @article{grigoriev2021dispersing,
title = {Dispersing obnoxious facilities on a graph},
author = {Alexander Grigoriev and Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
year = {2021},
date = {2021-01-01},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1734--1749},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
'c, Ante {'C}usti; Lendl, Stefan The Steiner cycle and path cover problem on interval graphs Journal Article Journal of combinatorial optimization, pp. 1–9, 2021. BibTeX @article{custic2021steiner,
title = {The Steiner cycle and path cover problem on interval graphs},
author = {Ante {'C}usti{'c} and Stefan Lendl},
year = {2021},
date = {2021-01-01},
journal = {Journal of combinatorial optimization},
pages = {1--9},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Fischer, Dennis; Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J An Investigation of the Recoverable Robust Assignment Problem Inproceedings 16th International Symposium on Parameterized and Exact Computation, 2021. BibTeX @inproceedings{fischer2021investigation,
title = {An Investigation of the Recoverable Robust Assignment Problem},
author = {Dennis Fischer and Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
year = {2021},
date = {2021-01-01},
booktitle = {16th International Symposium on Parameterized and Exact Computation},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Goerigk, Marc; Lendl, Stefan Robust Combinatorial Optimization with Locally Budgeted Uncertainty Journal Article Open Journal of Mathematical Optimization, 2 , pp. 1–18, 2021. BibTeX @article{goerigk2021robust,
title = {Robust Combinatorial Optimization with Locally Budgeted Uncertainty},
author = {Marc Goerigk and Stefan Lendl},
year = {2021},
date = {2021-01-01},
journal = {Open Journal of Mathematical Optimization},
volume = {2},
pages = {1--18},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Deineko, Vladimir; Dragoti-Çela, Eranda; Klinz, Bettina; Lendl, Stefan; Woeginger, Gerhard J Matrix Completion Problems Miscellaneous 2021, (in preparation). BibTeX @misc{own-matrixcompletion,
title = {Matrix Completion Problems},
author = {Vladimir Deineko and Eranda Dragoti-Çela and Bettina Klinz and Stefan Lendl and Gerhard J Woeginger},
year = {2021},
date = {2021-01-01},
note = {in preparation},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
|
Goerigk, Marc; Lendl, Stefan; Wulf, Lasse Recoverable Robust Optimization with Discrete Budgeted Uncertainty Journal Article 2021, (submitted). BibTeX @article{own-recovdbu,
title = {Recoverable Robust Optimization with Discrete Budgeted Uncertainty},
author = {Marc Goerigk and Stefan Lendl and Lasse Wulf},
year = {2021},
date = {2021-01-01},
note = {submitted},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Goerigk, Marc; Lendl, Stefan; Wulf, Lasse On the Recoverable Traveling Salesman Problem Journal Article arXiv preprint arXiv:2111.09691, 2021. BibTeX @article{goerigk2021recoverable,
title = {On the Recoverable Traveling Salesman Problem},
author = {Marc Goerigk and Stefan Lendl and Lasse Wulf},
year = {2021},
date = {2021-01-01},
journal = {arXiv preprint arXiv:2111.09691},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Hoang, Hung P; Lendl, Stefan; Wulf, Lasse Assistance and Interdiction Problems on Interval Graphs Journal Article arXiv preprint arXiv:2107.14550, 2021, (submitted). BibTeX @article{hoang2021assistance,
title = {Assistance and Interdiction Problems on Interval Graphs},
author = {Hung P Hoang and Stefan Lendl and Lasse Wulf},
year = {2021},
date = {2021-01-01},
journal = {arXiv preprint arXiv:2107.14550},
note = {submitted},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
2020
|
Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J Continuous facility location on graphs Journal Article 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), 2020, (published). Links | BibTeX @article{own-contfacb,
title = {Continuous facility location on graphs},
author = {Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
url = {https://algo.rwth-aachen.de/~woeginger/ipco.pdf},
year = {2020},
date = {2020-01-01},
journal = {21st Conference on Integer Programming and Combinatorial Optimization (IPCO)},
note = {published},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
2019
|
Grigoriev, Alexander; Hartmann, Tim A; Lendl, Stefan; Woeginger, Gerhard J Dispersing Obnoxious Facilities on a Graph Inproceedings 36th International Symposium on Theoretical Aspects of Computer Science,
STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 33:1–33:11, 2019. Links | BibTeX @inproceedings{own-obnoxiousb,
title = {Dispersing Obnoxious Facilities on a Graph},
author = {Alexander Grigoriev and Tim A Hartmann and Stefan Lendl and Gerhard J Woeginger},
doi = {10.4230/LIPIcs.STACS.2019.33},
year = {2019},
date = {2019-01-01},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
STACS 2019, March 13-16, 2019, Berlin, Germany},
pages = {33:1--33:11},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Lendl, Stefan; 'C, Ante ; Punnen, Abraham P Combinatorial Optimization Problems with Interaction Costs:
Complexity and Solvable Cases Journal Article Discrete Optimization, 33 , pp. 101 – 117, 2019. Links | BibTeX @article{own-copic,
title = {Combinatorial Optimization Problems with Interaction Costs:
Complexity and Solvable Cases},
author = {Stefan Lendl and Ante {'C}usti 'c and Abraham P Punnen},
doi = {10.1016/j.disopt.2019.03.004},
year = {2019},
date = {2019-01-01},
journal = {Discrete Optimization},
volume = {33},
pages = {101 – 117},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
Lendl, Stefan; Peis, Britta; Timmermans, Veerle Matroid Sum with Cardinality Constraints on the Intersection Journal Article 17th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, 2019, (Extended Abstract). BibTeX @article{own-recovmatroid-ctw,
title = {Matroid Sum with Cardinality Constraints on the Intersection},
author = {Stefan Lendl and Britta Peis and Veerle Timmermans},
year = {2019},
date = {2019-01-01},
journal = {17th Cologne-Twente Workshop on Graphs & Combinatorial Optimization},
note = {Extended Abstract},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
2018
|
Alese, Leonardo; Lendl, Stefan; Tabatabai, Paul On sequences covering all rainbow k-progressions Journal Article Journal of Combinatorics, 9 (4), pp. 739 – 745, 2018. Links | BibTeX @article{own-rainbowprog,
title = {On sequences covering all rainbow k-progressions},
author = {Leonardo Alese and Stefan Lendl and Paul Tabatabai},
doi = {10.4310/JOC.2018.v9.n4.a9},
year = {2018},
date = {2018-01-01},
journal = {Journal of Combinatorics},
volume = {9},
number = {4},
pages = {739 – 745},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|