Publications featuring Vladimir Deineko

Publications

Book chapters

• Deineko V, Hoffman M and Okamoto Y., Woeginger G. The traveling salesman problem with few inner points. Proc. 10th COCOON, Lect. Notes Comput. Sci. , n.p., 2004. 268-277.
• Burkard R.E., Deineko V and Woeginger G.J. The Travelling Salesman and the PQ-tree. Integer Programming and Combinatorial Optimization. Ed. W H Cunningham, S T McCormick and M Queyranne. Springer Lecture Notes in Computer Science, 1996. 490-504.

Journal articles

• Deineko V, D.Shabtay and G.Steiner. On the asymptotic behaviour of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics (2010) (Accepted).
• V.Deineko, G.Woeginger. A new family of scientific impact measures : the generalized Kosmulski-indices. Scientometrics 80 (2009): 819-826.
• V.Deineko,A.Tiskin. Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? ACM Journal on Experimental Algorithmics (2009) (Accepted).
• V.Deineko, A.Tiskin. Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Electronic Notes in Discrete Mathematics (2009) (Published): 19-26.
• Deineko V, B.Klinz and G.J.Woeginger. Polygons with inscribed circles and prescribed side lengths. Applied Mathematics Letters 22 (2009) (Published): 704-706.
• Deineko V, B.Klinz and G.J.Woeginger. The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences 57 (2009) (Published): 282-284.
• Deineko V, P.Jonsson, M.Klasson and A.Krokhin. The approximability of MAX CSP with fixed-value constraints. Journal Of The ACM 55 (2008) (Published): 16-16.
• Deineko V, M.Hoffman, Y.Okamoto and G.J.Woeginger. The traveling salesman problem with few inner points. Operations Research Letters (2006): 106-110.
• Deineko V and G.J.Woeginger. Well-solvable instances for the partition problem. Applied Mathematics Letters 19 (2006): 1053-1056.
• Deineko V, B.Klinz and G.J.Woeginger. Exact algorithms for the Hamiltonian cycle problem in planar graphs. Operations Research Letters 34 (2006): 269-274.
• Deineko V and G.J.Woeginger. On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters 34 (2006): 175-179.
• Deineko V and G.J.Woeginger. On the dimension of simple monotonic games. European Journal Of Operational Research 170 (2006): 315-318.
• Deineko V, G.Steiner and Zhihui Xui. Robotic-Cell Scheduling: Special polynomially solvable case of the traveling salesman problem on permuted Monge matrices. Journal of Combinatorial Optimization (2005): 391-399.
• Deineko V, P.Jonsson, M.Klasson and A.Krokhin. Supermodularity on chains and complexity of maximum constraint satisfaction. Discrete Mathematics and Theoretical Computer Science (2005): 51-56.
• Deineko V and Burkard R. E. On the Euclidean TSP with a permuted Van der Veen matrix. Information Processing Letters 91 (2004): 259-262.
• Deineko V and Woeginger G.J. Complexity and approximability results for slicing floorplan designs. European Journal Of Operational Research 149 (2003): 533-539.
• Deineko V, Klinz B. and Woeginger G.J. Which matrices are immune against the transportation paradox. Discrete Applied Mathematics 23 (2003): 495-501.
• Deineko V and Woeginger G.J. Hardness of approximation of the discrete time-cost tradeoff problem. Operations Research Letters 29 (2001): 207-210.
• Deineko V and Woeginger G.J. A comment on consecutive-2-out-of-n systems. Operations Research Letters 28 (2001): 169-171.
• Deineko V and Woeginger G.J. The maximum travelling salesman problem on symmetric Demidenko matrices. Discrete Applied Mathematics 99 (2000): 413-425.
• Deineko V and Woeginger G.J. A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. Mathematical Programming Series A (2000): 519-542.
• Burkard R.E., Deineko V and Woeginger G.J. The traveling salesman and the PQ-tree. Mathematics Of Operations Research 24 (1999): 262-272.
• Burkard R.E., Deineko V and Woeginger G.J. The travelling salesman problem on permuted Monge matrices. Journal of Combinatorial Optimization 2 (1999).
• Deineko V. The quadratic assignment problem. Journal Of The Operational Research Society 50 (1999): 558-559.
• Burkard R.E., Deineko V, Van Dal R , Van der Veen J A A and Woeginger G.J. Well-Solvable Special Cases of the TSP: A Survey. Siam Review 40 (1998): 496-546.
• Deineko V, Rudolf R and Woeginger G.J. Sometimes Travelling is Easy: The Master Tour Problem. Siam Journal On Discrete Mathematics 11 (1998): 81-93.
• Deineko V and Woeginger G.J. A Solvable Case of the Quadratic Assignment Problem. Operations Research Letters 22 (1998): 13-17.
• Deineko V, Rudolf R , Van der Veen J A A and Woeginger G.J. Three Easy Special Cases of the Euclidean Travelling Salesman Problem. RAIRO - Operations Research 31 (1997): 343-362.
• Deineko V and Woeginger G.J. The Convex-Hull-and-k-Line Travelling Salesman Problem. Information Processing Letters 59 (1996): 295-301.
• Deineko V, Rudolf R and Woeginger G.J. On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Informatica 33 (1996): 559-569.

