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

2011
[30]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]
2013
[29]Jiménez, Andrea, Kang, Mihyun and Loebl, Martin, 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]
[28]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]
2014
[27]Ante Ćustić, Bettina Klinz and Gerhard J. Woeginger, Planar 3-dimensional assignment problems with Monge-like cost arrays, (2014). (preprint) [bibtex]
[26]Ante Ćustić, Efficiently solvable special cases of multidimensional assignment problems, PhD thesis, TU Graz, (2014). [bibtex] [url]
[25]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]
[24]Rainer E. Burkard and Roswitha Rissner, Bounds on the radius and status of graphs, Networks, 64(2), 76-83, (2014). [bibtex] [doi]
2015
[23]Ante Ćustić, Vedran Krčadinac and Yue Zhou, Tiling Groups with Difference Sets, The Electronic Journal of Combinatorics, 22(2), (2015). [bibtex] [url]
[22]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]
[21]Kang, Mihyun, Karoński, Michał, Koch, Christoph and Makai, Tamás, Properties of stochastic Kronecker graphs, J. Comb., 6(4), 395–432, (2015). [bibtex] [doi]
[20]Kang, Mihyun, Koch, Christoph and Pachón, Angélica, The phase transition in multitype binomial random graphs, SIAM J. Discrete Math., 29(2), 1042–1064, (2015). [bibtex] [doi]
[19]Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J., Well-solvable cases of the QAP with block-structured matrices, Discrete Appl. Math., 186, 56–65, (2015). [bibtex] [doi]
[18]Ante Ćustić, Lajos Hajdu, Dijana Kreso and Robert Tijdeman, On conjectures and problems of Ruzsa concerning difference graphs of S-units, Acta Math. Hungar., 146, 391-404, (2015). [bibtex] [doi]
2016
[17]Ante Ćustić and Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete Optimization, 19, 23–35, (2016). [bibtex] [doi]
[16]Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J., Linearizable special cases of the QAP, J. Comb. Optim., 31(3), 1269–1279, (2016). [bibtex] [doi]
2017
[15]Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J., The multi-stripe traveling salesman problem, Annals of OR, 259(1-2), 21–34, (2017). [bibtex] [doi]
2018
[14]Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J., 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]
[13]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]
[12]Klinz, Bettina and Deineko, Vladimir G., 2VRP: a benchmark problem for small but rich VRPs, (2018). (preprint) [bibtex]
[11]Leonardo Alese, Stefan Lendl and Paul Tabatabai, Sequences covering all rainbow $k$-progressions, J. Combinatorics, 9(4), 739–745, (2018). [bibtex]
[10]Vladimir Deineko, Eranda Dragoti-Çela, Bettina Klinz, Stefan Lendl and Gerhard Woeginger, Matrix Completion Problems, (2018). (in preparation) [bibtex]
2019
[9]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] [url] [doi]
[8]Lendl, Stefan, Ćustić, Ante and Punnen, Abraham P, Combinatorial optimization with interaction costs: Complexity and solvable cases, Discrete optimization, Elsevier, 33, 101–117, (2019). [bibtex] [doi]
[7]Stefan Lendl, Generalizations of Classic Combinatorial Optimization Problems on Graphs and Matroidal Structures: Algorithms and Complexity, PhD thesis, TU Graz, (2019). [bibtex]
2020
[6]Hartmann, Tim A., Lendl, Stefan and Woeginger, Gerhard J., Continuous Facility Location on Graphs, In Integer Programming and Combinatorial Optimization (Bienstock, Daniel, Zambelli, Giacomo, eds.), Springer International Publishing, 171–181, (2020). [bibtex] [doi]
[5]Marc Goerigk, Stefan Lendl and Lasse Wulf, Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty, (2020). (submitted) [bibtex]
[4]Thomas Lachmann, Stefan Lendl and Gerhard J. Woeginger, A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, (2020). [bibtex] [url] [doi]
2021
[3]Marc Goerigk and Stefan Lendl, Robust Combinatorial Optimization with Locally Budgeted Uncertainty, 2, (2021). [bibtex] [doi]
[2]Grigoriev, Alexander, Hartmann, Tim A., Lendl, Stefan and Woeginger, Gerhard J., Dispersing Obnoxious Facilities on a Graph, Algorithmica, 83(6), 1734–1749, (2021). [bibtex] [doi]
[1]Stefan Lendl, Britta Peis and Veerle Timmermans, Matroid Bases with Cardinality Constraints on the Intersection, (2021). [bibtex] [url] [doi]