Bentert, Matthias; van Bevern, René; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf Polynomial-time data reduction for weighted problems beyond additive goal functions. (English) Zbl 1512.90250 Discrete Appl. Math. 328, 117-133 (2023). MSC: 90C60 90B06 90B35 PDFBibTeX XMLCite \textit{M. Bentert} et al., Discrete Appl. Math. 328, 117--133 (2023; Zbl 1512.90250) Full Text: DOI arXiv
van Bevern, René; Fluschnik, Till; Tsidulko, Oxana Yu. Parameterized algorithms and data reduction for the short secluded \(s\)-\(t\)-path problem. (English) Zbl 07764301 Networks 75, No. 1, 34-63 (2020). MSC: 68Q27 05C38 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Networks 75, No. 1, 34--63 (2020; Zbl 07764301) Full Text: DOI arXiv
van Bevern, René; Smirnov, Pavel V. Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space. (English) Zbl 1462.68085 Inf. Process. Lett. 163, Article ID 105998, 8 p. (2020). MSC: 68Q27 68Q17 90C27 PDFBibTeX XMLCite \textit{R. van Bevern} and \textit{P. V. Smirnov}, Inf. Process. Lett. 163, Article ID 105998, 8 p. (2020; Zbl 1462.68085) Full Text: DOI arXiv
Bentert, Matthias; van Bevern, René; Niedermeier, Rolf Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review. (English) Zbl 1425.90039 J. Sched. 22, No. 1, 3-20 (2019). MSC: 90B35 68M20 90C35 05C15 PDFBibTeX XMLCite \textit{M. Bentert} et al., J. Sched. 22, No. 1, 3--20 (2019; Zbl 1425.90039) Full Text: DOI arXiv
van Bevern, René; Froese, Vincent; Komusiewicz, Christian Parameterizing edge modification problems above lower bounds. (English) Zbl 1386.68075 Theory Comput. Syst. 62, No. 3, 739-770 (2018). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Theory Comput. Syst. 62, No. 3, 739--770 (2018; Zbl 1386.68075) Full Text: DOI arXiv
van Bevern, René; Froese, Vincent; Komusiewicz, Christian Parameterizing edge modification problems above lower bounds. (English) Zbl 1386.68074 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 57-72 (2016). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Lect. Notes Comput. Sci. 9691, 57--72 (2016; Zbl 1386.68074) Full Text: DOI arXiv
van Bevern, René; Downey, Rodney G.; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A. Myhill-Nerode methods for hypergraphs. (English) Zbl 1335.68098 Algorithmica 73, No. 4, 696-729 (2015). MSC: 68Q17 05C65 05C85 68Q45 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Algorithmica 73, No. 4, 696--729 (2015; Zbl 1335.68098) Full Text: DOI arXiv
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej On the parameterized complexity of computing balanced partitions in graphs. (English) Zbl 1329.68150 Theory Comput. Syst. 57, No. 1, 1-35 (2015). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Theory Comput. Syst. 57, No. 1, 1--35 (2015; Zbl 1329.68150) Full Text: DOI arXiv
van Bevern, René; Chen, Jiehua; Hüffner, Falk; Kratsch, Stefan; Talmon, Nimrod; Woeginger, Gerhard J. Approximability and parameterized complexity of multicover by \(c\)-intervals. (English) Zbl 1329.68149 Inf. Process. Lett. 115, No. 10, 744-749 (2015). MSC: 68Q25 68Q17 68W25 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Inf. Process. Lett. 115, No. 10, 744--749 (2015; Zbl 1329.68149) Full Text: DOI
van Bevern, René; Bredereck, Robert; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Network-based vertex dissolution. (English) Zbl 1327.68139 SIAM J. Discrete Math. 29, No. 2, 888-914 (2015). MSC: 68Q25 05C21 05C90 68Q17 90B10 91F10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., SIAM J. Discrete Math. 29, No. 2, 888--914 (2015; Zbl 1327.68139) Full Text: DOI arXiv
van Bevern, René; Hartung, Sepp; Nichterlein, André; Sorge, Manuel Constant-factor approximations for capacitated arc routing without triangle inequality. (English) Zbl 1408.90044 Oper. Res. Lett. 42, No. 4, 290-292 (2014). MSC: 90B06 90C35 90C60 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Oper. Res. Lett. 42, No. 4, 290--292 (2014; Zbl 1408.90044) Full Text: DOI arXiv
van Bevern, René; Moser, Hannes; Niedermeier, Rolf Approximation and tidying – a problem kernel for \(s\)-plex cluster vertex deletion. (English) Zbl 1236.68100 Algorithmica 62, No. 3-4, 930-950 (2012). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Algorithmica 62, No. 3--4, 930--950 (2012; Zbl 1236.68100) Full Text: DOI