René van Bevern

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 50

Top Venues

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

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 (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 (2024)
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
On data reduction for dynamic vector bin packing. Oper. Res. Lett. 51 (4) (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 (2023)
René van Bevern, Daniel A. Skachkov
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. CoRR (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) (2022)
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
On data reduction for dynamic vector bin packing. CoRR (2022)
René van Bevern, Gregory Kucherov
Special Issue on Computer Science Symposium in Russia (2019). Theory Comput. Syst. 65 (3) (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 (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) (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 (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. CoRR (2020)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76 (4) (2020)
René van Bevern, Pavel V. Smirnov
-Hitting Set in linear time and space. Inf. Process. Lett. 163 (2020)
René van Bevern, Pavel V. Smirnov
Optimal-size problem kernels for d-Hitting Set in linear time and space. CoRR (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) (2020)
René van Bevern, Viktoriia A. Slugina
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. CoRR (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) (2020)
Matthias Bentert, René van Bevern, Rolf Niedermeier
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22 (1) (2019)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR (2019)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC (2019)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR (2019)
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 (2018)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62 (3) (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS (2018)
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized algorithms and data reduction for safe convoy routing. CoRR (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR (2018)
Matthias Mnich, René van Bevern
Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100 (2018)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR (2017)
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) (2017)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS (2017)
Matthias Bentert, René van Bevern, Rolf Niedermeier
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR (2017)
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 (2017)
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) (2017)
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) (2017)
Matthias Mnich, René van Bevern
Parameterized complexity of machine scheduling: 15 open problems. CoRR (2017)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index Manipulation by Undoing Merges. ECAI (2016)
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)
René van Bevern, Artem V. Pyatkin
Completing partial schedules for Open Shop with unit processing times and routing. CoRR (2016)
René van Bevern, Artem V. Pyatkin
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. CSR (2016)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-Parameter Algorithms for DAG Partitioning. CoRR (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-constrained scheduling problems parameterized by partial order width. CoRR (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. CoRR (2016)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Twins in Subdivision Drawings of Hypergraphs. Graph Drawing (2016)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82 (3) (2016)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing Edge Modification Problems Above Lower Bounds. CSR (2016)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index Manipulation by Undoing Merges. CoRR (2016)
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240 (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. IPEC (2016)
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI (2015)
René van Bevern, Vincent Froese, Christian Komusiewicz
Parameterizing edge modification problems above lower bounds. CoRR (2015)
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) (2015)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR (2015)
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 (2015)
René van Bevern, Christian Komusiewicz, Manuel Sorge
Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR (2015)
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73 (4) (2015)
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) (2015)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR (2015)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Twins in Subdivision Drawings of Hypergraphs. CoRR (2015)
René van Bevern, Christian Komusiewicz, Manuel Sorge
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS (2015)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29 (2) (2015)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval scheduling and colorful independent sets. J. Sched. 18 (5) (2015)
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
On Google Scholar H-Index Manipulation by Merging Articles. CoRR (2014)
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42 (4) (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. MFCS (2) (2014)
René van Bevern
Towards Optimal and Expressive Kernelization for d-Hitting Set. Algorithmica 70 (1) (2014)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval scheduling and colorful independent sets. CoRR (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. ICALP (1) (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. CoRR (2014)
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR (2014)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Parameterized Complexity of DAG Partitioning. CIAC (2013)
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
Myhill-Nerode Methods for Hypergraphs. ISAAC (2013)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS (2013)
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
On the Parameterized Complexity of Computing Graph Bisections. WG (2013)
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR (2013)
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 (2012)
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
Interval Scheduling and Colorful Independent Sets. ISAAC (2012)
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 (2012)
René van Bevern, Hannes Moser, Rolf Niedermeier
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62 (3-4) (2012)
René van Bevern
Towards Optimal and Expressive Kernelization for d-Hitting Set. COCOON (2012)
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)
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
From Few Components to an Eulerian Graph by Adding Arcs. WG (2011)
René van Bevern
Towards Optimal and Expressive Kernelization for d-Hitting Set CoRR (2011)
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) (2011)
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA (2011)
René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Measuring Indifference: Unit Interval Vertex Deletion. WG (2010)
René van Bevern, Hannes Moser, Rolf Niedermeier
Kernelization through Tidying. LATIN (2010)
René van Bevern
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion CoRR (2009)

René van Bevern.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

René van Bevern