Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Vladimir G. Deineko
@article{DBLP:journals/eor/KeskinBDS23,
author = {Merve Keskin and
J{\"{u}}rgen Branke and
Vladimir G. Deineko and
Arne K. Strauss},
title = {Dynamic multi-period vehicle routing with touting},
journal = {Eur. J. Oper. Res.},
volume = {310},
number = {1},
pages = {168--184},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.02.037},
doi = {10.1016/J.EJOR.2023.02.037},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/KeskinBDS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CelaDW23,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Recognising permuted Demidenko matrices},
journal = {Oper. Res. Lett.},
volume = {51},
number = {5},
pages = {494--500},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.07.008},
doi = {10.1016/J.ORL.2023.07.008},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CelaDW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-05191,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Recognising permuted Demidenko matrices},
journal = {CoRR},
volume = {abs/2302.05191},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.05191},
doi = {10.48550/ARXIV.2302.05191},
eprinttype = {arXiv},
eprint = {2302.05191},
timestamp = {Mon, 13 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-05191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14746,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Travelling salesman paths on Demidenko matrices},
journal = {CoRR},
volume = {abs/2009.14746},
year = {2020},
url = {https://arxiv.org/abs/2009.14746},
eprinttype = {arXiv},
eprint = {2009.14746},
timestamp = {Wed, 07 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-14746.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CelaDW18,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {New special cases of the Quadratic Assignment Problem with diagonally
structured coefficient matrices},
journal = {Eur. J. Oper. Res.},
volume = {267},
number = {3},
pages = {818--834},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.12.024},
doi = {10.1016/J.EJOR.2017.12.024},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/CelaDW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/CelaDW17,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The multi-stripe travelling salesman problem},
journal = {Ann. Oper. Res.},
volume = {259},
number = {1-2},
pages = {21--34},
year = {2017},
url = {https://doi.org/10.1007/s10479-017-2513-4},
doi = {10.1007/S10479-017-2513-4},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/CelaDW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CelaDW16,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Linearizable special cases of the {QAP}},
journal = {J. Comb. Optim.},
volume = {31},
number = {3},
pages = {1269--1279},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9821-2},
doi = {10.1007/S10878-014-9821-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CelaDW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CelaDW16,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The multi-stripe travelling salesman problem},
journal = {CoRR},
volume = {abs/1609.09796},
year = {2016},
url = {http://arxiv.org/abs/1609.09796},
eprinttype = {arXiv},
eprint = {1609.09796},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CelaDW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Deineko16,
author = {Vladimir G. Deineko},
title = {A framework for small but rich vehicle routing problems},
journal = {CoRR},
volume = {abs/1610.01876},
year = {2016},
url = {http://arxiv.org/abs/1610.01876},
eprinttype = {arXiv},
eprint = {1610.01876},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Deineko16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CelaDW15,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Well-solvable cases of the {QAP} with block-structured matrices},
journal = {Discret. Appl. Math.},
volume = {186},
pages = {56--65},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.01.005},
doi = {10.1016/J.DAM.2015.01.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CelaDW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/CelaDW15,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
editor = {Zaixin Lu and
Donghyun Kim and
Weili Wu and
Wei Li and
Ding{-}Zhu Du},
title = {A New Tractable Case of the {QAP} with a Robinson Matrix},
booktitle = {Combinatorial Optimization and Applications - 9th International Conference,
{COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9486},
pages = {709--720},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-26626-8\_52},
doi = {10.1007/978-3-319-26626-8\_52},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/CelaDW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DeinekoKTW14,
author = {Vladimir G. Deineko and
Bettina Klinz and
Alexander Tiskin and
Gerhard J. Woeginger},
title = {Four-point conditions for the {TSP:} The complete complexity classification},
journal = {Discret. Optim.},
volume = {14},
pages = {147--159},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2014.09.003},
doi = {10.1016/J.DISOPT.2014.09.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/DeinekoKTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/DeinekoW14,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Two hardness results for Gamson's game},
journal = {Soc. Choice Welf.},
volume = {43},
number = {4},
pages = {963--972},
year = {2014},
url = {https://doi.org/10.1007/s00355-014-0819-6},
doi = {10.1007/S00355-014-0819-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/DeinekoW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/DeinekoW14,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
editor = {Alfredo Ferro and
Fabrizio Luccio and
Peter Widmayer},
title = {Another Look at the Shoelace {TSP:} The Case of Very Old Shoes},
booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
Island, Sicily, Italy, July 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8496},
pages = {125--136},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07890-8\_11},
doi = {10.1007/978-3-319-07890-8\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/DeinekoW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CelaDW14,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Linearizable special cases of the {QAP}},
journal = {CoRR},
volume = {abs/1409.6510},
year = {2014},
url = {http://arxiv.org/abs/1409.6510},
eprinttype = {arXiv},
eprint = {1409.6510},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CelaDW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/DeinekoW13,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Complexity and in-approximability of a selection problem in robust
optimization},
journal = {4OR},
volume = {11},
number = {3},
pages = {249--252},
year = {2013},
url = {https://doi.org/10.1007/s10288-012-0227-7},
doi = {10.1007/S10288-012-0227-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/DeinekoW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DeinekoW13,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Two hardness results for core stability in hedonic coalition formation
games},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1837--1842},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.003},
doi = {10.1016/J.DAM.2013.03.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DeinekoW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoKW13,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Uniqueness in quadratic and hyperbolic 0-1 programming problems},
journal = {Oper. Res. Lett.},
volume = {41},
number = {6},
pages = {633--635},
year = {2013},
url = {https://doi.org/10.1016/j.orl.2013.08.013},
doi = {10.1016/J.ORL.2013.08.013},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DeinekoKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DeinekoKW13,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Uniqueness in quadratic and hyperbolic 0-1 programming problems},
journal = {CoRR},
volume = {abs/1312.0903},
year = {2013},
url = {http://arxiv.org/abs/1312.0903},
eprinttype = {arXiv},
eprint = {1312.0903},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DeinekoKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CelaDW12,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The x-and-y-axes travelling salesman problem},
journal = {Eur. J. Oper. Res.},
volume = {223},
number = {2},
pages = {333--345},
year = {2012},
url = {https://doi.org/10.1016/j.ejor.2012.06.036},
doi = {10.1016/J.EJOR.2012.06.036},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/CelaDW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CelaDW12,
author = {Eranda {\c{C}}ela and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Another well-solvable case of the {QAP:} Maximizing the job completion
time variance},
journal = {Oper. Res. Lett.},
volume = {40},
number = {5},
pages = {356--359},
year = {2012},
url = {https://doi.org/10.1016/j.orl.2012.06.005},
doi = {10.1016/J.ORL.2012.06.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CelaDW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DeinekoW11,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Unbounded knapsack problems with arithmetic weight sequences},
journal = {Eur. J. Oper. Res.},
volume = {213},
number = {2},
pages = {384--387},
year = {2011},
url = {https://doi.org/10.1016/j.ejor.2011.03.028},
doi = {10.1016/J.EJOR.2011.03.028},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DeinekoW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/DeinekoSS11,
author = {Vladimir G. Deineko and
Dvir Shabtay and
George Steiner},
title = {On the asymptotic behavior of subtour-patching heuristics in solving
the {TSP} on permuted Monge matrices},
journal = {J. Heuristics},
volume = {17},
number = {1},
pages = {61--96},
year = {2011},
url = {https://doi.org/10.1007/s10732-010-9127-1},
doi = {10.1007/S10732-010-9127-1},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/DeinekoSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW11,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A well-solvable special case of the bounded knapsack problem},
journal = {Oper. Res. Lett.},
volume = {39},
number = {2},
pages = {118--120},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.01.006},
doi = {10.1016/J.ORL.2011.01.006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DeinekoW10,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Pinpointing the complexity of the interval min-max regret knapsack
problem},
journal = {Discret. Optim.},
volume = {7},
number = {4},
pages = {191--196},
year = {2010},
url = {https://doi.org/10.1016/j.disopt.2010.03.008},
doi = {10.1016/J.DISOPT.2010.03.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/DeinekoW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/DeinekoKW09,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Polygons with inscribed circles and prescribed side lengths},
journal = {Appl. Math. Lett.},
volume = {22},
number = {5},
pages = {704--706},
year = {2009},
url = {https://doi.org/10.1016/j.aml.2008.05.002},
doi = {10.1016/J.AML.2008.05.002},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/appml/DeinekoKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DeinekoT09,
author = {Vladimir G. Deineko and
Alexander Tiskin},
title = {Min-weight double-tree shortcutting for Metric {TSP:} Bounding the
approximation ratio},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {19--26},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.004},
doi = {10.1016/J.ENDM.2009.02.004},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/DeinekoT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DeinekoT09,
author = {Vladimir G. Deineko and
Alexander Tiskin},
title = {Fast minimum-weight double-tree shortcutting for metric {TSP:} Is
the best one good enough?},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594232},
doi = {10.1145/1498698.1594232},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DeinekoT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/DeinekoKW09,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {The complexity of computing the Muirhead-Dalton distance},
journal = {Math. Soc. Sci.},
volume = {57},
number = {2},
pages = {282--284},
year = {2009},
url = {https://doi.org/10.1016/j.mathsocsci.2008.11.005},
doi = {10.1016/J.MATHSOCSCI.2008.11.005},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/DeinekoKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scientometrics/DeinekoW09,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A new family of scientific impact measures: The generalized Kosmulski-indices},
journal = {Scientometrics},
volume = {80},
number = {3},
pages = {819--826},
year = {2009},
url = {https://doi.org/10.1007/s11192-009-2130-0},
doi = {10.1007/S11192-009-2130-0},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scientometrics/DeinekoW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csedu/DeinekoOR09,
author = {Vladimir G. Deineko and
F. O'Brien and
T. Ridd},
editor = {Jos{\'{e}} A. Moinhos Cordeiro and
Boris Shishkov and
Alexander Verbraeck and
Markus Helfert},
title = {Group up to Learn Together: {A} System for Equitable Allocation of
Students to Groups},
booktitle = {{CSEDU} 2009 - Proceedings of the First International Conference on
Computer Supported Education, Lisboa, Portugal, March 23-26, 2009
- Volume 1},
pages = {140--145},
publisher = {{INSTICC} Press},
year = {2009},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csedu/DeinekoOR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DeinekoJKK08,
author = {Vladimir G. Deineko and
Peter Jonsson and
Mikael Klasson and
Andrei A. Krokhin},
title = {The approximability of {MAX} {CSP} with fixed-value constraints},
journal = {J. {ACM}},
volume = {55},
number = {4},
pages = {16:1--16:37},
year = {2008},
url = {https://doi.org/10.1145/1391289.1391290},
doi = {10.1145/1391289.1391290},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DeinekoJKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/DeinekoT07,
author = {Vladimir G. Deineko and
Alexandre Tiskin},
editor = {Camil Demetrescu},
title = {Fast Minimum-Weight Double-Tree Shortcutting for Metric {TSP}},
booktitle = {Experimental Algorithms, 6th International Workshop, {WEA} 2007, Rome,
Italy, June 6-8, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4525},
pages = {136--149},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72845-0\_11},
doi = {10.1007/978-3-540-72845-0\_11},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/DeinekoT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0710-0318,
author = {Vladimir G. Deineko and
Alexandre Tiskin},
title = {Fast minimum-weight double-tree shortcutting for Metric {TSP:} Is
the best one good enough?},
journal = {CoRR},
volume = {abs/0710.0318},
year = {2007},
url = {http://arxiv.org/abs/0710.0318},
eprinttype = {arXiv},
eprint = {0710.0318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0710-0318.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-2399,
author = {Vladimir G. Deineko and
Alexandre Tiskin},
title = {Minimum-weight double-tree shortcutting for Metric {TSP:} Bounding
the approximation ratio},
journal = {CoRR},
volume = {abs/0711.2399},
year = {2007},
url = {http://arxiv.org/abs/0711.2399},
eprinttype = {arXiv},
eprint = {0711.2399},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-2399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/DeinekoW06,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Well-solvable instances for the partition problem},
journal = {Appl. Math. Lett.},
volume = {19},
number = {10},
pages = {1053--1056},
year = {2006},
url = {https://doi.org/10.1016/j.aml.2005.11.016},
doi = {10.1016/J.AML.2005.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/DeinekoW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/DeinekoW06,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins},
journal = {Bull. {EATCS}},
volume = {90},
pages = {43--52},
year = {2006},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/DeinekoW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DeinekoW06,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {On the dimension of simple monotonic games},
journal = {Eur. J. Oper. Res.},
volume = {170},
number = {1},
pages = {315--318},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2004.09.038},
doi = {10.1016/J.EJOR.2004.09.038},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DeinekoW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoHOW06,
author = {Vladimir G. Deineko and
Michael Hoffmann and
Yoshio Okamoto and
Gerhard J. Woeginger},
title = {The traveling salesman problem with few inner points},
journal = {Oper. Res. Lett.},
volume = {34},
number = {1},
pages = {106--110},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.01.002},
doi = {10.1016/J.ORL.2005.01.002},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DeinekoHOW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW06,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {On the robust assignment problem under a fixed number of cost scenarios},
journal = {Oper. Res. Lett.},
volume = {34},
number = {2},
pages = {175--179},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.04.003},
doi = {10.1016/J.ORL.2005.04.003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoKW06,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Exact algorithms for the Hamiltonian cycle problem in planar graphs},
journal = {Oper. Res. Lett.},
volume = {34},
number = {3},
pages = {269--274},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.04.013},
doi = {10.1016/J.ORL.2005.04.013},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DeinekoKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/DeinekoT06,
author = {Vladimir G. Deineko and
Alexandre Tiskin},
editor = {Marina L. Gavrilova and
Osvaldo Gervasi and
Vipin Kumar and
Chih Jeng Kenneth Tan and
David Taniar and
Antonio Lagan{\`{a}} and
Youngsong Mun and
Hyunseung Choo},
title = {One-Sided Monge {TSP} Is NP-Hard},
booktitle = {Computational Science and Its Applications - {ICCSA} 2006, International
Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {3982},
pages = {793--801},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11751595\_84},
doi = {10.1007/11751595\_84},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/DeinekoT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DeinekoKW06,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Four point conditions and exponential neighborhoods for symmetric
{TSP}},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {544--553},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109617},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DeinekoKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0602075,
author = {Vladimir G. Deineko and
Peter Jonsson and
Mikael Klasson and
Andrei A. Krokhin},
title = {The approximability of {MAX} {CSP} with fixed-value constraints},
journal = {CoRR},
volume = {abs/cs/0602075},
year = {2006},
url = {http://arxiv.org/abs/cs/0602075},
eprinttype = {arXiv},
eprint = {cs/0602075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0602075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DeinekoSX05,
author = {Vladimir G. Deineko and
George Steiner and
Zhihui Xue},
title = {Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the
Traveling Salesman Problem on Permuted Monge Matrices},
journal = {J. Comb. Optim.},
volume = {9},
number = {4},
pages = {381--399},
year = {2005},
url = {https://doi.org/10.1007/s10878-005-1778-8},
doi = {10.1007/S10878-005-1778-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DeinekoSX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Deineko04,
author = {Vladimir G. Deineko},
title = {New exponential neighbourhood for polynomially solvable TSPs},
journal = {Electron. Notes Discret. Math.},
volume = {17},
pages = {111--115},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.03.015},
doi = {10.1016/J.ENDM.2004.03.015},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Deineko04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BurkardD04,
author = {Rainer E. Burkard and
Vladimir G. Deineko},
title = {On the Euclidean {TSP} with a permuted Van der Veen matrix},
journal = {Inf. Process. Lett.},
volume = {91},
number = {6},
pages = {259--262},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.05.011},
doi = {10.1016/J.IPL.2004.05.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BurkardD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DeinekoHOW04,
author = {Vladimir G. Deineko and
Michael Hoffmann and
Yoshio Okamoto and
Gerhard J. Woeginger},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {The Traveling Salesman Problem with Few Inner Points},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {268--277},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_30},
doi = {10.1007/978-3-540-27798-9\_30},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DeinekoHOW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Deineko04,
author = {Vladimir G. Deineko},
editor = {Leo Liberti and
Francesco Maffioli},
title = {New Exponential Neighbourhood for Polynomially Solvable TSPs},
booktitle = {{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific
Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June
2004},
pages = {100--103},
year = {2004},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/Deineko04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DelnekoKW03,
author = {Vladimir G. Deineko and
Bettina Klinz and
Gerhard J. Woeginger},
title = {Which matrices are immune against the transportation paradox?},
journal = {Discret. Appl. Math.},
volume = {130},
number = {3},
pages = {495--501},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00327-5},
doi = {10.1016/S0166-218X(03)00327-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DelnekoKW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DeinekoW03,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Complexity and approximability results for slicing floorplan designs},
journal = {Eur. J. Oper. Res.},
volume = {149},
number = {3},
pages = {533--539},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00527-1},
doi = {10.1016/S0377-2217(02)00527-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DeinekoW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW01a,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A comment on consecutive-2-out-of-\emph{n} systems},
journal = {Oper. Res. Lett.},
volume = {28},
number = {4},
pages = {169--171},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00067-0},
doi = {10.1016/S0167-6377(01)00067-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW01,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Hardness of approximation of the discrete time-cost tradeoff problem},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {207--210},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00102-X},
doi = {10.1016/S0167-6377(01)00102-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DeinekoW00,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {413--425},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00148-1},
doi = {10.1016/S0166-218X(99)00148-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DeinekoW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DeinekoW00,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A study of exponential neighborhoods for the Travelling Salesman Problem
and for the Quadratic Assignment Problem},
journal = {Math. Program.},
volume = {87},
number = {3},
pages = {519--542},
year = {2000},
url = {https://doi.org/10.1007/s101070050010},
doi = {10.1007/S101070050010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/DeinekoW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BurkardDW99,
author = {Rainer E. Burkard and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Erratum: The Travelling Salesman and the PQ-Tree},
journal = {Math. Oper. Res.},
volume = {24},
number = {1},
pages = {262--272},
year = {1999},
url = {https://doi.org/10.1287/moor.24.1.262},
doi = {10.1287/MOOR.24.1.262},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BurkardDW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BurkardD98,
author = {Rainer E. Burkard and
Vladimir G. Deineko},
title = {On the Traveling Salesman Problem with a Relaxed Monge Matrix},
journal = {Inf. Process. Lett.},
volume = {67},
number = {5},
pages = {231--237},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00119-7},
doi = {10.1016/S0020-0190(98)00119-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BurkardD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BurkardDW98,
author = {Rainer E. Burkard and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The Travelling Salesman Problem on Permuted Monge Matrices},
journal = {J. Comb. Optim.},
volume = {2},
number = {4},
pages = {333--350},
year = {1998},
url = {https://doi.org/10.1023/A:1009768317347},
doi = {10.1023/A:1009768317347},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BurkardDW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BurkardDW98,
author = {Rainer E. Burkard and
Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The Travelling Salesman and the PQ-Tree},
journal = {Math. Oper. Res.},
volume = {23},
number = {3},
pages = {613--623},
year = {1998},
url = {https://doi.org/10.1287/moor.23.3.613},
doi = {10.1287/MOOR.23.3.613},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BurkardDW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW98,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A solvable case of the quadratic assignment problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {13--17},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00047-3},
doi = {10.1016/S0167-6377(97)00047-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DeuinekoRW98,
author = {Vladimir G. Deineko and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {Sometimes Travelling is Easy: The Master Tour Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {81--93},
year = {1998},
url = {https://doi.org/10.1137/S0895480195281878},
doi = {10.1137/S0895480195281878},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DeuinekoRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/BurkardDDVW98,
author = {Rainer E. Burkard and
Vladimir G. Deineko and
Ren{\'{e}} van Dal and
Jack A. A. van der Veen and
Gerhard J. Woeginger},
title = {Well-Solvable Special Cases of the Traveling Salesman Problem: {A}
Survey},
journal = {{SIAM} Rev.},
volume = {40},
number = {3},
pages = {496--546},
year = {1998},
url = {https://doi.org/10.1137/S0036144596297514},
doi = {10.1137/S0036144596297514},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/BurkardDDVW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/DeinekoRW96,
author = {Vladimir G. Deineko and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {On the Recognition of Permuted Supnick and Incomplete Monge Matrices},
journal = {Acta Informatica},
volume = {33},
number = {6},
pages = {559--569},
year = {1996},
url = {https://doi.org/10.1007/BF03036463},
doi = {10.1007/BF03036463},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/DeinekoRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeinekoW96,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {The Convex-Hull-and-k-Line Travelling Salesman Problem},
journal = {Inf. Process. Lett.},
volume = {59},
number = {6},
pages = {295--301},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00125-1},
doi = {10.1016/0020-0190(96)00125-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeinekoW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BurkhardDW96,
author = {Rainer E. Burkard and
Vladimir G. Deineko and
Gerhard J. Woeginger},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {The Travelling Salesman and the PQ-Tree},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {490--504},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_36},
doi = {10.1007/3-540-61310-2\_36},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BurkhardDW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BurkardD95,
author = {Rainer E. Burkard and
Vladimir G. Deineko},
title = {Polynomially Solvable Cases of the Traveling Salesman Problem and
a New Exponential Neighborhood},
journal = {Computing},
volume = {54},
number = {3},
pages = {191--212},
year = {1995},
url = {https://doi.org/10.1007/BF02253612},
doi = {10.1007/BF02253612},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BurkardD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DeinekoRW95,
author = {Vladimir G. Deineko and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
editor = {Paul G. Spirakis},
title = {Sometimes Travelling is Easy: The Master Tour Problem},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {128--141},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_139},
doi = {10.1007/3-540-60313-1\_139},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DeinekoRW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/DeinekoRW94,
author = {Vladimir G. Deineko and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {A general approach to avoiding two by two submatrices},
journal = {Computing},
volume = {52},
number = {4},
pages = {371--388},
year = {1994},
url = {https://doi.org/10.1007/BF02276883},
doi = {10.1007/BF02276883},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/DeinekoRW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeinekoDR94,
author = {Vladimir G. Deineko and
Ren{\'{e}} van Dal and
G{\"{u}}nter Rote},
title = {The Convex-Hull-and-Line Traveling Salesman Problem: {A} Solvable
Case},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {141--148},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00071-9},
doi = {10.1016/0020-0190(94)00071-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeinekoDR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:47 CEST 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:
