Reminder

In all DK related publications, it is required to acknowledge support of the FWF. The following naming convention must be used in all cases:

    Austrian Science Fund (FWF): W1230

For example, you may include a sentence such as "The author acknowledges the support of the Austrian Science Fund (FWF): W1230." Please do not forget!

Project 7:
Structural investigations on combinatorial optimisation problems

[38]Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger, Continuous facility location on graphs, Mathematical Programming, Springer, 192, 2017-227, (2022). [bibtex] [doi]
[37]Marc Goerigk, Stefan Lendl and Lasse Wulf, Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty, European Journal of Operational Research, (2022). (to appear) [bibtex] [doi]
[36]Marc Goerigk, Stefan Lendl and Lasse Wulf, Two-stage robust optimization problems with two-stage uncertainty, European Journal of Operational Research, (2022). [bibtex] [doi]
[35]Ante Ćustić and Stefan Lendl, The Steiner cycle and path cover problem on interval graphs, Journal of combinatorial optimization, 43, 226-234, (2022). [bibtex] [doi]
[34]Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-preemptive Tree Packing, Chapter in Combinatorial Algorithms. IWOCA 2021, Springer, 12757, 456–468, (2021). [bibtex] [doi]
[33]Stefan Lendl, Britta Peis and Veerle Timmermans, Matroid Bases with Cardinality Constraints on the Intersection, Math. Programming, (2021). [bibtex] [doi]
[32]Thomas Lachmann, Stefan Lendl and Gerhard J. Woeginger, A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, 303, 94–107, (2021). [bibtex] [doi]
[31]Bettina Klinz, Vladimir G. Deineko and Mengke Wang, 2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics, (2021). (submitted) [bibtex]
[30]Hung P. Hoang, Stefan Lendl and Lasse Wulf, Assistance and Interdiction Problems on Interval Graphs, (2021). (submitted) [bibtex]
[29]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger, Dispersing Obnoxious Facilities on a Graph, Algorithmica, 83(6), 1734–1749, (2021). [bibtex] [doi]
[28]Marc Goerigk and Stefan Lendl, Robust Combinatorial Optimization with Locally Budgeted Uncertainty, Open Journal of Mathematical Optimization, 2, (2021). [bibtex] [doi]
[27]Marc Goerigk, Stefan Lendl and Lasse Wulf, On the Recoverable Traveling Salesman Problem, (2021). (preprint) [bibtex]
[26]Dennis Fischer, Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger, An Investigation of the Recoverable Robust Assignment Problem, Chapter in 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) (Petr A. Golovach, Meirav Zehavi, eds.), 214, 19:1–19:14, (2021). [bibtex] [doi]
[25]Eranda Çela, Bettina Klinz, Stefan Lendl, James B Orlin, Gerhard J Woeginger and Lasse Wulf, Linearizable Special Cases of the Quadratic Shortest Path Problem, In International Workshop on Graph-Theoretic Concepts in Computer Science, Springer, 12911, 245–256, (2021). [bibtex] [doi]
[24]Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger, Travelling salesman paths on Demidenko matrices, Discrete Applied Mathematics, (2021). [bibtex] [doi]
[23]Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger, Continuous Facility Location on Graphs, In Integer Programming and Combinatorial Optimization (Daniel Bienstock, Giacomo Zambelli, eds.), Springer, 171–181, (2020). [bibtex] [doi]
[22]Stefan Lendl, Generalizations of Classic Combinatorial Optimization Problems on Graphs and Matroidal Structures: Algorithms and Complexity, PhD thesis, TU Graz, (2019). [bibtex] [url]
[21]Stefan Lendl, Ante Ćustić and Abraham P Punnen, Combinatorial optimization with interaction costs: Complexity and solvable cases, Discrete optimization, 33, 101–117, (2019). [bibtex] [doi]
[20]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger, Dispersing Obnoxious Facilities on a Graph, In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) (Rolf Niedermeier, Christophe Paul, eds.), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 126, 33:1–33:11, (2019). [bibtex] [doi]
[19]Vladimir Deineko, Eranda Dragoti-Çela, Bettina Klinz, Stefan Lendl and Gerhard Woeginger, Matrix Completion Problems, (2018). (in preparation) [bibtex]
[18]Ante Ćustić and Stefan Lendl, On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games, (2018). (preprint) [bibtex]
[17]Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger, New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices, European Journal of Operational Research, 267(3), 818–834, (2018). [bibtex] [doi]
[16]Leonardo Alese, Stefan Lendl and Paul Tabatabai, On Sequences covering all rainbow $k$-progressions, Journal of Combinatorics, 9(4), 739-745, (2018). [bibtex] [doi]
[15]Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger, The multi-stripe traveling salesman problem, Annals of OR, 259, 21–34, (2017). [bibtex] [doi]
[14]Ante Ćustić and Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete Optimization, 19, 23–35, (2016). [bibtex] [doi]
[13]Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger, Linearizable special cases of the QAP, Journal of Combinatorial Optimization, 31(3), 1269–1279, (2016). [bibtex] [doi]
[12]Mihyun Kang, Michał Karoński, Christoph Koch and Tamás Makai, Properties of stochastic Kronecker graphs, Journal of Combinatorics, 6(4), 395–432, (2015). [bibtex] [doi]
[11]Ante Ćustić, Lajos Hajdu, Dijana Kreso and Robert Tijdeman, On conjectures and problems of Ruzsa concerning difference graphs of S-units, Acta Mathematica Hungarica, 146, 391-404, (2015). [bibtex] [doi]
[10]Ante Ćustić, Vedran Krčadinac and Yue Zhou, Tiling Groups with Difference Sets, The Electronic Journal of Combinatorics, 22(2), (2015). [bibtex] [url]
[9]Ante Ćustić, Bettina Klinz and Gerhard J. Woeginger, Geometric versions of the three-dimensional assignment problem under general norms, Discrete Optimization, 18, 38–55, (2015). [bibtex] [doi]
[8]Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger, Well-solvable cases of the QAP with block-structured matrices, Discrete Applied Mathematics, 186, 56–65, (2015). [bibtex] [doi]
[7]Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin and Gerhard J. Woeginger, Four point conditions for symmetric TSP: The complete classification, Discrete Optimization, 14, 147-159, (2014). [bibtex] [doi]
[6]Ante Ćustić, Efficiently solvable special cases of multidimensional assignment problems, PhD thesis, TU Graz, (2014). [bibtex] [url]
[5]Ante Ćustić, Bettina Klinz and Gerhard J. Woeginger, Planar 3-dimensional assignment problems with Monge-like cost arrays, (2014). (preprint) [bibtex]
[4]Rainer E. Burkard and Roswitha Rissner, Bounds on the radius and status of graphs, Networks, 64(2), 76-83, (2014). [bibtex] [doi]
[3]Andrea Jiménez, Mihyun Kang and Martin Loebl, Directed cycle double covers: hexagon graphs, Chapter in The Seventh European Conference on Combinatorics, Graph Theory and Applications, Ed. Norm., Pisa, 16, 147–151, (2013). [bibtex] [doi]
[2]Vladimir G. Deineko, Bettina Klinz and Gerhard J. Woeginger, Uniqueness in quadratic and hyperbolic 0-1 programming problems, Operations Research Letters, 41, 633-635, (2013). [bibtex] [doi]
[1]Eranda Çela, Nina S. Schmuck, Shmuel Wimer and Gerhard J. Woeginger, The Wiener maximum quadratic assignment problem, Discrete Optimization, 8, 411-416, (2011). [bibtex] [doi]