René van Bevern

93 papers A* 1A 2B 9C 6Misc 4Journal 66Unranked 4
YearRankTypeTitle / Venue / Authors
2024 J jnl
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number.
Oper. Res. Lett.
René van Bevern, Daniel A. Skachkov
2024 J jnl
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU.
J. Comput. Syst. Sci.
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2024 J jnl
The role of twins in computing planar supports of hypergraphs.
J. Graph Algorithms Appl.
René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2023 J jnl
On data reduction for dynamic vector bin packing.
Oper. Res. Lett.
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2023 J jnl
Polynomial-time data reduction for weighted problems beyond additive goal functions.
Discret. Appl. Math.
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2022 J jnl
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number.
CoRR
René van Bevern, Daniel A. Skachkov
2022 J jnl
On data reduction for dynamic vector bin packing.
CoRR
René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2022 J jnl
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments.
INFORMS J. Comput.
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
2021 J jnl
Representative families for matroid intersections, with applications to location, packing, and covering problems.
Discret. Appl. Math.
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2021 J jnl
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU.
CoRR
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2021 J jnl
Special Issue on Computer Science Symposium in Russia (2019).
Theory Comput. Syst.
René van Bevern, Gregory Kucherov
2021 J jnl
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable.
Oper. Res. Lett.
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
2020 J jnl
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem.
CoRR
René van Bevern, Viktoriia A. Slugina
2020 J jnl
On approximate data reduction for the Rural Postman Problem: Theory and experiments.
Networks
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020 J jnl
Optimal-size problem kernels for
Inf. Process. Lett.
René van Bevern, Pavel V. Smirnov
2020 J jnl
Optimal-size problem kernels for d-Hitting Set in linear time and space.
CoRR
René van Bevern, Pavel V. Smirnov
2020 J jnl
Parameterized algorithms and data reduction for the short secluded s-t-path problem.
Networks
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020 J jnl
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable.
CoRR
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
2020 J jnl
h-Index manipulation by undoing merges.
Quant. Sci. Stud.
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2019 Misc ed.
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings
CSR
René van Bevern, Gregory Kucherov
2019 C conf
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints.
CIAC
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2019 J jnl
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review.
J. Sched.
Matthias Bentert, René van Bevern, Rolf Niedermeier
2019 — conf
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem.
MOTOR
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2019 J jnl
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.
CoRR
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2018 J jnl
Facility location under matroid constraints: fixed-parameter algorithms and applications.
CoRR
René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2018 J jnl
On (1+ε)-approximate problem kernels for the Rural Postman Problem.
CoRR
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018 C conf
Parameterized Algorithms and Data Reduction for Safe Convoy Routing.
ATMOS
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018 J jnl
Parameterized algorithms and data reduction for safe convoy routing.
CoRR
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018 J jnl
Parameterized complexity of machine scheduling: 15 open problems.
Comput. Oper. Res.
Matthias Mnich, René van Bevern
2018 J jnl
Parameterizing Edge Modification Problems Above Lower Bounds.
Theory Comput. Syst.
René van Bevern, Vincent Froese, Christian Komusiewicz
2018 J jnl
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discret. Optim.
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017 J jnl
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs.
CoRR
Matthias Bentert, René van Bevern, Rolf Niedermeier
2017 J jnl
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.
Networks
René van Bevern, Christian Komusiewicz, Manuel Sorge
2017 J jnl
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
J. Sched.
René van Bevern, Rolf Niedermeier, Ondrej Suchý
2017 J jnl
Fixed-parameter algorithms for DAG Partitioning.
Discret. Appl. Math.
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2017 C conf
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.
ALGOSENSORS
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017 J jnl
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks.
CoRR
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017 J jnl
Parameterized complexity of machine scheduling: 15 open problems.
CoRR
Matthias Mnich, René van Bevern
2017 J jnl
Partitioning Perfect Graphs into Stars.
J. Graph Theory
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2016 Misc conf
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.
CSR
René van Bevern, Artem V. Pyatkin
2016 J jnl
Completing partial schedules for Open Shop with unit processing times and routing.
CoRR
René van Bevern, Artem V. Pyatkin
2016 J jnl
Exploiting hidden structure in selecting dimensions that distinguish vectors.
J. Comput. Syst. Sci.
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2016 B conf
Finding Secluded Places of Special Interest in Graphs.
IPEC
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016 J jnl
Finding Secluded Places of Special Interest in Graphs.
CoRR
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016 J jnl
Fixed-Parameter Algorithms for DAG Partitioning.
CoRR
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2016 J jnl
H-index manipulation by merging articles: Models, theory, and experiments.
Artif. Intell.
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016 Misc conf
Parameterizing Edge Modification Problems Above Lower Bounds.
CSR
René van Bevern, Vincent Froese, Christian Komusiewicz
2016 — conf
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.
DOOR
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016 J jnl
Precedence-constrained scheduling problems parameterized by partial order width.
CoRR
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016 A conf
Twins in Subdivision Drawings of Hypergraphs.
GD
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2016 A conf
h-Index Manipulation by Undoing Merges.
ECAI
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016 J jnl
h-Index Manipulation by Undoing Merges.
CoRR
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015 J jnl
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
CoRR
René van Bevern, Rolf Niedermeier, Ondrej Suchý
2015 J jnl
Approximability and parameterized complexity of multicover by c-intervals.
Inf. Process. Lett.
René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger
2015 C conf
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.
ATMOS
René van Bevern, Christian Komusiewicz, Manuel Sorge
2015 J jnl
Approximation algorithms for mixed, windy, and capacitated arc routing problems.
CoRR
René van Bevern, Christian Komusiewicz, Manuel Sorge
2015 J jnl
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors.
CoRR
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2015 A* conf
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
IJCAI
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015 J jnl
Interval scheduling and colorful independent sets.
J. Sched.
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2015 J jnl
Myhill-Nerode Methods for Hypergraphs.
Algorithmica
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2015 J jnl
Network-Based Vertex Dissolution.
SIAM J. Discret. Math.
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2015 J jnl
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
Theory Comput. Syst.
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2015 J jnl
Parameterizing edge modification problems above lower bounds.
CoRR
René van Bevern, Vincent Froese, Christian Komusiewicz
2015 J jnl
Twins in Subdivision Drawings of Hypergraphs.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015 J jnl
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2014 J jnl
Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
CoRR
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014 J jnl
Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
Oper. Res. Lett.
René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014 — —
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications.
René van Bevern
2014 J jnl
Interval scheduling and colorful independent sets.
CoRR
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2014 — conf
Network-Based Dissolution.
MFCS (2)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014 J jnl
Network-Based Dissolution.
CoRR
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014 J jnl
On Google Scholar H-Index Manipulation by Merging Articles.
CoRR
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2014 — conf
Star Partitions of Perfect Graphs.
ICALP (1)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014 J jnl
Star Partitions of Perfect Graphs.
CoRR
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014 J jnl
Towards Optimal and Expressive Kernelization for d-Hitting Set.
Algorithmica
René van Bevern
2013 B conf
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.
MFCS
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2013 B conf
Myhill-Nerode Methods for Hypergraphs.
ISAAC
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2013 J jnl
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
CoRR
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013 B conf
On the Parameterized Complexity of Computing Graph Bisections.
WG
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013 C conf
Parameterized Complexity of DAG Partitioning.
CIAC
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2012 J jnl
A new view on Rural Postman based on Eulerian Extension and Matching.
J. Discrete Algorithms
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2012 J jnl
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica
René van Bevern, Hannes Moser, Rolf Niedermeier
2012 J jnl
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
CoRR
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012 B conf
Interval Scheduling and Colorful Independent Sets.
ISAAC
René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2012 Misc conf
Towards Optimal and Expressive Kernelization for d-Hitting Set.
COCOON
René van Bevern
2011 C conf
A New View on Rural Postman Based on Eulerian Extension and Matching.
IWOCA
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011 B conf
From Few Components to an Eulerian Graph by Adding Arcs.
WG
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011 B conf
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
IPEC
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
2011 J jnl
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE ACM Trans. Comput. Biol. Bioinform.
Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2011 J jnl
Towards Optimal and Expressive Kernelization for d-Hitting Set
CoRR
René van Bevern
2010 B conf
Kernelization through Tidying.
LATIN
René van Bevern, Hannes Moser, Rolf Niedermeier
2010 B conf
Measuring Indifference: Unit Interval Vertex Deletion.
WG
René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2009 J jnl
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion
CoRR
René van Bevern