default search action
O. Yu. Tsidulko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]René van Bevern
, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. J. Comput. Syst. Sci. 139: 103479 (2024) - 2023
- [j6]René van Bevern
On data reduction for dynamic vector bin packing. Oper. Res. Lett. 51(4): 446-452 (2023) - 2022
- [i6]René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
On data reduction for dynamic vector bin packing. CoRR abs/2205.08769 (2022) - 2021
- [j5]René van Bevern
Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. 298: 110-128 (2021) - [j4]Vsevolod A. Afanasev
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. Oper. Res. Lett. 49(2): 270-277 (2021) - [i5]René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. CoRR abs/2109.06042 (2021) - 2020
- [j3]René van Bevern
Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks 75(1): 34-63 (2020) - [j2]René van Bevern
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76(4): 485-508 (2020) - [i4]Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko:
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable. CoRR abs/2011.04022 (2020)
2010 – 2019
- 2019
- [c8]René van Bevern, Oxana Yu. Tsidulko
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC 2019: 62-74 - [c7]Edward Kh. Gimadi
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. LION 2019: 201-207 - [c6]René van Bevern
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR 2019: 279-294 - 2018
- [c5]Edward Kh. Gimadi
On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. AIST 2018: 283-293 - [c4]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS 2018: 10:1-10:19 - [c3]Edward Kh. Gimadi
Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space. LION 2018: 402-410 - [i3]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for safe convoy routing. CoRR abs/1806.09540 (2018) - [i2]René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR abs/1806.11527 (2018) - [i1]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR abs/1812.10131 (2018) - 2017
- [c2]Edward Kh. Gimadi
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. AIST 2017: 304-312 - 2016
- [c1]Edward Kh. Gimadi
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. DOOR 2016: 136-147 - 2015
- [j1]Eduard Kh. Gimadi
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. Discret. Appl. Math. 196: 54-61 (2015)
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-04-24 22:58 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: