Vladimir G. Deineko

71 papers A* 1A 1B 1C 2Misc 2Journal 61Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
The bipartite travelling salesman problem: A pyramidally solvable case.
Oper. Res. Lett.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2024 J jnl
Travelling salesman paths on Demidenko matrices.
Discret. Appl. Math.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023 J jnl
Dynamic multi-period vehicle routing with touting.
Eur. J. Oper. Res.
Merve Keskin, Jürgen Branke, Vladimir G. Deineko, Arne K. Strauss
2023 J jnl
Recognising permuted Demidenko matrices.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023 J jnl
Recognising permuted Demidenko matrices.
Oper. Res. Lett.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2020 J jnl
Travelling salesman paths on Demidenko matrices.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2018 J jnl
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices.
Eur. J. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2017 J jnl
The multi-stripe travelling salesman problem.
Ann. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016 J jnl
A framework for small but rich vehicle routing problems.
CoRR
Vladimir G. Deineko
2016 J jnl
Linearizable special cases of the QAP.
J. Comb. Optim.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016 J jnl
The multi-stripe travelling salesman problem.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2015 C conf
A New Tractable Case of the QAP with a Robinson Matrix.
COCOA
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2015 J jnl
Well-solvable cases of the QAP with block-structured matrices.
Discret. Appl. Math.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2014 Misc conf
Another Look at the Shoelace TSP: The Case of Very Old Shoes.
FUN
Vladimir G. Deineko, Gerhard J. Woeginger
2014 J jnl
Four-point conditions for the TSP: The complete complexity classification.
Discret. Optim.
Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
2014 J jnl
Linearizable special cases of the QAP.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2014 J jnl
Two hardness results for Gamson's game.
Soc. Choice Welf.
Vladimir G. Deineko, Gerhard J. Woeginger
2013 J jnl
Complexity and in-approximability of a selection problem in robust optimization.
4OR
Vladimir G. Deineko, Gerhard J. Woeginger
2013 J jnl
Two hardness results for core stability in hedonic coalition formation games.
Discret. Appl. Math.
Vladimir G. Deineko, Gerhard J. Woeginger
2013 J jnl
Uniqueness in quadratic and hyperbolic 0-1 programming problems.
CoRR
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2013 J jnl
Uniqueness in quadratic and hyperbolic 0-1 programming problems.
Oper. Res. Lett.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2012 J jnl
Another well-solvable case of the QAP: Maximizing the job completion time variance.
Oper. Res. Lett.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2012 J jnl
The x-and-y-axes travelling salesman problem.
Eur. J. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2011 J jnl
A well-solvable special case of the bounded knapsack problem.
Oper. Res. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
2011 J jnl
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices.
J. Heuristics
Vladimir G. Deineko, Dvir Shabtay, George Steiner
2011 J jnl
Unbounded knapsack problems with arithmetic weight sequences.
Eur. J. Oper. Res.
Vladimir G. Deineko, Gerhard J. Woeginger
2010 J jnl
Pinpointing the complexity of the interval min-max regret knapsack problem.
Discret. Optim.
Vladimir G. Deineko, Gerhard J. Woeginger
2009 J jnl
A new family of scientific impact measures: The generalized Kosmulski-indices.
Scientometrics
Vladimir G. Deineko, Gerhard J. Woeginger
2009 J jnl
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
ACM J. Exp. Algorithmics
Vladimir G. Deineko, Alexander Tiskin
2009 — conf
Group up to Learn Together: A System for Equitable Allocation of Students to Groups.
CSEDU (1)
Vladimir G. Deineko, F. O'Brien, T. Ridd
2009 J jnl
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.
Electron. Notes Discret. Math.
Vladimir G. Deineko, Alexander Tiskin
2009 J jnl
Polygons with inscribed circles and prescribed side lengths.
Appl. Math. Lett.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2009 J jnl
The complexity of computing the Muirhead-Dalton distance.
Math. Soc. Sci.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2008 J jnl
The approximability of MAX CSP with fixed-value constraints.
J. ACM
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2007 — conf
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.
WEA
Vladimir G. Deineko, Alexandre Tiskin
2007 J jnl
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
CoRR
Vladimir G. Deineko, Alexandre Tiskin
2007 J jnl
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
CoRR
Vladimir G. Deineko, Alexandre Tiskin
2006 J jnl
Exact algorithms for the Hamiltonian cycle problem in planar graphs.
Oper. Res. Lett.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2006 A* conf
Four point conditions and exponential neighborhoods for symmetric TSP.
SODA
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2006 J jnl
On the dimension of simple monotonic games.
Eur. J. Oper. Res.
Vladimir G. Deineko, Gerhard J. Woeginger
2006 J jnl
On the robust assignment problem under a fixed number of cost scenarios.
Oper. Res. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
2006 — conf
One-Sided Monge TSP Is NP-Hard.
ICCSA (3)
Vladimir G. Deineko, Alexandre Tiskin
2006 J jnl
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins.
Bull. EATCS
Vladimir G. Deineko, Gerhard J. Woeginger
2006 J jnl
The approximability of MAX CSP with fixed-value constraints
CoRR
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2006 J jnl
The traveling salesman problem with few inner points.
Oper. Res. Lett.
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2006 J jnl
Well-solvable instances for the partition problem.
Appl. Math. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
2005 J jnl
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim.
Vladimir G. Deineko, George Steiner, Zhihui Xue
2004 C conf
New Exponential Neighbourhood for Polynomially Solvable TSPs.
CTW
Vladimir G. Deineko
2004 J jnl
New exponential neighbourhood for polynomially solvable TSPs.
Electron. Notes Discret. Math.
Vladimir G. Deineko
2004 J jnl
On the Euclidean TSP with a permuted Van der Veen matrix.
Inf. Process. Lett.
Rainer E. Burkard, Vladimir G. Deineko
2004 Misc conf
The Traveling Salesman Problem with Few Inner Points.
COCOON
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2003 J jnl
Complexity and approximability results for slicing floorplan designs.
Eur. J. Oper. Res.
Vladimir G. Deineko, Gerhard J. Woeginger
2003 J jnl
Which matrices are immune against the transportation paradox?
Discret. Appl. Math.
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2001 J jnl
A comment on consecutive-2-out-of-
Oper. Res. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
2001 J jnl
Hardness of approximation of the discrete time-cost tradeoff problem.
Oper. Res. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
2000 J jnl
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem.
Math. Program.
Vladimir G. Deineko, Gerhard J. Woeginger
2000 J jnl
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices.
Discret. Appl. Math.
Vladimir G. Deineko, Gerhard J. Woeginger
1999 J jnl
Erratum: The Travelling Salesman and the PQ-Tree.
Math. Oper. Res.
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1998 J jnl
A solvable case of the quadratic assignment problem.
Oper. Res. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
1998 J jnl
On the Traveling Salesman Problem with a Relaxed Monge Matrix.
Inf. Process. Lett.
Rainer E. Burkard, Vladimir G. Deineko
1998 J jnl
Sometimes Travelling is Easy: The Master Tour Problem.
SIAM J. Discret. Math.
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1998 J jnl
The Travelling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim.
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1998 J jnl
The Travelling Salesman and the PQ-Tree.
Math. Oper. Res.
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1998 J jnl
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
SIAM Rev.
Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger
1996 J jnl
On the Recognition of Permuted Supnick and Incomplete Monge Matrices.
Acta Informatica
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1996 J jnl
The Convex-Hull-and-k-Line Travelling Salesman Problem.
Inf. Process. Lett.
Vladimir G. Deineko, Gerhard J. Woeginger
1996 B conf
The Travelling Salesman and the PQ-Tree.
IPCO
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1995 J jnl
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood.
Computing
Rainer E. Burkard, Vladimir G. Deineko
1995 A conf
Sometimes Travelling is Easy: The Master Tour Problem.
ESA
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1994 J jnl
A general approach to avoiding two by two submatrices.
Computing
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1994 J jnl
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
Inf. Process. Lett.
Vladimir G. Deineko, René van Dal, Günter Rote