Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: O. Yu. Tsidulko
@article{DBLP:journals/jcss/BevernKSST24,
author = {Ren{\'{e}} van Bevern and
Artem M. Kirilin and
Daniel A. Skachkov and
Pavel V. Smirnov and
Oxana Yu. Tsidulko},
title = {Serial and parallel kernelization of Multiple Hitting Set parameterized
by the Dilworth number, implemented on the {GPU}},
journal = {J. Comput. Syst. Sci.},
volume = {139},
pages = {103479},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2023.103479},
doi = {10.1016/J.JCSS.2023.103479},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BevernKSST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BevernMST23,
author = {Ren{\'{e}} van Bevern and
Andrey Melnikov and
Pavel V. Smirnov and
Oxana Yu. Tsidulko},
title = {On data reduction for dynamic vector bin packing},
journal = {Oper. Res. Lett.},
volume = {51},
number = {4},
pages = {446--452},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.06.005},
doi = {10.1016/J.ORL.2023.06.005},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BevernMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-08769,
author = {Ren{\'{e}} van Bevern and
Andrey Melnikov and
Pavel V. Smirnov and
Oxana Yu. Tsidulko},
title = {On data reduction for dynamic vector bin packing},
journal = {CoRR},
volume = {abs/2205.08769},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.08769},
doi = {10.48550/ARXIV.2205.08769},
eprinttype = {arXiv},
eprint = {2205.08769},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-08769.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BevernTZ21,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
title = {Representative families for matroid intersections, with applications
to location, packing, and covering problems},
journal = {Discret. Appl. Math.},
volume = {298},
pages = {110--128},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.03.014},
doi = {10.1016/J.DAM.2021.03.014},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BevernTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AfanasevBT21,
author = {Vsevolod A. Afanasev and
Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko},
title = {The Hierarchical Chinese Postman Problem: The slightest disorder makes
it hard, yet disconnectedness is manageable},
journal = {Oper. Res. Lett.},
volume = {49},
number = {2},
pages = {270--277},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.01.017},
doi = {10.1016/J.ORL.2021.01.017},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AfanasevBT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06042,
author = {Ren{\'{e}} van Bevern and
Artem M. Kirilin and
Daniel A. Skachkov and
Pavel V. Smirnov and
Oxana Yu. Tsidulko},
title = {Serial and parallel kernelization of Multiple Hitting Set parameterized
by the Dilworth number, implemented on the {GPU}},
journal = {CoRR},
volume = {abs/2109.06042},
year = {2021},
url = {https://arxiv.org/abs/2109.06042},
eprinttype = {arXiv},
eprint = {2109.06042},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BevernFT20,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {Parameterized algorithms and data reduction for the short secluded
s-t-path problem},
journal = {Networks},
volume = {75},
number = {1},
pages = {34--63},
year = {2020},
url = {https://doi.org/10.1002/net.21904},
doi = {10.1002/NET.21904},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BevernFT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BevernFT20a,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {On approximate data reduction for the Rural Postman Problem: Theory
and experiments},
journal = {Networks},
volume = {76},
number = {4},
pages = {485--508},
year = {2020},
url = {https://doi.org/10.1002/net.21985},
doi = {10.1002/NET.21985},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BevernFT20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-04022,
author = {Vsevolod A. Afanasev and
Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko},
title = {The Hierarchical Chinese Postman Problem: the slightest disorder makes
it hard, yet disconnectedness is manageable},
journal = {CoRR},
volume = {abs/2011.04022},
year = {2020},
url = {https://arxiv.org/abs/2011.04022},
eprinttype = {arXiv},
eprint = {2011.04022},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-04022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BevernTZ19,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
editor = {Pinar Heggernes},
title = {Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under
Matroid Constraints},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {62--74},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_6},
doi = {10.1007/978-3-030-17402-6\_6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BevernTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lion/GimadiT19,
author = {Edward Kh. Gimadi and
Oxana Yu. Tsidulko},
editor = {Nikolaos F. Matsatsinis and
Yannis Marinakis and
Panos M. Pardalos},
title = {Asymptotically Optimal Algorithms for the Prize-Collecting Traveling
Salesman Problem on Random Inputs},
booktitle = {Learning and Intelligent Optimization - 13th International Conference,
{LION} 13, Chania, Crete, Greece, May 27-31, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11968},
pages = {201--207},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-38629-0\_16},
doi = {10.1007/978-3-030-38629-0\_16},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lion/GimadiT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/BevernFT19,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
editor = {Michael Yu. Khachay and
Yury Kochetov and
Panos M. Pardalos},
title = {On (1+{\textbackslash}varepsilon {)} -approximate Data Reduction for
the Rural Postman Problem},
booktitle = {Mathematical Optimization Theory and Operations Research - 18th International
Conference, {MOTOR} 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11548},
pages = {279--294},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22629-9\_20},
doi = {10.1007/978-3-030-22629-9\_20},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/motor/BevernFT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aist/GimadiT18,
author = {Edward Kh. Gimadi and
Oxana Yu. Tsidulko},
editor = {Wil M. P. van der Aalst and
Vladimir Batagelj and
Goran Glavas and
Dmitry I. Ignatov and
Michael Yu. Khachay and
Sergei O. Kuznetsov and
Olessia Koltsova and
Irina A. Lomazova and
Natalia V. Loukachevitch and
Amedeo Napoli and
Alexander Panchenko and
Panos M. Pardalos and
Marcello Pelillo and
Andrey V. Savchenko},
title = {On Modification of an Asymptotically Optimal Algorithm for the Maximum
Euclidean Traveling Salesman Problem},
booktitle = {Analysis of Images, Social Networks and Texts - 7th International
Conference, {AIST} 2018, Moscow, Russia, July 5-7, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11179},
pages = {283--293},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-11027-7\_27},
doi = {10.1007/978-3-030-11027-7\_27},
timestamp = {Tue, 15 Jun 2021 13:49:14 +0200},
biburl = {https://dblp.org/rec/conf/aist/GimadiT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/BevernFT18,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
editor = {Ralf Bornd{\"{o}}rfer and
Sabine Storandt},
title = {Parameterized Algorithms and Data Reduction for Safe Convoy Routing},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2018, August 23-24, 2018, Helsinki,
Finland},
series = {OASIcs},
volume = {65},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2018.10},
doi = {10.4230/OASICS.ATMOS.2018.10},
timestamp = {Tue, 15 Feb 2022 09:40:04 +0100},
biburl = {https://dblp.org/rec/conf/atmos/BevernFT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lion/GimadiT18,
author = {Edward Kh. Gimadi and
O. Yu. Tsidulko},
editor = {Roberto Battiti and
Mauro Brunato and
Ilias S. Kotsireas and
Panos M. Pardalos},
title = {Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman
Problem in a Normed Space},
booktitle = {Learning and Intelligent Optimization - 12th International Conference,
{LION} 12, Kalamata, Greece, June 10-15, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11353},
pages = {402--410},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-05348-2\_33},
doi = {10.1007/978-3-030-05348-2\_33},
timestamp = {Tue, 12 May 2020 10:56:04 +0200},
biburl = {https://dblp.org/rec/conf/lion/GimadiT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09540,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {Parameterized algorithms and data reduction for safe convoy routing},
journal = {CoRR},
volume = {abs/1806.09540},
year = {2018},
url = {http://arxiv.org/abs/1806.09540},
eprinttype = {arXiv},
eprint = {1806.09540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-11527,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
title = {Facility location under matroid constraints: fixed-parameter algorithms
and applications},
journal = {CoRR},
volume = {abs/1806.11527},
year = {2018},
url = {http://arxiv.org/abs/1806.11527},
eprinttype = {arXiv},
eprint = {1806.11527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-11527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-10131,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {On (1+{\(\epsilon\)})-approximate problem kernels for the Rural Postman
Problem},
journal = {CoRR},
volume = {abs/1812.10131},
year = {2018},
url = {http://arxiv.org/abs/1812.10131},
eprinttype = {arXiv},
eprint = {1812.10131},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-10131.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aist/GimadiT17,
author = {Edward Kh. Gimadi and
Oxana Yu. Tsidulko},
editor = {Wil M. P. van der Aalst and
Dmitry I. Ignatov and
Michael Yu. Khachay and
Sergei O. Kuznetsov and
Victor S. Lempitsky and
Irina A. Lomazova and
Natalia V. Loukachevitch and
Amedeo Napoli and
Alexander Panchenko and
Panos M. Pardalos and
Andrey V. Savchenko and
Stanley Wasserman},
title = {Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem},
booktitle = {Analysis of Images, Social Networks and Texts - 6th International
Conference, {AIST} 2017, Moscow, Russia, July 27-29, 2017, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10716},
pages = {304--312},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73013-4\_28},
doi = {10.1007/978-3-319-73013-4\_28},
timestamp = {Tue, 15 Jun 2021 13:49:14 +0200},
biburl = {https://dblp.org/rec/conf/aist/GimadiT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/door/GimadiIT16,
author = {Edward Kh. Gimadi and
Alexey M. Istomin and
Oxana Yu. Tsidulko},
editor = {Yury Kochetov and
Michael Yu. Khachay and
Vladimir L. Beresnev and
Evgeni A. Nurminski and
Panos M. Pardalos},
title = {On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem
on Random Inputs},
booktitle = {Discrete Optimization and Operations Research - 9th International
Conference, {DOOR} 2016, Vladivostok, Russia, September 19-23, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9869},
pages = {136--147},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44914-2\_11},
doi = {10.1007/978-3-319-44914-2\_11},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/door/GimadiIT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GimadiGSTZ15,
author = {Eduard Kh. Gimadi and
Alexei N. Glebov and
A. A. Skretneva and
O. Yu. Tsidulko and
D. Zh. Zambalaeva},
title = {Combinatorial algorithms with performance guarantees for finding several
Hamiltonian circuits in a complete directed weighted graph},
journal = {Discret. Appl. Math.},
volume = {196},
pages = {54--61},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.03.007},
doi = {10.1016/J.DAM.2015.03.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GimadiGSTZ15.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-25 05: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:
