Keskin, Merve, Branke, Juergen, Deineko, Vladimir G. and Strauss, Arne (2023) Dynamic multi-period vehicle routing with touting. European Journal of Operational Research . doi:10.1016/j.ejor.2023.02.037 ISSN 0377-2217. (In Press)

Cela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J (2021) Travelling salesman paths on Demidenko matrices. Discrete Applied Mathematics . doi:10.1016/j.dam.2021.11.019 ISSN 0166-218X. (In Press)

Cela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2018) New special cases of the quadratic assignment problem with diagonally structured coefficient matrices. European Journal of Operational Research, 267 (3). pp. 818-834. doi:10.1016/j.ejor.2017.12.024 ISSN 0377-2217.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2017) The multi-stripe travelling salesman problem. Annals of Operations Research , 259 (1-2). pp. 21-34. doi:10.1007/s10479-017-2513-4 ISSN 0254-5330.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2016) Linearizable special cases of the QAP. Journal of Combinatorial Optimization, 31 (3). pp. 1269-1279. doi:10.1007/s10878-014-9821-2 ISSN 1382-6905.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2015) Well-solvable cases of the QAP with block-structured matrices. Discrete Applied Mathematics, Volume 186 . pp. 56-65. doi:10.1016/j.dam.2015.01.005 ISSN 0166-218X.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2014) Two hardness results for Gamson’s game. Social Choice and Welfare, 43 (4). pp. 963-972. doi:10.1007/s00355-014-0819-6 ISSN 0176-1714.

Deineko, Vladimir G., Klinz, Bettina, Tiskin, Alexander and Woeginger, Gerhard J. (2014) Four-point conditions for the TSP : the complete complexity classification. Discrete Optimization, Volume 14 . pp. 147-159. doi:10.1016/j.disopt.2014.09.003 ISSN 1572-5286.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2014) Another look at the shoelace TSP : the case of very old shoes. In: Ferro , Alfredo and Luccio , Fabrizio , (eds.) Proceedings of 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Lecture Notes in Computer Science, Volume 8496 . Berlin Heidelberg: Springer, pp. 125-126. ISBN 9783319078892

Deineko, Vladimir G. and Woeginger, Gerhard J. (2013) Complexity and in-approximability of a selection problem in robust optimization. 4OR, 11 (3). pp. 249-252. doi:10.1007/s10288-012-0227-7 ISSN 1619-4500.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2013) Two hardness results for core stability in hedonic coalition formation games. Discrete Applied Mathematics, Volume 161 (Number 13-14). pp. 1837-1842. doi:10.1016/j.dam.2013.03.003 ISSN 0166-218X.

Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J. (2013) Uniqueness in quadratic and hyperbolic 0–1 programming problems. Operations Research Letters, Volume 41 (Number 6). pp. 633-635. doi:10.1016/j.orl.2013.08.013 ISSN 0167-6377.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2012) The x-and-y-axes travelling salesman problem. European Journal of Operational Research, 223 (2). pp. 333-345. doi:10.1016/j.ejor.2012.06.036 ISSN 0377-2217.

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2012) Another well-solvable case of the QAP : maximizing the job completion time variance. Operations Research Letters, Vol.40 (No.5). pp. 356-359. doi:10.1016/j.orl.2012.06.005 ISSN 0167-6377.

Deineko, Vladimir G. and Woeginger, Gerhard (2011) Unbounded knapsack problems with arithmetic weight sequences. European Journal of Operational Research, Vol.213 (No.2). pp. 384-387. doi:10.1016/j.ejor.2011.03.028 ISSN 0377-2217.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2011) A well-solvable special case of the bounded knapsack problem. Operations Research Letters, Vol.39 (No.2). pp. 118-120. doi:10.1016/j.orl.2011.01.006 ISSN 0167-6377.

Deineko, Vladimir G., Shabtay, Dvir and Steiner, George (2011) On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics, 17 (1). pp. 61-96. doi:10.1007/s10732-010-9127-1 ISSN 1381-1231.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2010) Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optimization, Vol.7 (No.4). pp. 191-196. doi:10.1016/j.disopt.2010.03.008 ISSN 1572-5286.

