Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. (English) Zbl 07704069 Algorithmica 85, No. 7, 2065-2086 (2023). MSC: 68Wxx 05Cxx 05C20 05C85 68Q25 68R05 68W40 97K20 97P20 PDFBibTeX XMLCite \textit{P. Misra} et al., Algorithmica 85, No. 7, 2065--2086 (2023; Zbl 07704069) Full Text: DOI
Madathil, Jayakrishnan; Sharma, Roohani; Zehavi, Meirav A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs. (English) Zbl 1516.68068 Algorithmica 83, No. 6, 1861-1884 (2021). MSC: 68R10 05C20 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{J. Madathil} et al., Algorithmica 83, No. 6, 1861--1884 (2021; Zbl 1516.68068) Full Text: DOI Link
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1433.68164 Algorithmica 82, No. 6, 1616-1639 (2020). MSC: 68Q25 05C20 05C38 05C70 05C85 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 82, No. 6, 1616--1639 (2020; Zbl 1433.68164) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Saurabh, Saket Algorithms and kernels for Feedback Set problems in generalizations of tournaments. (English) Zbl 1350.68126 Algorithmica 76, No. 2, 320-343 (2016). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 76, No. 2, 320--343 (2016; Zbl 1350.68126) Full Text: DOI
Albert, Réka; DasGupta, Bhaskar; Dondi, Riccardo; Sontag, Eduardo Inferring (biological) signal transduction networks via transitive reductions of directed graphs. (English) Zbl 1147.68057 Algorithmica 51, No. 2, 129-159 (2008). MSC: 68R10 05C20 05C85 68W25 92B99 PDFBibTeX XMLCite \textit{R. Albert} et al., Algorithmica 51, No. 2, 129--159 (2008; Zbl 1147.68057) Full Text: DOI
Cai, Mao-cheng; Deng, Xiaotie; Wang, Lusheng Minimum \(k\) arborescences with bandwidth constraints. (English) Zbl 1053.05109 Algorithmica 38, No. 4, 529-537 (2004). MSC: 05C78 05C20 05B35 68R10 90C35 PDFBibTeX XMLCite \textit{M.-c. Cai} et al., Algorithmica 38, No. 4, 529--537 (2004; Zbl 1053.05109) Full Text: DOI
Bertolazzi, P.; Di Battista, G.; Didimo, W. Quasi-upward planarity. (English) Zbl 1009.68186 Algorithmica 32, No. 3, 474-506 (2002). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{P. Bertolazzi} et al., Algorithmica 32, No. 3, 474--506 (2002; Zbl 1009.68186) Full Text: DOI
Bang-Jensen, J.; El Haddad, M.; Manoussakis, Y.; Przytycka, T. M. Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs. (English) Zbl 0864.68049 Algorithmica 17, No. 1, 67-87 (1997). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 17, No. 1, 67--87 (1997; Zbl 0864.68049) Full Text: DOI
McGeoch, C. C. All-pairs shortest paths and the essential subgraph. (English) Zbl 0837.68084 Algorithmica 13, No. 5, 426-441 (1995). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{C. C. McGeoch}, Algorithmica 13, No. 5, 426--441 (1995; Zbl 0837.68084) Full Text: DOI
Ramachandran, Vijaya; Yang, Honghua Finding the closed partition of a planar graph. (English) Zbl 0804.68108 Algorithmica 11, No. 5, 443-468 (1994). MSC: 68R10 68Q25 68Q60 PDFBibTeX XMLCite \textit{V. Ramachandran} and \textit{H. Yang}, Algorithmica 11, No. 5, 443--468 (1994; Zbl 0804.68108) Full Text: DOI