Iwata, Satoru; Yokoi, Yu Finding maximum edge-disjoint paths between multiple terminals. (English) Zbl 1522.90160 SIAM J. Comput. 52, No. 5, 1230-1268 (2023). MSC: 90C27 05C38 68Q25 PDFBibTeX XMLCite \textit{S. Iwata} and \textit{Y. Yokoi}, SIAM J. Comput. 52, No. 5, 1230--1268 (2023; Zbl 1522.90160) Full Text: DOI arXiv
Sheng, Bin; Gutin, Gregory Fixed parameterized algorithms for generalized feedback vertex set problems. (English) Zbl 07667528 Theor. Comput. Sci. 953, Article ID 113798, 15 p. (2023). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{B. Sheng} and \textit{G. Gutin}, Theor. Comput. Sci. 953, Article ID 113798, 15 p. (2023; Zbl 07667528) Full Text: DOI
Thomas, Robin; Yoo, Youngho Packing \(A\)-paths of length zero modulo a prime. (English) Zbl 1510.05246 J. Comb. Theory, Ser. B 160, 114-143 (2023). MSC: 05C70 05C38 05C78 05C25 PDFBibTeX XMLCite \textit{R. Thomas} and \textit{Y. Yoo}, J. Comb. Theory, Ser. B 160, 114--143 (2023; Zbl 1510.05246) Full Text: DOI arXiv
Joó, Attila The Lovász-Cherkassky theorem in countable graphs. (English) Zbl 1505.05071 J. Comb. Theory, Ser. B 159, 1-19 (2023). MSC: 05C30 05C63 05C21 05C38 PDFBibTeX XMLCite \textit{A. Joó}, J. Comb. Theory, Ser. B 159, 1--19 (2023; Zbl 1505.05071) Full Text: DOI arXiv
Matoya, Kazuki; Oki, Taihei Pfaffian pairs and parities: counting on linear matroid intersection and parity problems. (English) Zbl 1497.05028 SIAM J. Discrete Math. 36, No. 3, 2121-2158 (2022). MSC: 05B35 52B40 05C50 15A15 90C27 PDFBibTeX XMLCite \textit{K. Matoya} and \textit{T. Oki}, SIAM J. Discrete Math. 36, No. 3, 2121--2158 (2022; Zbl 1497.05028) Full Text: DOI
Zhou, Si-zhong; Liu, Hong-xia Discussions on orthogonal factorizations in digraphs. (English) Zbl 1486.05122 Acta Math. Appl. Sin., Engl. Ser. 38, No. 2, 417-425 (2022). MSC: 05C20 05C70 05C82 68M10 68R10 PDFBibTeX XMLCite \textit{S.-z. Zhou} and \textit{H.-x. Liu}, Acta Math. Appl. Sin., Engl. Ser. 38, No. 2, 417--425 (2022; Zbl 1486.05122) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI
Bruhn, Henning; Ulmer, Arthur Packing \(A\)-paths of length zero modulo four. (English) Zbl 1476.05092 Eur. J. Comb. 99, Article ID 103422, 16 p. (2022). MSC: 05C38 05C83 05C12 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{A. Ulmer}, Eur. J. Comb. 99, Article ID 103422, 16 p. (2022; Zbl 1476.05092) Full Text: DOI arXiv
Matoya, Kazuki; Oki, Taihei Pfaffian pairs and parities: counting on linear matroid intersection and parity problems. (English) Zbl 1482.90231 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 223-237 (2021). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{K. Matoya} and \textit{T. Oki}, Lect. Notes Comput. Sci. 12707, 223--237 (2021; Zbl 1482.90231) Full Text: DOI arXiv
Kwon, O-joung; Raymond, Jean-Florent Packing and covering induced subdivisions. (English) Zbl 1462.05300 SIAM J. Discrete Math. 35, No. 2, 597-636 (2021). MSC: 05C70 05C38 05C60 PDFBibTeX XMLCite \textit{O-j. Kwon} and \textit{J.-F. Raymond}, SIAM J. Discrete Math. 35, No. 2, 597--636 (2021; Zbl 1462.05300) Full Text: DOI arXiv
Geelen, Jim; Rodriguez, Cynthia Disjoint non-balanced \(A\)-paths in biased graphs. (English) Zbl 1462.05297 Adv. Appl. Math. 126, Article ID 102014, 6 p. (2021). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Geelen} and \textit{C. Rodriguez}, Adv. Appl. Math. 126, Article ID 102014, 6 p. (2021; Zbl 1462.05297) Full Text: DOI
Bruhn-Fujimoto, Henning; Heinlein, Matthias \(K_4\)-subdivisions have the edge-Erdős-Pósa property. (English) Zbl 1460.05153 SIAM J. Discrete Math. 35, No. 1, 392-430 (2021). MSC: 05C70 05C83 PDFBibTeX XMLCite \textit{H. Bruhn-Fujimoto} and \textit{M. Heinlein}, SIAM J. Discrete Math. 35, No. 1, 392--430 (2021; Zbl 1460.05153) Full Text: DOI arXiv
Akhmedov, Maxim Faster 2-disjoint-shortest-paths algorithm. (English) Zbl 07603915 Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 103-116 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Akhmedov}, Lect. Notes Comput. Sci. 12159, 103--116 (2020; Zbl 07603915) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07600997 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 43-55 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 12126, 43--55 (2020; Zbl 07600997) Full Text: DOI arXiv
Björklund, Andreas; Husfeldt, Thore Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm. (English) Zbl 07561373 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 19, 13 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{A. Björklund} and \textit{T. Husfeldt}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 19, 13 p. (2018; Zbl 07561373) Full Text: DOI arXiv
Hirai, Hiroshi; Namba, Hiroyuki Shortest \((A+B)\)-path packing via hafnian. (English) Zbl 1396.68058 Algorithmica 80, No. 8, 2478-2491 (2018). MSC: 68Q25 05C50 68W20 90C27 PDFBibTeX XMLCite \textit{H. Hirai} and \textit{H. Namba}, Algorithmica 80, No. 8, 2478--2491 (2018; Zbl 1396.68058) Full Text: DOI arXiv
Bruhn, Henning; Heinlein, Matthias; Joos, Felix Frames, \(A\)-paths, and the Erdős-Pósa property. (English) Zbl 1388.05096 SIAM J. Discrete Math. 32, No. 2, 1246-1260 (2018). MSC: 05C38 PDFBibTeX XMLCite \textit{H. Bruhn} et al., SIAM J. Discrete Math. 32, No. 2, 1246--1260 (2018; Zbl 1388.05096) Full Text: DOI arXiv
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket Generalized pseudoforest deletion: algorithms and uniform kernel. (English) Zbl 1384.05148 SIAM J. Discrete Math. 32, No. 2, 882-901 (2018). MSC: 05C85 68Q25 68R10 68W40 PDFBibTeX XMLCite \textit{G. Philip} et al., SIAM J. Discrete Math. 32, No. 2, 882--901 (2018; Zbl 1384.05148) Full Text: DOI
Chiba, Shuya; Yamashita, Tomoki Degree conditions for the existence of vertex-disjoint cycles and paths: a survey. (English) Zbl 1382.05017 Graphs Comb. 34, No. 1, 1-83 (2018). MSC: 05C07 05C38 05C70 PDFBibTeX XMLCite \textit{S. Chiba} and \textit{T. Yamashita}, Graphs Comb. 34, No. 1, 1--83 (2018; Zbl 1382.05017) Full Text: DOI
Sun, Zhiren; Zhou, Sizhong A generalization of orthogonal factorizations in digraphs. (English) Zbl 1429.05171 Inf. Process. Lett. 132, 49-54 (2018). MSC: 05C70 05C20 05C82 PDFBibTeX XMLCite \textit{Z. Sun} and \textit{S. Zhou}, Inf. Process. Lett. 132, 49--54 (2018; Zbl 1429.05171) Full Text: DOI
Hols, Eva-Maria C.; Kratsch, Stefan A randomized polynomial kernel for subset feedback vertex set. (English) Zbl 1387.68134 Theory Comput. Syst. 62, No. 1, 63-92 (2018). MSC: 68Q25 68R10 68W20 PDFBibTeX XMLCite \textit{E.-M. C. Hols} and \textit{S. Kratsch}, Theory Comput. Syst. 62, No. 1, 63--92 (2018; Zbl 1387.68134) Full Text: DOI arXiv Link
Rai, Ashutosh; Saurabh, Saket Bivariate complexity analysis of Almost Forest Deletion. (English) Zbl 1382.68122 Theor. Comput. Sci. 708, 18-33 (2018). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Rai} and \textit{S. Saurabh}, Theor. Comput. Sci. 708, 18--33 (2018; Zbl 1382.68122) Full Text: DOI
Kim, Eun Jung; Kwon, O-Joung A polynomial kernel for block graph deletion. (English) Zbl 1372.68134 Algorithmica 79, No. 1, 251-270 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. J. Kim} and \textit{O-J. Kwon}, Algorithmica 79, No. 1, 251--270 (2017; Zbl 1372.68134) Full Text: DOI arXiv Link
Zhou, Sizhong; Sun, Zhiren; Xu, Zurun A result on \(r\)-orthogonal factorizations in digraphs. (English) Zbl 1369.05096 Eur. J. Comb. 65, 15-23 (2017). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{S. Zhou} et al., Eur. J. Comb. 65, 15--23 (2017; Zbl 1369.05096) Full Text: DOI
Matsubara, Ryota; Matsumura, Hajime; Tsugaki, Masao; Yamashita, Tomoki Degree sum conditions for path-factors with specified end vertices in bipartite graphs. (English) Zbl 1351.05129 Discrete Math. 340, No. 2, 87-95 (2017). MSC: 05C38 05C07 PDFBibTeX XMLCite \textit{R. Matsubara} et al., Discrete Math. 340, No. 2, 87--95 (2017; Zbl 1351.05129) Full Text: DOI
Yamaguchi, Yutaro Packing \(A\)-paths in group-labelled graphs via linear matroid parity. (English) Zbl 1332.05033 SIAM J. Discrete Math. 30, No. 1, 474-492 (2016). MSC: 05B35 05C38 05C50 05C70 05C78 05C85 20C25 PDFBibTeX XMLCite \textit{Y. Yamaguchi}, SIAM J. Discrete Math. 30, No. 1, 474--492 (2016; Zbl 1332.05033) Full Text: DOI
Rai, Ashutosh; Saurabh, Saket Bivariate complexity analysis of Almost Forest Deletion. (English) Zbl 1465.68109 Xu, Dachuan (ed.) et al., Computing and combinatorics. 21st international conference, COCOON 2015, Beijing, China, August 4–6, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9198, 133-144 (2015). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Rai} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 9198, 133--144 (2015; Zbl 1465.68109) Full Text: DOI
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket Generalized pseudoforest deletion: algorithms and uniform kernel. (English) Zbl 1400.05242 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-48053-3/pbk; 978-3-662-48054-0/ebook). Lecture Notes in Computer Science 9235, 517-528 (2015). MSC: 05C85 68Q25 68R10 68W40 PDFBibTeX XMLCite \textit{G. Philip} et al., Lect. Notes Comput. Sci. 9235, 517--528 (2015; Zbl 1400.05242) Full Text: DOI
Zhou, Sizhong Remarks on orthogonal factorizations of digraphs. (English) Zbl 1303.05159 Int. J. Comput. Math. 91, No. 10, 2109-2117 (2014). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{S. Zhou}, Int. J. Comput. Math. 91, No. 10, 2109--2117 (2014; Zbl 1303.05159) Full Text: DOI
Zhou, Sizhong; Bian, Qiuju Subdigraphs with orthogonal factorizations of digraphs. II. (English) Zbl 1284.05117 Eur. J. Comb. 36, 198-205 (2014). MSC: 05C20 05C60 05C70 68R10 68M10 PDFBibTeX XMLCite \textit{S. Zhou} and \textit{Q. Bian}, Eur. J. Comb. 36, 198--205 (2014; Zbl 1284.05117) Full Text: DOI
Wang, Changping Subdigraphs with orthogonal factorizations of digraphs. (English) Zbl 1242.05113 Eur. J. Comb. 33, No. 6, 1015-1021 (2012). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{C. Wang}, Eur. J. Comb. 33, No. 6, 1015--1021 (2012; Zbl 1242.05113) Full Text: DOI
Wollan, Paul Packing cycles with modularity constraints. (English) Zbl 1249.05215 Combinatorica 31, No. 1, 95-126 (2011). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C38 05C22 05C25 PDFBibTeX XMLCite \textit{P. Wollan}, Combinatorica 31, No. 1, 95--126 (2011; Zbl 1249.05215) Full Text: DOI
Danicic, Sebastian; Barraclough, Richard W.; Harman, Mark; Howroyd, John D.; Kiss, Ákos; Laurence, Michael R. A unifying theory of control dependence and its application to arbitrary program structures. (English) Zbl 1231.68179 Theor. Comput. Sci. 412, No. 49, 6809-6842 (2011). MSC: 68R10 68N30 PDFBibTeX XMLCite \textit{S. Danicic} et al., Theor. Comput. Sci. 412, No. 49, 6809--6842 (2011; Zbl 1231.68179) Full Text: DOI Link
Marx, Dániel Chordal deletion is fixed-parameter tractable. (English) Zbl 1220.05066 Algorithmica 57, No. 4, 747-768 (2010). MSC: 05C38 PDFBibTeX XMLCite \textit{D. Marx}, Algorithmica 57, No. 4, 747--768 (2010; Zbl 1220.05066) Full Text: DOI
Wollan, Paul Packing non-zero \(A\)-paths in an undirected model of group labeled graphs. (English) Zbl 1216.05120 J. Comb. Theory, Ser. B 100, No. 2, 141-150 (2010). MSC: 05C70 05C38 05C78 PDFBibTeX XMLCite \textit{P. Wollan}, J. Comb. Theory, Ser. B 100, No. 2, 141--150 (2010; Zbl 1216.05120) Full Text: DOI
Liu, Guizhen Orthogonal factorizations of digraphs. (English) Zbl 1208.05114 Front. Math. China 4, No. 2, 311-323 (2009). MSC: 05C70 PDFBibTeX XMLCite \textit{G. Liu}, Front. Math. China 4, No. 2, 311--323 (2009; Zbl 1208.05114) Full Text: DOI
Pap, Gyula Packings and 2-packings of a-paths. (English) Zbl 1200.05179 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 391-400 (2005). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{G. Pap}, Electron. Notes Discrete Math. 22, 391--400 (2005; Zbl 1200.05179) Full Text: DOI
Kriesell, Matthias Disjoint \(A\)-paths in digraphs. (English) Zbl 1072.05033 J. Comb. Theory, Ser. B 95, No. 1, 168-172 (2005). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{M. Kriesell}, J. Comb. Theory, Ser. B 95, No. 1, 168--172 (2005; Zbl 1072.05033) Full Text: DOI
Schrijver, Alexander A short proof of Mader’s \(\mathcal S\)-paths theorem. (English) Zbl 1027.05051 J. Comb. Theory, Ser. B 82, No. 2, 319-321 (2001). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{A. Schrijver}, J. Comb. Theory, Ser. B 82, No. 2, 319--321 (2001; Zbl 1027.05051) Full Text: DOI
Yegnanarayanan, V. Graph colourings and partitions. (English) Zbl 0979.68065 Theor. Comput. Sci. 263, No. 1-2, 59-74 (2001). Reviewer: Tamás Fleiner (Budapest) MSC: 68R10 PDFBibTeX XMLCite \textit{V. Yegnanarayanan}, Theor. Comput. Sci. 263, No. 1--2, 59--74 (2001; Zbl 0979.68065) Full Text: DOI
Bouchet, André; Schwärzler, Werner The delta-sum of matching delta-matroids. (English) Zbl 0901.05025 Discrete Math. 181, No. 1-3, 53-63 (1998). Reviewer: Mirela Ştefănescu (Constanţa) MSC: 05B35 PDFBibTeX XMLCite \textit{A. Bouchet} and \textit{W. Schwärzler}, Discrete Math. 181, No. 1--3, 53--63 (1998; Zbl 0901.05025) Full Text: DOI
Bouchet, André Coverings and delta-coverings. (English) Zbl 1498.90182 Balas, Egon (ed.) et al., Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29–31, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 920, 228-243 (1995). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Bouchet}, Lect. Notes Comput. Sci. 920, 228--243 (1995; Zbl 1498.90182) Full Text: DOI
Guo, Yubao; Volkmann, Lutz A generalization of Menger’s theorem for certain block-cactus graphs. (English) Zbl 0819.05037 Graphs Comb. 11, No. 1, 49-52 (1995). Reviewer: B.Andrásfai (Budapest) MSC: 05C38 PDFBibTeX XMLCite \textit{Y. Guo} and \textit{L. Volkmann}, Graphs Comb. 11, No. 1, 49--52 (1995; Zbl 0819.05037) Full Text: DOI
Yinnone, Hananya Maximum number of disjoint paths connecting specified terminals in a graph. (English) Zbl 0815.68075 Discrete Appl. Math. 55, No. 2, 183-195 (1994). MSC: 68R10 05C38 PDFBibTeX XMLCite \textit{H. Yinnone}, Discrete Appl. Math. 55, No. 2, 183--195 (1994; Zbl 0815.68075) Full Text: DOI
Bollobás, Béla; Goldsmith, D. L.; Woodall, D. R. Indestructive deletions of edges from graphs. (English) Zbl 0486.05044 J. Comb. Theory, Ser. B 30, 263-275 (1981). MSC: 05C40 PDFBibTeX XMLCite \textit{B. Bollobás} et al., J. Comb. Theory, Ser. B 30, 263--275 (1981; Zbl 0486.05044) Full Text: DOI
Lovász, László Matroid matching and some applications. (English) Zbl 0444.05031 J. Comb. Theory, Ser. B 28, 208-236 (1980). MSC: 05B35 05C35 05C40 05C65 05C70 PDFBibTeX XMLCite \textit{L. Lovász}, J. Comb. Theory, Ser. B 28, 208--236 (1980; Zbl 0444.05031) Full Text: DOI
Mader, W. Über ein graphentheoretisches Ergebnis von T. Gallai. (German) Zbl 0391.05037 Acta Math. Acad. Sci. Hung. 35, 205-215 (1980). MSC: 05C38 05C99 PDFBibTeX XMLCite \textit{W. Mader}, Acta Math. Acad. Sci. Hung. 35, 205--215 (1980; Zbl 0391.05037) Full Text: DOI
Mader, W. Über ein graphentheoretisches Problem von T. Gallai. (German) Zbl 0405.05044 Arch. Math. 33, 239-257 (1979). MSC: 05C38 PDFBibTeX XMLCite \textit{W. Mader}, Arch. Math. 33, 239--257 (1979; Zbl 0405.05044) Full Text: DOI
Mader, W. Über die Maximalzahl kreuzungsfreier H-Wege. (German) Zbl 0378.05038 Arch. Math. 31, 387-402 (1979). MSC: 05C35 PDFBibTeX XMLCite \textit{W. Mader}, Arch. Math. 31, 387--402 (1979; Zbl 0378.05038) Full Text: DOI
Mader, W. Über die Maximalzahl kantendisjunkter A-Wege. (German) Zbl 0354.05042 Arch. Math. 30, 325-336 (1978). MSC: 05C35 PDFBibTeX XMLCite \textit{W. Mader}, Arch. Math. 30, 325--336 (1978; Zbl 0354.05042) Full Text: DOI
Lovász, László On some connectivity properties of Eulerian graphs. (English) Zbl 0337.05124 Acta Math. Acad. Sci. Hung. 28, 129-138 (1976). MSC: 05C35 PDFBibTeX XMLCite \textit{L. Lovász}, Acta Math. Acad. Sci. Hung. 28, 129--138 (1976; Zbl 0337.05124) Full Text: DOI
Lovász, László On the ratio of optimal integral and fractional covers. (English) Zbl 0323.05127 Discrete Math. 13, 383-390 (1975). MSC: 05C99 05C15 PDFBibTeX XMLCite \textit{L. Lovász}, Discrete Math. 13, 383--390 (1975; Zbl 0323.05127) Full Text: DOI
Simonovits, M. A new proof and generalizations of a theorem of Erdős and Posa on graphs without \(k+1\) independent circuits. (English) Zbl 0155.31804 Acta Math. Acad. Sci. Hung. 18, 191-206 (1967). PDFBibTeX XMLCite \textit{M. Simonovits}, Acta Math. Acad. Sci. Hung. 18, 191--206 (1967; Zbl 0155.31804) Full Text: DOI