Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion - René van Bevern (CoRR, 2009)

Kernelization through Tidying. - René van Bevern; Hannes Moser; Rolf Niedermeier (LATIN, 2010)

Measuring Indifference: Unit Interval Vertex Deletion. - René van Bevern; Christian Komusiewicz; Hannes Moser; Rolf Niedermeier (WG, 2010)

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. - René van Bevern; Sepp Hartung; Frank Kammer; Rolf Niedermeier; Mathias Weller (IPEC, 2011)

From Few Components to an Eulerian Graph by Adding Arcs. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (WG, 2011)

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. - Nadja Betzler; René van Bevern; Michael R. Fellows; Christian Komusiewicz; Rolf Niedermeier (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. - René van Bevern; Hannes Moser; Rolf Niedermeier (Algorithmica, 2012)

How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding - René van Bevern; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (CoRR, 2012)

A new view on Rural Postman based on Eulerian Extension and Matching. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (J. Discrete Algorithms, 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

Myhill-Nerode Methods for Hypergraphs. - René van Bevern; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (ISAAC, 2013)

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. - Vincent Froese; René van Bevern; Rolf Niedermeier; Manuel Sorge (MFCS, 2013)

On the Parameterized Complexity of Computing Graph Bisections. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (WG, 2013)

Star Partitions of Perfect Graphs. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (ICALP (1), 2014)

Network-Based Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (MFCS (2), 2014)

Towards Optimal and Expressive Kernelization for d-Hitting Set. - René van Bevern (Algorithmica, 2014)

On Google Scholar H-Index Manipulation by Merging Articles. - René van Bevern; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Toby Walsh (CoRR, 2014)

Constant-factor approximations for Capacitated Arc Routing without triangle inequality. - René van Bevern; Sepp Hartung; André Nichterlein; Manuel Sorge (Oper. Res. Lett., 2014)

Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications. - René van Bevern (Univ.-Verlag der TU, 2014)

Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. - René van Bevern; Christian Komusiewicz; Manuel Sorge (ATMOS, 2015)

Myhill-Nerode Methods for Hypergraphs. - René van Bevern; Rodney G. Downey; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (Algorithmica, 2015)

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (CoRR, 2015)

Approximability and parameterized complexity of multicover by c-intervals. - René van Bevern; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch; Nimrod Talmon; Gerhard J. Woeginger (Inf. Process. Lett., 2015)

On the Parameterized Complexity of Computing Balanced Partitions in Graphs. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2015)

Interval scheduling and colorful independent sets. - René van Bevern; Matthias Mnich; Rolf Niedermeier; Mathias Weller (J. Sched., 2015)

Network-Based Vertex Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (SIAM J. Discret. Math., 2015)

Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. - René van Bevern; Artem V. Pyatkin (CSR, 2016)

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. - René van Bevern; Robert Bredereck; Laurent Bulteau; Christian Komusiewicz; Nimrod Talmon; Gerhard J. Woeginger (DOOR, 2016)

Twins in Subdivision Drawings of Hypergraphs. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (GD, 2016)

Finding Secluded Places of Special Interest in Graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (IPEC, 2016)

H-index manipulation by merging articles: Models, theory, and experiments. - René van Bevern; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Toby Walsh (Artif. Intell., 2016)

Exploiting hidden structure in selecting dimensions that distinguish vectors. - Vincent Froese; René van Bevern; Rolf Niedermeier; Manuel Sorge (J. Comput. Syst. Sci., 2016)

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. - Matthias Bentert; René van Bevern; André Nichterlein; Rolf Niedermeier (ALGOSENSORS, 2017)

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. - Matthias Bentert; René van Bevern; Rolf Niedermeier (CoRR, 2017)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

Partitioning Perfect Graphs into Stars. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (J. Graph Theory, 2017)

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. - René van Bevern; Christian Komusiewicz; Manuel Sorge (Networks, 2017)

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. - René van Bevern; Rolf Niedermeier; Ondrej Suchý 001 (J. Sched., 2017)

Parameterized Algorithms and Data Reduction for Safe Convoy Routing. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (ATMOS, 2018)

Parameterized complexity of machine scheduling: 15 open problems. - Matthias Mnich; René van Bevern (Comput. Oper. Res., 2018)

Facility location under matroid constraints: fixed-parameter algorithms and applications. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CoRR, 2018)

On (1+ε)-approximate problem kernels for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (CoRR, 2018)

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Discret. Optim., 2018)

Parameterizing Edge Modification Problems Above Lower Bounds. - René van Bevern; Vincent Froese; Christian Komusiewicz (Theory Comput. Syst., 2018)

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (CIAC, 2019)

On (1+ varepsilon ) -approximate Data Reduction for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (MOTOR, 2019)

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (CoRR, 2019)

Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. - Matthias Bentert; René van Bevern; Rolf Niedermeier (J. Sched., 2019)

Optimal-size problem kernels for d-Hitting Set in linear time and space. - René van Bevern; Pavel V. Smirnov (CoRR, 2020)

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. - René van Bevern; Viktoriia A. Slugina (CoRR, 2020)

Optimal-size problem kernels for d-Hitting Set in linear time and space. - René van Bevern; Pavel V. Smirnov (Inf. Process. Lett., 2020)

Parameterized algorithms and data reduction for the short secluded s-t-path problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

On approximate data reduction for the Rural Postman Problem: Theory and experiments. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

h-Index manipulation by undoing merges. - René van Bevern; Christian Komusiewicz; Hendrik Molter; Rolf Niedermeier; Manuel Sorge; Toby Walsh (Quant. Sci. Stud., 2020)

Representative families for matroid intersections, with applications to location, packing, and covering problems. - René van Bevern; Oxana Yu. Tsidulko; Philipp Zschoche (Discret. Appl. Math., 2021)

Special Issue on Computer Science Symposium in Russia (2019). - René van Bevern; Gregory Kucherov (Theory Comput. Syst., 2021)

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. - Vsevolod A. Afanasev; René van Bevern; Oxana Yu. Tsidulko (Oper. Res. Lett., 2021)

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. - Matthias Bentert; René van Bevern; André Nichterlein; Rolf Niedermeier; Pavel V. Smirnov (INFORMS J. Comput., 2022)

Polynomial-time data reduction for weighted problems beyond additive goal functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (Discret. Appl. Math., 2023)

On data reduction for dynamic vector bin packing. - René van Bevern; Andrey Melnikov; Pavel V. Smirnov; Oxana Yu. Tsidulko (Oper. Res. Lett., 2023)

The role of twins in computing planar supports of hypergraphs. - René van Bevern; Iyad Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (J. Graph Algorithms Appl., 2024)

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. - René van Bevern; Daniel A. Skachkov (Oper. Res. Lett., 2024)

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. - René van Bevern; Artem M. Kirilin; Daniel A. Skachkov; Pavel V. Smirnov; Oxana Yu. Tsidulko (J. Comput. Syst. Sci., 2024)