| Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015 | 70 | 2015 |
| Parameterized complexity of machine scheduling: 15 open problems M Mnich, R van Bevern Computers & Operations Research, 2018 | 69 | 2018 |
| 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 | 66 | 2011 |
| 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 | 48* | 2012 |
| 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 | 47 | 2020 |
| 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 | 46 | 2015 |
| Towards optimal and expressive kernelization for d-hitting set R Van Bevern Algorithmica 70 (1), 129-147, 2014 | 42 | 2014 |
| 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 | 38* | 2017 |
| 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 | 38 | 2012 |
| 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 | 37 | 2016 |
| 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 | 32* | 2015 |
| From few components to an Eulerian graph by adding arcs M Sorge, R Van Bevern, R Niedermeier, M Weller Graph-Theoretic Concepts in Computer Science: 37th International Workshop …, 2011 | 31 | 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 | 30 | 2017 |
| Measuring indifference: Unit interval vertex deletion R van Bevern, C Komusiewicz, H Moser, R Niedermeier Graph Theoretic Concepts in Computer Science, 232-243, 2010 | 29 | 2010 |
| 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 | 25* | 2017 |
| 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 | 23 | 2016 |
| On approximate data reduction for the Rural Postman Problem: Theory and experiments R van Bevern, T Fluschnik, OY Tsidulko Networks 76 (4), 485–508, 2020 | 22* | 2020 |
| Parameterizing edge modification problems above lower bounds R van Bevern, V Froese, C Komusiewicz Theory of Computing Systems 62 (3), 739-770, 2018 | 22 | 2018 |
| Representative families for matroid intersections, with applications to location, packing, and covering problems R van Bevern, OY Tsidulko, P Zschoche Discrete Applied Mathematics 298, 110-128, 2021 | 21* | 2021 |
| Parameterized algorithms and data reduction for the short secluded s‐t‐path problem R Van Bevern, T Fluschnik, OY Tsidulko Networks 75 (1), 34-63, 2020 | 21* | 2020 |
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
