Altmanová, Kateřina; Kolman, Petr; Voborník, Jan On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow. (English) Zbl 1447.05192 J. Graph Algorithms Appl. 24, No. 3, 303-322 (2020). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Altmanová} et al., J. Graph Algorithms Appl. 24, No. 3, 303--322 (2020; Zbl 1447.05192) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Fujito, Toshihiro; Kimura, Kei; Mizuno, Yuki Approximating partially bounded degree deletion on directed graphs. (English) Zbl 1427.05096 J. Graph Algorithms Appl. 23, No. 5, 759-780 (2019). MSC: 05C20 05C07 05C85 05C35 68Q17 68W25 PDFBibTeX XMLCite \textit{T. Fujito} et al., J. Graph Algorithms Appl. 23, No. 5, 759--780 (2019; Zbl 1427.05096) Full Text: DOI
Kolman, Petr On algorithms employing treewidth for \(L\)-bounded cut problems. (English) Zbl 1384.05147 J. Graph Algorithms Appl. 22, No. 2, 177-191 (2018). MSC: 05C85 05C10 68Q25 68W25 PDFBibTeX XMLCite \textit{P. Kolman}, J. Graph Algorithms Appl. 22, No. 2, 177--191 (2018; Zbl 1384.05147) Full Text: DOI arXiv