Stefan Lendl - RankMe

38 papers A 1B 5C 1Journal 30Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A linear time algorithm for linearizing quadratic and higher-order shortest path problems. Math. Program. Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2025	J	`jnl`	Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. Discret. Optim. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. Marc Goerigk, Stefan Lendl, Lasse Wulf
2024	J	`jnl`	Rescheduling with New Orders Under Bounded Disruption. INFORMS J. Comput. Stefan Lendl, Ulrich Pferschy, Elena Rener
2023	B	`conf`	A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023	J	`jnl`	A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023	J	`jnl`	Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023	J	`jnl`	Assistance and interdiction problems on interval graphs. Discret. Appl. Math. Hung P. Hoang, Stefan Lendl, Lasse Wulf
2023	J	`jnl`	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2023	J	`jnl`	Non-Preemptive Tree Packing. Algorithmica Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2022	J	`jnl`	Allocation of Indivisible Items with Individual Preference Graphs. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2022	J	`jnl`	Continuous facility location on graphs. Math. Program. Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2022	B	`conf`	Dispersing Obnoxious Facilities on Graphs by Rounding Distances. MFCS Tim A. Hartmann, Stefan Lendl
2022	J	`jnl`	Dispersing Obnoxious Facilities on Graphs by Rounding Distances. CoRR Tim A. Hartmann, Stefan Lendl
2022	J	`jnl`	Matroid bases with cardinality constraints on the intersection. Math. Program. Stefan Lendl, Britta Peis, Veerle Timmermans
2022	J	`jnl`	On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2022	J	`jnl`	Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. Marc Goerigk, Stefan Lendl, Lasse Wulf
2022	J	`jnl`	The Steiner cycle and path cover problem on interval graphs. J. Comb. Optim. Ante Custic, Stefan Lendl
2022	J	`jnl`	Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. Marc Goerigk, Stefan Lendl, Lasse Wulf
2021	J	`jnl`	A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger
2021	—	`conf`	Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021	B	`conf`	An Investigation of the Recoverable Robust Assignment Problem. IPEC Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021	J	`jnl`	Assistance and Interdiction Problems on Interval Graphs. CoRR Hung P. Hoang, Stefan Lendl, Lasse Wulf
2021	J	`jnl`	Dispersing Obnoxious Facilities on a Graph. Algorithmica Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021	B	`conf`	Linearizable Special Cases of the Quadratic Shortest Path Problem. WG Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2021	C	`conf`	Non-preemptive Tree Packing. IWOCA Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2021	J	`jnl`	On the Recoverable Traveling Salesman Problem. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2021	J	`jnl`	Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. Marc Goerigk, Stefan Lendl
2021	J	`jnl`	Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2020	J	`jnl`	An Investigation of the Recoverable Robust Assignment Problem. CoRR Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020	B	`conf`	Continuous Facility Location on Graphs. IPCO Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020	J	`jnl`	Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2019	J	`jnl`	Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. Stefan Lendl, Ante Custic, Abraham P. Punnen
2019	A	`conf`	Dispersing Obnoxious Facilities on a Graph. STACS Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2019	J	`jnl`	Matroid Bases with Cardinality Constraints on the Intersection. CoRR Stefan Lendl, Britta Peis, Veerle Timmermans
2018	J	`jnl`	Dispersing obnoxious facilities on a graph. CoRR Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2018	J	`jnl`	On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. CoRR Ante Custic, Stefan Lendl