Non-peer reviewed articles

• Deineko V. New exponential neighborhood for polynomially solvable TSPs. Electronic Notes in Discrete Mathematics (2004): 111-115.

Journal editorships

• B Chen, Czumaj, A, Deineko V and Koster, A. Combinatorial Optimization. Journal of Combinatorial Optimization (2009) (Forthcoming).

Reports to government

• Deineko V and Tiskin A. The double-tree approximation for Metric TSP: Is the best good enough? Technical report (2003).
• Deineko V, Klinz B. , Bettina, Woeginger G.J. and Gerhard J. Which matrices are immune against the transportation paradox? Universität Graz/Technische Universität Graz (2002).

Conference proceedings

• Vladimir Deineko, Frances O'Brien, Thomas Ridd. Group up to Learn Together: A System for Equitable Allocation of Students to Groups. First International Conference on Computer Supported Education. Lisboa, Portugal, 2009.
• Deineko V. International Symposium on Mathematical Programming. Programming Society. Copenhagen, 2003.
• Deineko V. Local search Workshop. OR Society. London, 2002.
• Deineko V. International symposium on combinatorial optimisation. LIP. Paris, 2002.
• Deineko V. UKCRC Algorithms and complexity Day. University of Warwick, 2002.
• Deineko V. International conference on the travelling salesman problem. AT&T. TU Eindhoven, 2002.
• Deineko V. EURO 2001. European Operational Research Society. Netherlands, 2001.
• Deineko V. Combinatorial Optimisation 2000. Combinatorial Optimisation 2000. Greenwich, 2000.
• Deineko V. OR 42. Operational Research Society. Swansea, 2000.
• Deineko V. Semi-intelligent system for generating and marking assinments on linear programming. Intelligent desision support systems. Ukraine, Dnepropetrovsk, n.d.
• Deineko V. On dynamic programming and solvable cases of NP-hard problems. Intellectual desision support systems. Ukraine, n.d.
• Deineko V and A.Tiskin. One-sided TSP is NP-hard. International Conference on Computational Science and its Applications (ICCSA 2006) Glasgow, n.d.
• Deineko V, B.Klinz and G.J.Woeginger. Exponential neighbouhoods and four point conditions for the TSP. ACM/SIAM Symposium on Discrete Algorithms (SODA) Florida, USA, n.d.
• Deineko V and A.Tiskin. Fast minimum-weight shortcutting for Metric TSP. Workshop on Experimental Algorithms, Lecture Notes in Computer Science. Rome, n.d.
• Deineko V, Cela, E and G.J.Woeginger. On x-and-y-axes travelling salewsman problem. International conference on network optimisation. Pisa, Italy, n.d.
• Deineko V, O'Brien F.A. and Ridd, T. Group Up to learn together: A system for equitable allocation of students to groups. International Conference on Computer Supported Education. Lisboa, Portugal, n.d.
• Deineko V and A.Tiskin. Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Algorithmic Graph Theory, 2009. Warwick, n.d.