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

Publications 2018

[24] Thomas Lachmann, Stefan Lendl, A Linear Time Algorithm for Selection with Intersection Constraints with Applications to the Recoverable Robust Selection and Representative Selection Problem with Interval Uncertainties, (2018). (preprint)
[bib]
[23] Vladimir Deineko, Eranda Dragoti-Çela, Bettina Klinz, Stefan Lendl, Gerhard Woeginger, Matrix Completion Problems, (2018). (in preparation)
[bib]
[22] Alexander Grigoriev, Tim Hartmann, Stefan Lendl, Gerhard Woeginger, Dispersing obnoxious facilities on a graph, (2018). (preprint)
[bib] [arXiv]
[21] Leonardo Alese, Stefan Lendl, Paul Tabatabai, Sequences covering all rainbow $k$-progressions, J. Combinatorics, 9(4), 739—745, (2018).
[bib] [arXiv]
[20] Bettina Klinz, Vladimir G. Deineko, 2VRP: a benchmark problem for small but rich VRPs, (2018). (preprint)
[bib] [arXiv]
[19] Ante Ćustić, Stefan Lendl, On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games, (2018). (preprint)
[bib] [arXiv]
[18] Eranda Çela, Vladimir G. Deineko, 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).
[bib] [arXiv] [doi/article]

Publications 2017

[17] Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger, The multi-stripe traveling salesman problem, Annals of OR, 259(1-2), 21—34, (2017).
[bib] [arXiv] [doi/article]
[16] Stefan Lendl, Ante Ćustić, Abraham P. Punnen, Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases, (2017). (preprint)
[bib] [arXiv]

Publications 2016

[15] Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger, Linearizable special cases of the QAP, J. Comb. Optim., 31(3), 1269—1279, (2016).
[bib] [arXiv] [MR] [doi/article]
[14] Ante Ćustić, Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete Optimization, 19, 23—35, (2016).
[bib] [MR] [doi/article]

Publications 2015

[13] Ante Ćustić, Lajos Hajdu, Dijana Kreso, Robert Tijdeman, On conjectures and problems of Ruzsa concerning difference graphs of S-units, Acta Math. Hungar., 146, 391-404, (2015).
[bib] [arXiv] [MR] [doi/article]
[12] Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger, Well-solvable cases of the QAP with block-structured matrices, Discrete Appl. Math., 186, 56—65, (2015).
[bib] [arXiv] [MR] [doi/article]
[11] Mihyun Kang, Christoph Koch, Angélica Pachón, The phase transition in multitype binomial random graphs, SIAM J. Discrete Math., 29(2), 1042—1064, (2015).
[bib] [arXiv] [MR] [doi/article]
[10] Mihyun Kang, Michał Karoński, Christoph Koch, Tamás Makai, Properties of stochastic Kronecker graphs, J. Comb., 6(4), 395—432, (2015).
[bib] [arXiv] [MR] [doi/article]
[9] Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger, Geometric versions of the three-dimensional assignment problem under general norms, Discrete Optimization, 18, 38—55, (2015).
[bib] [arXiv] [MR] [doi/article]
[8] Ante Ćustić, Vedran Krčadinac, Yue Zhou, Tiling Groups with Difference Sets, The Electronic Journal of Combinatorics, 22(2), (2015).
[bib] [MR] [doi/article]

Publications 2014

[7] Rainer E. Burkard, Roswitha Rissner, Bounds on the radius and status of graphs, Networks, 64(2), 76-83, (2014).
[bib] [arXiv] [MR] [doi/article]
[6] Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger, Four point conditions for symmetric TSP: The complete classification, Discrete Optimization, 14, 147-159, (2014).
[bib] [MR] [doi/article]
[5] Ante Ćustić, Efficiently solvable special cases of multidimensional assignment problems, PhD thesis, TU Graz, (2014).
[bib] [doi/article]
[4] Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger, Planar 3-dimensional assignment problems with Monge-like cost arrays, (2014). (preprint)
[bib] [arXiv]

Publications 2013

[3] Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger, Uniqueness in quadratic and hyperbolic 0-1 programming problems, Operations Research Letters, 41, 633-635, (2013).
[bib] [arXiv] [doi/article]
[2] Andrea Jiménez, Mihyun Kang, 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).
[bib] [arXiv] [MR] [doi/article]

Publications 2011

[1] Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger, The Wiener maximum quadratic assignment problem, Discrete Optimization, 8, 411-416, (2011).
[bib] [arXiv] [MR] [doi/article]