A general approach to avoiding two by two submatrices. - Vladimir G. Deineko; Rüdiger Rudolf; Gerhard J. Woeginger (Computing, 1994)

The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. - Vladimir G. Deineko; René van Dal; Günter Rote (Inf. Process. Lett., 1994)

Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. - Rainer E. Burkard; Vladimir G. Deineko (Computing, 1995)

On the Recognition of Permuted Supnick and Incomplete Monge Matrices. - Vladimir G. Deineko; Rüdiger Rudolf; Gerhard J. Woeginger (Acta Informatica, 1996)

The Convex-Hull-and-k-Line Travelling Salesman Problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Inf. Process. Lett., 1996)

On the Traveling Salesman Problem with a Relaxed Monge Matrix. - Rainer E. Burkard; Vladimir G. Deineko (Inf. Process. Lett., 1998)

The Travelling Salesman Problem on Permuted Monge Matrices. - Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger (J. Comb. Optim., 1998)

The Travelling Salesman and the PQ-Tree. - Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger (Math. Oper. Res., 1998)

A solvable case of the quadratic assignment problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 1998)

Sometimes Travelling is Easy: The Master Tour Problem. - Vladimir G. Deineko; Rüdiger Rudolf; Gerhard J. Woeginger (SIAM J. Discret. Math., 1998)

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. - Rainer E. Burkard; Vladimir G. Deineko; René van Dal; Jack A. A. van der Veen; Gerhard J. Woeginger (SIAM Rev., 1998)

Erratum: The Travelling Salesman and the PQ-Tree. - Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger (Math. Oper. Res., 1999)

The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. - Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2000)

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Math. Program., 2000)

Hardness of approximation of the discrete time-cost tradeoff problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2001)

A comment on consecutive-2-out-of-n systems. - Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2001)

Which matrices are immune against the transportation paradox? - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Discret. Appl. Math., 2003)

Complexity and approximability results for slicing floorplan designs. - Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2003)

New exponential neighbourhood for polynomially solvable TSPs. - Vladimir G. Deineko (Electron. Notes Discret. Math., 2004)

On the Euclidean TSP with a permuted Van der Veen matrix. - Rainer E. Burkard; Vladimir G. Deineko (Inf. Process. Lett., 2004)

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. - Vladimir G. Deineko; George Steiner; Zhihui Xue (J. Comb. Optim., 2005)

One-Sided Monge TSP Is NP-Hard. - Vladimir G. Deineko; Alexandre Tiskin (ICCSA (3), 2006)

Four point conditions and exponential neighborhoods for symmetric TSP. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (SODA, 2006)

Well-solvable instances for the partition problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Appl. Math. Lett., 2006)

Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. - Vladimir G. Deineko; Gerhard J. Woeginger (Bull. EATCS, 2006)

On the dimension of simple monotonic games. - Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2006)

The traveling salesman problem with few inner points. - Vladimir G. Deineko; Michael Hoffmann 001; Yoshio Okamoto; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

Exact algorithms for the Hamiltonian cycle problem in planar graphs. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

On the robust assignment problem under a fixed number of cost scenarios. - Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. - Vladimir G. Deineko; Alexandre Tiskin (WEA, 2007)

Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio - Vladimir G. Deineko; Alexandre Tiskin (CoRR, 2007)

The approximability of MAX CSP with fixed-value constraints. - Vladimir G. Deineko; Peter Jonsson; Mikael Klasson; Andrei A. Krokhin (J. ACM, 2008)

Group up to Learn Together: A System for Equitable Allocation of Students to Groups. - Vladimir G. Deineko; F. O'Brien; T. Ridd (CSEDU (1), 2009)

Polygons with inscribed circles and prescribed side lengths. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Appl. Math. Lett., 2009)

Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. - Vladimir G. Deineko; Alexander Tiskin (Electron. Notes Discret. Math., 2009)

Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? - Vladimir G. Deineko; Alexander Tiskin (ACM J. Exp. Algorithmics, 2009)

The complexity of computing the Muirhead-Dalton distance. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Math. Soc. Sci., 2009)

A new family of scientific impact measures: The generalized Kosmulski-indices. - Vladimir G. Deineko; Gerhard J. Woeginger (Scientometrics, 2009)

Pinpointing the complexity of the interval min-max regret knapsack problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Optim., 2010)

Unbounded knapsack problems with arithmetic weight sequences. - Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2011)

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. - Vladimir G. Deineko; Dvir Shabtay; George Steiner (J. Heuristics, 2011)

A well-solvable special case of the bounded knapsack problem. - Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2011)

The x-and-y-axes travelling salesman problem. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2012)

Another well-solvable case of the QAP: Maximizing the job completion time variance. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2012)

Complexity and in-approximability of a selection problem in robust optimization. - Vladimir G. Deineko; Gerhard J. Woeginger (4OR, 2013)

Two hardness results for core stability in hedonic coalition formation games. - Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2013)

Uniqueness in quadratic and hyperbolic 0-1 programming problems. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2013)

Another Look at the Shoelace TSP: The Case of Very Old Shoes. - Vladimir G. Deineko; Gerhard J. Woeginger (FUN, 2014)

Four-point conditions for the TSP: The complete complexity classification. - Vladimir G. Deineko; Bettina Klinz; Alexander Tiskin; Gerhard J. Woeginger (Discret. Optim., 2014)

Two hardness results for Gamson's game. - Vladimir G. Deineko; Gerhard J. Woeginger (Soc. Choice Welf., 2014)

A New Tractable Case of the QAP with a Robinson Matrix. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (COCOA, 2015)

Well-solvable cases of the QAP with block-structured matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2015)

A framework for small but rich vehicle routing problems. - Vladimir G. Deineko (CoRR, 2016)

Linearizable special cases of the QAP. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (J. Comb. Optim., 2016)

The multi-stripe travelling salesman problem. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Ann. Oper. Res., 2017)

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Eur. J. Oper. Res., 2018)

Dynamic multi-period vehicle routing with touting. - Merve Keskin; Jürgen Branke; Vladimir G. Deineko; Arne K. Strauss (Eur. J. Oper. Res., 2023)

Recognising permuted Demidenko matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Oper. Res. Lett., 2023)

Travelling salesman paths on Demidenko matrices. - Eranda Çela; Vladimir G. Deineko; Gerhard J. Woeginger (Discret. Appl. Math., 2024)

The bipartite travelling salesman problem: A pyramidally solvable case. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2024)