Deineko, Vladimir G. and Tiskin, Alexander (2009) Fast minimum-weight double-tree shortcutting for metric TSP. Journal of Experimental Algorithmics, Vol.14 . 4.6. doi:10.1145/1498698.1594232 ISSN 1084-6654.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2009) A new family of scientific impact measures : the generalized Kosmulski-indices. Scientometrics, Vol.80 (No.3). pp. 819-826. doi:10.1007/s11192-009-2130-0 ISSN 0138-9130.

Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J. (2009) Polygons with inscribed circles and prescribed side lengths. Applied Mathematics Letters, Vol.22 (No.5). pp. 704-706. doi:10.1016/j.aml.2008.05.002 ISSN 0893-9659.

Deineko, Vladimir G. and Tiskin, Alexander (2009) Min-weight double-tree shortcutting for metric TSP : bounding the approximation ratio. Electronic Notes in Discrete Mathematics, Volume 32 . pp. 19-26. doi:10.1016/j.endm.2009.02.004 ISSN 1571-0653.

Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J. (2009) The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences, Vol.57 (No.2). pp. 282-284. doi:10.1016/j.mathsocsci.2008.11.005 ISSN 0165-4896.

Deineko, Vladimir G., O'Brien, Frances A. and Ridd, T. (2009) Group up to learn together: a system for equitable allocation of students to groups. In: 1st International Conference on Computer Supported Education, Lisbon, Portugal, March 23-26, 2009. Published in: CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Vol.1 pp. 140-145. ISBN 978-989-8111-82-1.

Deineko, Vladimir G., Jonsson, P., Klasson, Mikael and Krokhin, Andrei (2008) The approximability of MAX CSP with fixed-value constraints. Association for Computing Machinery Journal, Vol.55 (No.4). doi:10.1145/1391289.1391290 ISSN 0004-5411.

Deineko, Vladimir G. and Tiskin, Alexander (2007) Fast minimum-weight double-tree shortcutting for metric TSP. In: Demetrescu, C., (ed.) Experimental Algorithms. Lecture Notes in Computer Science, Volume 4525 . Springer Berlin Heidelberg, pp. 136-149. ISBN 9783540728443

Deineko, Vladimir G. and Woeginger, Gerhard J. (2006) Well-solvable instances for the partition problem. APPLIED MATHEMATICS LETTERS, 19 (10). pp. 1053-1056. doi:10.1016/j.aml.2005.11.016 ISSN 0893-9659.

Deineko, Vladimir G. and Woeginger, Gerhard J. (2006) On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, Vol.34 (No.2). pp. 175-179. doi:10.1016/j.orl.2005.04.003 ISSN 0167-6377.

Deineko, Vladimir, Klinz, Bettina and Woeginger, Gerhard J. (2006) Four point conditions and exponential neighborhoods for symmetric TSP. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, Jan 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 544-553. ISBN 978-0-89871-605-4. doi:10.1145/1109557.1109617

Deineko, Vladimir and Tiskin, Alexander (2006) One-sided monge TSP is NP-Hard. In: Gavrilova, M. and Gervasi, O. and Kumar, V. and Tan, C. J. K. and Taniar, D. and Lagana, A. and Mun, Y. and Choo, H., (eds.) Computational Science and Its Applications - ICCSA 2006. Lecture Notes in Computer Science, Volume 3982 . Springer, pp. 793-801. ISBN 9783540340751

Deineko, Vladimir G., van der Veen, J. A., Rudolf, R. and Woeginger, G. J. (1997) Three easy special cases of the euclidean travelling salesman problem. RAIRO - Operations Research, 31 (4). pp. 343-362. ISSN 0399-0559.

Deineko, Vladimir G. and Woeginger, Gerhard J. (1996) The Convex-hull-and-k-line Travelling Salesman Problem. Information Processing Letters, 59 (6). pp. 295-301. doi:10.1016/0020-0190(96)00125-1 ISSN 0020-0190.

Deineko, Vladimir G., Rudolf, Rüdiger and Woeginger, Gerhard J. (1996) On the recognition of permuted Supnick and incomplete Monge matrices. ACTA Informatica, 33 (6). pp. 559-569. doi:10.1007/s002360050058 ISSN 0001-5903.