René van Bevern
Cited by
Cited by
Interval scheduling and colorful independent sets
R Van Bevern, M Mnich, R Niedermeier, M Weller
Journal of Scheduling 18 (5), 449-469, 2015
Parameterized algorithmics for finding connected motifs in biological networks
N Betzler, R van Bevern, MR Fellows, C Komusiewicz, R Niedermeier
Computational Biology and Bioinformatics, IEEE/ACM Transactions on 8 (5 …, 2011
Parameterized complexity of machine scheduling: 15 open problems
M Mnich, R van Bevern
Computers & Operations Research, 2018
Chapter 2: The Complexity of Arc Routing Problems
R van Bevern, R Niedermeier, M Sorge, M Weller
Arc Routing: Problems, Methods, and Applications, 19-52, 2015
Approximation and tidying—a problem kernel for s-plex cluster vertex deletion
R van Bevern, H Moser, R Niedermeier
Algorithmica 62 (3-4), 930-950, 2012
Towards optimal and expressive kernelization for d-hitting set
R Van Bevern
Algorithmica 70 (1), 129-147, 2014
A new view on Rural Postman based on Eulerian Extension and Matching
M Sorge, R Van Bevern, R Niedermeier, M Weller
Journal of Discrete Algorithms 16, 12-33, 2012
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
R van Bevern, C Komusiewicz, M Sorge
Networks 70 (3), 262-278, 2017
Precedence-constrained scheduling problems parameterized by partial order width
R van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ...
Discrete Optimization and Operations Research, 105–120, 2016
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
R van Bevern, VA Slugina
Historia Mathematica 53, 118-127, 2020
Measuring indifference: Unit interval vertex deletion
R van Bevern, C Komusiewicz, H Moser, R Niedermeier
Graph Theoretic Concepts in Computer Science, 232-243, 2010
From few components to an Eulerian graph by adding arcs
M Sorge, R Bevern, R Niedermeier, M Weller
International Workshop on Graph-Theoretic Concepts in Computer Science, 307-318, 2011
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
R van Bevern, R Niedermeier, O Suchý
Journal of Scheduling 20 (3), 255–265, 2017
On the parameterized complexity of computing balanced partitions in graphs
R Van Bevern, AE Feldmann, M Sorge, O Suchý
Theory of Computing Systems 57 (1), 1-35, 2015
H-index manipulation by merging articles: Models, theory, and experiments
R Van Bevern, C Komusiewicz, R Niedermeier, M Sorge, T Walsh
Artificial Intelligence 240, 19-35, 2016
Exploiting hidden structure in selecting dimensions that distinguish vectors
V Froese, R van Bevern, R Niedermeier, M Sorge
Journal of Computer and System Sciences 82 (3), 521-535, 2016
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
R van Bevern, AV Pyatkin, SV Sevast'yanov
Сибирские электронные математические известия 16 (0), 42-84, 2019
Parameterizing edge modification problems above lower bounds
R van Bevern, V Froese, C Komusiewicz
Theory of Computing Systems 62 (3), 739-770, 2018
Partitioning perfect graphs into stars
R Van Bevern, R Bredereck, L Bulteau, J Chen, V Froese, R Niedermeier, ...
Journal of Graph Theory 85 (2), 297-335, 2017
Network-based vertex dissolution
R Van Bevern, R Bredereck, J Chen, V Froese, R Niedermeier, ...
SIAM Journal on Discrete Mathematics 29 (2), 888-914, 2015
The system can't perform the operation now. Try again later.
Articles 1–20