Fluschnik, Till; Niedermeier, Rolf; Schubert, Carsten; Zschoche, Philipp Multistage \(s-t\) path: confronting similarity with dissimilarity. (English) Zbl 07704068 Algorithmica 85, No. 7, 2028-2064 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Fluschnik} et al., Algorithmica 85, No. 7, 2028--2064 (2023; Zbl 07704068) Full Text: DOI arXiv
Luo, Junjie; Molter, Hendrik; Nichterlein, André; Niedermeier, Rolf Parameterized dynamic cluster editing. (English) Zbl 1508.68268 Algorithmica 83, No. 1, 1-44 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{J. Luo} et al., Algorithmica 83, No. 1, 1--44 (2021; Zbl 1508.68268) Full Text: DOI arXiv
Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf The power of linear-time data reduction for maximum matching. (English) Zbl 1492.68108 Algorithmica 82, No. 12, 3521-3565 (2020). MSC: 68R10 05C70 68Q27 68W40 PDFBibTeX XMLCite \textit{G. B. Mertzios} et al., Algorithmica 82, No. 12, 3521--3565 (2020; Zbl 1492.68108) Full Text: DOI arXiv
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod When can graph hyperbolicity be computed in linear time? (English) Zbl 1439.68016 Algorithmica 81, No. 5, 2016-2045 (2019). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., Algorithmica 81, No. 5, 2016--2045 (2019; Zbl 1439.68016) Full Text: DOI Link
Bredereck, Robert; Froese, Vincent; Koseler, Marcel; Garlet Millani, Marcelo; Nichterlein, André; Niedermeier, Rolf A parameterized algorithmics framework for degree sequence completion problems in directed graphs. (English) Zbl 1421.68108 Algorithmica 81, No. 4, 1584-1614 (2019). MSC: 68R10 05C20 68Q25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Algorithmica 81, No. 4, 1584--1614 (2019; Zbl 1421.68108) Full Text: DOI Link
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese Using patterns to form homogeneous teams. (English) Zbl 1322.90074 Algorithmica 71, No. 2, 517-538 (2015). MSC: 90C27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Algorithmica 71, No. 2, 517--538 (2015; Zbl 1322.90074) Full Text: DOI
Betzler, Nadja; Bodlaender, Hans L.; Bredereck, Robert; Niedermeier, Rolf; Uhlmann, Johannes On making a distinguished vertex of minimum degree by vertex deletion. (English) Zbl 1360.68492 Algorithmica 68, No. 3, 715-738 (2014). MSC: 68Q25 05C85 68Q17 PDFBibTeX XMLCite \textit{N. Betzler} et al., Algorithmica 68, No. 3, 715--738 (2014; Zbl 1360.68492) Full Text: DOI
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej The parameterized complexity of local search for TSP, more refined. (English) Zbl 1292.68086 Algorithmica 67, No. 1, 89-110 (2013). MSC: 68Q17 90C27 68R10 05C38 90C59 PDFBibTeX XMLCite \textit{J. Guo} et al., Algorithmica 67, No. 1, 89--110 (2013; Zbl 1292.68086) Full Text: DOI
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
Guo, Jiong; Niedermeier, Rolf; Raible, Daniel Improved algorithms and complexity results for power domination in graphs. (English) Zbl 1170.68031 Algorithmica 52, No. 2, 177-202 (2008). MSC: 68R10 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{J. Guo} et al., Algorithmica 52, No. 2, 177--202 (2008; Zbl 1170.68031) Full Text: DOI
Dom, Michael; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf Error compensation in leaf power problems. (English) Zbl 1095.68080 Algorithmica 44, No. 4, 363-381 (2006). MSC: 68R10 68Q17 68Q25 05C85 PDFBibTeX XMLCite \textit{M. Dom} et al., Algorithmica 44, No. 4, 363--381 (2006; Zbl 1095.68080) Full Text: DOI
Gramm, Jens; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf Automated generation of search tree algorithms for hard graphs modification problems. (English) Zbl 1090.68027 Algorithmica 39, No. 4, 321-347 (2004). MSC: 68P10 68W05 68R10 PDFBibTeX XMLCite \textit{J. Gramm} et al., Algorithmica 39, No. 4, 321--347 (2004; Zbl 1090.68027) Full Text: DOI
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter Fixed-parameter algorithms for CLOSEST STRING and related problems. (English) Zbl 1058.68119 Algorithmica 37, No. 1, 25-42 (2003). MSC: 68W05 PDFBibTeX XMLCite \textit{J. Gramm} et al., Algorithmica 37, No. 1, 25--42 (2003; Zbl 1058.68119) Full Text: DOI
Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R. Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. (English) Zbl 1016.68055 Algorithmica 33, No. 4, 461-493 (2002). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{J. Alber} et al., Algorithmica 33, No. 4, 461--493 (2002; Zbl 1016.68055) Full Text: DOI
Kunde, M.; Niedermeier, R.; Reinhardt, K.; Rossmanith, P. Optimal deterministic sorting and routing on grids and tori with diagonals. (English) Zbl 0937.68036 Algorithmica 25, No. 4, 438-458 (1999). MSC: 68P10 68W05 PDFBibTeX XMLCite \textit{M. Kunde} et al., Algorithmica 25, No. 4, 438--458 (1999; Zbl 0937.68036) Full Text: DOI