dblp.uni-trier.dewww.uni-trier.de

Vladimir G. Deineko

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
33EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009)
32EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences 57(2): 282-284 (2009)
2008
31EEVladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin: The approximability of MAX CSP with fixed-value constraints. J. ACM 55(4): (2008)
2007
30EEVladimir G. Deineko, Alexandre Tiskin: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149
29EEVladimir G. Deineko, Alexandre Tiskin: Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? CoRR abs/0710.0318: (2007)
28EEVladimir G. Deineko, Alexandre Tiskin: Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio CoRR abs/0711.2399: (2007)
2006
27EEVladimir G. Deineko, Alexandre Tiskin: One-Sided Monge TSP Is NP-Hard. ICCSA (3) 2006: 793-801
26EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553
25EEVladimir G. Deineko, Gerhard J. Woeginger: Well-solvable instances for the partition problem. Appl. Math. Lett. 19(10): 1053-1056 (2006)
24EEVladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin: The approximability of MAX CSP with fixed-value constraints CoRR abs/cs/0602075: (2006)
23EEVladimir G. Deineko, Gerhard J. Woeginger: On the dimension of simple monotonic games. European Journal of Operational Research 170(1): 315-318 (2006)
22EEVladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006)
21EEVladimir G. Deineko, Gerhard J. Woeginger: On the robust assignment problem under a fixed number of cost scenarios. Oper. Res. Lett. 34(2): 175-179 (2006)
20EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34(3): 269-274 (2006)
2005
19EEVladimir G. Deineko, George Steiner, Zhihui Xue: Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 9(4): 381-399 (2005)
2004
18EEVladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
17EEVladimir G. Deineko: New exponential neighbourhood for polynomially solvable TSPs. Electronic Notes in Discrete Mathematics 17: 111-115 (2004)
16EERainer E. Burkard, Vladimir G. Deineko: On the Euclidean TSP with a permuted Van der Veen matrix. Inf. Process. Lett. 91(6): 259-262 (2004)
2003
15EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Which matrices are immune against the transportation paradox? Discrete Applied Mathematics 130(3): 495-501 (2003)
14EEVladimir G. Deineko, Gerhard J. Woeginger: Complexity and approximability results for slicing floorplan designs. European Journal of Operational Research 149(3): 533-539 (2003)
2001
13EEVladimir G. Deineko, Gerhard J. Woeginger: A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001)
12EEVladimir G. Deineko, Gerhard J. Woeginger: Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001)
2000
11EEVladimir G. Deineko, Gerhard J. Woeginger: The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discrete Applied Mathematics 99(1-3): 413-425 (2000)
1998
10EERainer E. Burkard, Vladimir G. Deineko: On the Traveling Salesman Problem with a Relaxed Monge Matrix. Inf. Process. Lett. 67(5): 231-237 (1998)
9 Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 2(4): 333-350 (1998)
8EEVladimir G. Deineko, Gerhard J. Woeginger: A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998)
7EEVladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discrete Math. 11(1): 81-93 (1998)
1996
6 Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504
5 Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Inf. 33(6): 559-569 (1996)
4EEVladimir G. Deineko, Gerhard J. Woeginger: The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59(6): 295-301 (1996)
1995
3 Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: Sometimes Travelling is Easy: The Master Tour Problem. ESA 1995: 128-141
2EERainer E. Burkard, Vladimir G. Deineko: Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54(3): 191-212 (1995)
1994
1 Vladimir G. Deineko, René van Dal, Günter Rote: The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. Inf. Process. Lett. 51(3): 141-148 (1994)

Coauthor Index

1Rainer E. Burkard [2] [6] [9] [10] [16]
2René van Dal [1]
3Michael Hoffmann [18] [22]
4Peter Jonsson [24] [31]
5Mikael Klasson [24] [31]
6Bettina Klinz [15] [20] [26] [32] [33]
7Andrei A. Krokhin [24] [31]
8Yoshio Okamoto [18] [22]
9Günter Rote [1]
10Rüdiger Rudolf [3] [5] [7]
11George Steiner [19]
12Alexander Tiskin (Alexandre Tiskin) [27] [28] [29] [30]
13Gerhard J. Woeginger [3] [4] [5] [6] [7] [8] [9] [11] [12] [13] [14] [15] [18] [20] [21] [22] [23] [25] [26] [32] [33]
14Zhihui Xue [19]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)