default search action
Vladimir G. Deineko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j52]Eranda Çela
, Vladimir G. Deineko, Gerhard J. Woeginger
Travelling salesman paths on Demidenko matrices. Discret. Appl. Math. 354: 3-14 (2024) - [j51]Vladimir G. Deineko, Bettina Klinz
The bipartite travelling salesman problem: A pyramidally solvable case. Oper. Res. Lett. 55: 107130 (2024) - 2023
- [j50]Merve Keskin
Dynamic multi-period vehicle routing with touting. Eur. J. Oper. Res. 310(1): 168-184 (2023) - [j49]Eranda Çela
Recognising permuted Demidenko matrices. Oper. Res. Lett. 51(5): 494-500 (2023) - [i9]Eranda Çela
Recognising permuted Demidenko matrices. CoRR abs/2302.05191 (2023) - 2020
- [i8]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Travelling salesman paths on Demidenko matrices. CoRR abs/2009.14746 (2020)
2010 – 2019
- 2018
- [j48]Eranda Çela
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur. J. Oper. Res. 267(3): 818-834 (2018) - 2017
- [j47]Eranda Çela
The multi-stripe travelling salesman problem. Ann. Oper. Res. 259(1-2): 21-34 (2017) - 2016
- [j46]Eranda Çela
Linearizable special cases of the QAP. J. Comb. Optim. 31(3): 1269-1279 (2016) - [i7]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
The multi-stripe travelling salesman problem. CoRR abs/1609.09796 (2016) - [i6]Vladimir G. Deineko:
A framework for small but rich vehicle routing problems. CoRR abs/1610.01876 (2016) - 2015
- [j45]Eranda Çela
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186: 56-65 (2015) - [c10]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
A New Tractable Case of the QAP with a Robinson Matrix. COCOA 2015: 709-720 - 2014
- [j44]Vladimir G. Deineko
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14: 147-159 (2014) - [j43]Vladimir G. Deineko, Gerhard J. Woeginger:
Two hardness results for Gamson's game. Soc. Choice Welf. 43(4): 963-972 (2014) - [c9]Vladimir G. Deineko, Gerhard J. Woeginger:
Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN 2014: 125-136 - [i5]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Linearizable special cases of the QAP. CoRR abs/1409.6510 (2014) - 2013
- [j42]Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and in-approximability of a selection problem in robust optimization. 4OR 11(3): 249-252 (2013) - [j41]Vladimir G. Deineko, Gerhard J. Woeginger:
Two hardness results for core stability in hedonic coalition formation games. Discret. Appl. Math. 161(13-14): 1837-1842 (2013) - [j40]Vladimir G. Deineko, Bettina Klinz
Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. 41(6): 633-635 (2013) - [i4]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR abs/1312.0903 (2013) - 2012
- [j39]Eranda Çela
The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. 223(2): 333-345 (2012) - [j38]Eranda Çela
Another well-solvable case of the QAP: Maximizing the job completion time variance. Oper. Res. Lett. 40(5): 356-359 (2012) - 2011
- [j37]Vladimir G. Deineko, Gerhard J. Woeginger:
Unbounded knapsack problems with arithmetic weight sequences. Eur. J. Oper. Res. 213(2): 384-387 (2011) - [j36]Vladimir G. Deineko, Dvir Shabtay
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17(1): 61-96 (2011) - [j35]Vladimir G. Deineko, Gerhard J. Woeginger:
A well-solvable special case of the bounded knapsack problem. Oper. Res. Lett. 39(2): 118-120 (2011) - 2010
- [j34]Vladimir G. Deineko, Gerhard J. Woeginger:
Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7(4): 191-196 (2010)
2000 – 2009
- 2009
- [j33]Vladimir G. Deineko, Bettina Klinz
Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009) - [j32]Vladimir G. Deineko, Alexander Tiskin
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Electron. Notes Discret. Math. 32: 19-26 (2009) - [j31]Vladimir G. Deineko, Alexander Tiskin:
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? ACM J. Exp. Algorithmics 14 (2009) - [j30]Vladimir G. Deineko, Bettina Klinz
The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. 57(2): 282-284 (2009) - [j29]Vladimir G. Deineko, Gerhard J. Woeginger:
A new family of scientific impact measures: The generalized Kosmulski-indices. Scientometrics 80(3): 819-826 (2009) - [c8]Vladimir G. Deineko, F. O'Brien, T. Ridd:
Group up to Learn Together: A System for Equitable Allocation of Students to Groups. CSEDU (1) 2009: 140-145 - 2008
- [j28]Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
The approximability of MAX CSP with fixed-value constraints. J. ACM 55(4): 16:1-16:37 (2008) - 2007
- [c7]Vladimir G. Deineko, Alexandre Tiskin
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. WEA 2007: 136-149 - [i3]Vladimir G. Deineko, Alexandre Tiskin:
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? CoRR abs/0710.0318 (2007) - [i2]Vladimir G. Deineko, Alexandre Tiskin:
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. CoRR abs/0711.2399 (2007) - 2006
- [j27]Vladimir G. Deineko, Gerhard J. Woeginger:
Well-solvable instances for the partition problem. Appl. Math. Lett. 19(10): 1053-1056 (2006) - [j26]Vladimir G. Deineko, Gerhard J. Woeginger:
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. Bull. EATCS 90: 43-52 (2006) - [j25]Vladimir G. Deineko, Gerhard J. Woeginger:
On the dimension of simple monotonic games. Eur. J. Oper. Res. 170(1): 315-318 (2006) - [j24]Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto
The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006) - [j23]Vladimir 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) - [j22]Vladimir G. Deineko, Bettina Klinz
Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34(3): 269-274 (2006) - [c6]Vladimir G. Deineko, Alexandre Tiskin
One-Sided Monge TSP Is NP-Hard. ICCSA (3) 2006: 793-801 - [c5]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553 - [i1]Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin:
The approximability of MAX CSP with fixed-value constraints. CoRR abs/cs/0602075 (2006) - 2005
- [j21]Vladimir 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
- [j20]Vladimir G. Deineko:
New exponential neighbourhood for polynomially solvable TSPs. Electron. Notes Discret. Math. 17: 111-115 (2004) - [j19]Rainer E. Burkard, Vladimir G. Deineko:
On the Euclidean TSP with a permuted Van der Veen matrix. Inf. Process. Lett. 91(6): 259-262 (2004) - [c4]Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger:
The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277 - [c3]Vladimir G. Deineko:
New Exponential Neighbourhood for Polynomially Solvable TSPs. CTW 2004: 100-103 - 2003
- [j18]Vladimir G. Deineko, Bettina Klinz
Which matrices are immune against the transportation paradox? Discret. Appl. Math. 130(3): 495-501 (2003) - [j17]Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and approximability results for slicing floorplan designs. Eur. J. Oper. Res. 149(3): 533-539 (2003) - 2001
- [j16]Vladimir G. Deineko, Gerhard J. Woeginger:
A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001) - [j15]Vladimir G. Deineko, Gerhard J. Woeginger:
Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001) - 2000
- [j14]Vladimir G. Deineko, Gerhard J. Woeginger:
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discret. Appl. Math. 99(1-3): 413-425 (2000) - [j13]Vladimir G. Deineko, Gerhard J. Woeginger:
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. Math. Program. 87(3): 519-542 (2000)
1990 – 1999
- 1999
- [j12]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 24(1): 262-272 (1999) - 1998
- [j11]Rainer E. Burkard, Vladimir G. Deineko:
On the Traveling Salesman Problem with a Relaxed Monge Matrix. Inf. Process. Lett. 67(5): 231-237 (1998) - [j10]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) - [j9]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 23(3): 613-623 (1998) - [j8]Vladimir G. Deineko, Gerhard J. Woeginger:
A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998) - [j7]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discret. Math. 11(1): 81-93 (1998) - [j6]Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger:
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. 40(3): 496-546 (1998) - 1996
- [j5]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Informatica 33(6): 559-569 (1996) - [j4]Vladimir G. Deineko, Gerhard J. Woeginger:
The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59(6): 295-301 (1996) - [c2]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504 - 1995
- [j3]Rainer E. Burkard, Vladimir G. Deineko:
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54(3): 191-212 (1995) - [c1]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
Sometimes Travelling is Easy: The Master Tour Problem. ESA 1995: 128-141 - 1994
- [j2]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
A general approach to avoiding two by two submatrices. Computing 52(4): 371-388 (1994) - [j1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: