BSIK

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 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., 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.

DIAMANT

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.

DIAMANT

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.

Engineering and Physical Sciences Research Council (EPSRC)

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 (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) 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., 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.

Fonds zur Förderung der Wissenschaftlichen Forschung (Austria) (FWF)

Ç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.

Natural Sciences and Engineering Research Council of Canada (NSERC)

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.

Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO)

Ç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.

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. (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.

Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organization for Scientific Research] (NWO)

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.

Netherlands Organisation for Scientific Research (NWO)

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. 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) 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.

Netherlands Organization for Scientific Research

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.

Netherlands Organization for Scientific Research (NWO)

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.

Sweden. Vetenskapsrådet [Swedish Research Council]

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.

Universitetet i Linköping. Center for Industrial Information Technology (CENIIT)

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.

University of Warwick

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.

University of Warwick. Centre for Discrete Mathematics and Its Applications

Ç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.

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.

University of Warwick. Centre for Discrete Mathematics and Its Applications (DI-MAP)

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. (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.

University of Warwick. Centre for Discrete Mathematics and Its Applications (DIMAP)

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.

University of Warwick. Centre for Discrete Mathematics and its Applications (DIMAP)

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.

Universiṭat Ben-Guryon ba-Negev

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.

Warwick University's Centre for Discrete Mathematics and Its Applications (DIMAP)

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.

Warwick University's Centre for Discrete Mathematics and its Applications (DIMAP)

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.