default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- René van Bevern
Huawei Technologies Co., Ltd.
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 93 matches
- 2024
- 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. J. Comput. Syst. Sci. 139: 103479 (2024) - René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. 28(1): 51-79 (2024) - René van Bevern
, Daniel A. Skachkov
:
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. Oper. Res. Lett. 52: 107065 (2024) - 2023
- Matthias Bentert, René van Bevern
, Till Fluschnik
, André Nichterlein
, Rolf Niedermeier
:
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023) - René van Bevern
, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
On data reduction for dynamic vector bin packing. Oper. Res. Lett. 51(4): 446-452 (2023) - 2022
- Matthias Bentert, René van Bevern
, André Nichterlein
, Rolf Niedermeier
, Pavel V. Smirnov
:
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34(1): 55-75 (2022) - René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
On data reduction for dynamic vector bin packing. CoRR abs/2205.08769 (2022) - René van Bevern, Daniel A. Skachkov:
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. CoRR abs/2207.08678 (2022) - 2021
- René van Bevern
, Oxana Yu. Tsidulko
, Philipp Zschoche:
Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. 298: 110-128 (2021) - René van Bevern, Gregory Kucherov:
Special Issue on Computer Science Symposium in Russia (2019). Theory Comput. Syst. 65(3): 441-443 (2021) - Vsevolod A. Afanasev
, René van Bevern
, Oxana Yu. Tsidulko
:
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. Oper. Res. Lett. 49(2): 270-277 (2021) - 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
- René van Bevern
, Pavel V. Smirnov
:
Optimal-size problem kernels for d-Hitting Set in linear time and space. Inf. Process. Lett. 163: 105998 (2020) - René van Bevern
, Till Fluschnik
, Oxana Yu. Tsidulko
:
Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks 75(1): 34-63 (2020) - René van Bevern
, Till Fluschnik
, Oxana Yu. Tsidulko
:
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76(4): 485-508 (2020) - René van Bevern
, Christian Komusiewicz
, Hendrik Molter
, Rolf Niedermeier
, Manuel Sorge
, Toby Walsh
:
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - René van Bevern, Pavel V. Smirnov:
Optimal-size problem kernels for d-Hitting Set in linear time and space. CoRR abs/2003.04578 (2020) - René van Bevern, Viktoriia A. Slugina:
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. CoRR abs/2004.02437 (2020) - 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) - 2019
- Matthias Bentert, René van Bevern
, Rolf Niedermeier:
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22(1): 3-20 (2019) - René van Bevern, Oxana Yu. Tsidulko
, Philipp Zschoche:
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC 2019: 62-74 - René van Bevern
, Till Fluschnik
, Oxana Yu. Tsidulko
:
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR 2019: 279-294 - René van Bevern, Gregory Kucherov:
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings. Lecture Notes in Computer Science 11532, Springer 2019, ISBN 978-3-030-19954-8 [contents] - Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR abs/1910.00277 (2019) - 2018
- Matthias Mnich
, René van Bevern
:
Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100: 254-261 (2018) - René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
:
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30: 20-50 (2018) - René van Bevern
, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62(3): 739-770 (2018) - René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
:
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS 2018: 10:1-10:19 - René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for safe convoy routing. CoRR abs/1806.09540 (2018) - René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR abs/1806.11527 (2018)
skipping 63 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-04-16 02:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint