default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené van Bevern
Person information
- affiliation: Huawei Technologies Co., Ltd.
- affiliation (former): Novosibirsk State University, Rusia
SPARQL queries 
🛈 Please note that only 64% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j33]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)- [j32]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) - [j31]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
- [j30]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) - [j29]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
- [j28]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) - [i33]René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
On data reduction for dynamic vector bin packing. CoRR abs/2205.08769 (2022) - [i32]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
- [j27]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) - [j26]René van Bevern, Gregory Kucherov:
Special Issue on Computer Science Symposium in Russia (2019). Theory Comput. Syst. 65(3): 441-443 (2021) - [j25]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) - [i31]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
- [j24]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) - [j23]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) - [j22]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) - [j21]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) - [i30]René van Bevern, Pavel V. Smirnov:
Optimal-size problem kernels for d-Hitting Set in linear time and space. CoRR abs/2003.04578 (2020) - [i29]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) - [i28]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
- [j20]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) - [c25]René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC 2019: 62-74 - [c24]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR 2019: 279-294 - [e1]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] - [i27]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
- [j19]Matthias Mnich, René van Bevern:
Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100: 254-261 (2018) - [j18]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) - [j17]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62(3): 739-770 (2018) - [c23]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS 2018: 10:1-10:19 - [i26]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for safe convoy routing. CoRR abs/1806.09540 (2018) - [i25]René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR abs/1806.11527 (2018) - [i24]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR abs/1812.10131 (2018) - 2017
- [j16]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - [j15]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j14]René van Bevern, Christian Komusiewicz, Manuel Sorge:
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70(3): 262-278 (2017) - [j13]René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Sched. 20(3): 255-265 (2017) - [c22]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS 2017: 26-40 - [i23]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR abs/1706.03177 (2017) - [i22]Matthias Mnich, René van Bevern:
Parameterized complexity of machine scheduling: 15 open problems. CoRR abs/1709.01670 (2017) - [i21]Matthias Bentert, René van Bevern, Rolf Niedermeier:
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR abs/1712.06481 (2017) - 2016
- [j12]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240: 19-35 (2016) - [j11]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82(3): 521-535 (2016) - [c21]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. CSR 2016: 57-72 - [c20]René van Bevern, Artem V. Pyatkin:
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. CSR 2016: 73-87 - [c19]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - [c18]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c17]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c16]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [i20]René van Bevern, Artem V. Pyatkin:
Completing partial schedules for Open Shop with unit processing times and routing. CoRR abs/1603.01191 (2016) - [i19]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i18]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - [i17]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - [i16]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2015
- [j10]René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015) - [j9]René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - [j8]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. 57(1): 1-35 (2015) - [j7]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. J. Sched. 18(5): 449-469 (2015) - [j6]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [c15]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS 2015: 130-143 - [c14]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015: 808-814 - [i15]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR abs/1506.05620 (2015) - [i14]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i13]René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. CoRR abs/1508.01657 (2015) - [i12]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - [i11]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR abs/1512.01150 (2015) - [i10]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing edge modification problems above lower bounds. CoRR abs/1512.04047 (2015) - 2014
- [b1]René van Bevern:
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications. Berlin Institute of Technology, Univ.-Verlag der TU 2014, ISBN 978-3-7983-2705-4, pp. 1-205 - [j5]René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. Algorithmica 70(1): 129-147 (2014) - [j4]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42(4): 290-292 (2014) - [c13]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c12]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [i9]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. CoRR abs/1402.0851 (2014) - [i8]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i7]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i6]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR abs/1404.3660 (2014) - [i5]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
On Google Scholar H-Index Manipulation by Merging Articles. CoRR abs/1412.5498 (2014) - 2013
- [c11]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c10]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382 - [c9]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS 2013: 445-456 - [c8]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - [i4]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR abs/1312.7014 (2013) - 2012
- [j3]René van Bevern, Hannes Moser, Rolf Niedermeier:
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62(3-4): 930-950 (2012) - [j2]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16: 12-33 (2012) - [c7]René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. COCOON 2012: 121-132 - [c6]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256 - [i3]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding. CoRR abs/1211.1299 (2012) - 2011
- [j1]Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1296-1308 (2011) - [c5]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 - [c4]René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011: 194-206 - [c3]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318 - [i2]René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. CoRR abs/1112.2310 (2011) - 2010
- [c2]René van Bevern, Hannes Moser, Rolf Niedermeier:
Kernelization through Tidying. LATIN 2010: 527-538 - [c1]René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243
2000 – 2009
- 2009
- [i1]René van Bevern:
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion. CoRR abs/0909.2814 (2009)
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-11-27 20:27 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:
