Tu, Jianhua; Shi, Yongtang An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs. (English) Zbl 1401.05286 Discuss. Math., Graph Theory 39, No. 1, 55-65 (2019). MSC: 05C85 05C10 05C35 90C27 90C39 68Q25 PDF BibTeX XML Cite \textit{J. Tu} and \textit{Y. Shi}, Discuss. Math., Graph Theory 39, No. 1, 55--65 (2019; Zbl 1401.05286) Full Text: DOI
Kanté, Mamadou Moustapha; Kwon, O-joung Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions. (English) Zbl 1394.05024 Eur. J. Comb. 74, 110-139 (2018). MSC: 05C12 05C83 05C38 05B35 52B40 PDF BibTeX XML Cite \textit{M. M. Kanté} and \textit{O-j. Kwon}, Eur. J. Comb. 74, 110--139 (2018; Zbl 1394.05024) Full Text: DOI
Kapaida, Rohan The extremal functions of classes of matroids of bounded branch-width. (English) Zbl 1413.05044 Combinatorica 38, No. 1, 193-218 (2018). MSC: 05B35 52B40 PDF BibTeX XML Cite \textit{R. Kapaida}, Combinatorica 38, No. 1, 193--218 (2018; Zbl 1413.05044) Full Text: DOI
Adler, Isolde; Kanté, Mamadou Moustapha; Kwon, O-joung Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm. (English) Zbl 1361.05036 Algorithmica 78, No. 1, 342-377 (2017). MSC: 05C12 05C83 05C38 05B35 52B40 68R10 PDF BibTeX XML Cite \textit{I. Adler} et al., Algorithmica 78, No. 1, 342--377 (2017; Zbl 1361.05036) Full Text: DOI arXiv
Sæther, Sigve Hortemo; Vatshelle, Martin Hardness of computing width parameters based on branch decompositions over the vertex set. (English) Zbl 1333.68127 Theor. Comput. Sci. 615, 120-125 (2016). MSC: 68Q17 05C85 PDF BibTeX XML Cite \textit{S. H. Sæther} and \textit{M. Vatshelle}, Theor. Comput. Sci. 615, 120--125 (2016; Zbl 1333.68127) Full Text: DOI
Sæther, Sigve Hortemo; Vatshelle, Martin Hardness of computing width parameters based on branch decompositions over the vertex set. (English) Zbl 1346.05238 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 301-308, electronic only (2015). MSC: 05C70 05C85 05C12 68Q17 PDF BibTeX XML Cite \textit{S. H. Sæther} and \textit{M. Vatshelle}, Electron. Notes Discrete Math. 49, 301--308 (2015; Zbl 1346.05238) Full Text: DOI
Jou, Jonathan; Jain, Swati; Georgiev, Ivelin; Donald, Bruce BWM*: A novel, provable, ensemble-based dynamic programming algorithm for sparse approximations of computational protein design. (English) Zbl 1355.92004 Przytycka, Teresa M. (ed.), Research in computational molecular biology. 19th annual international conference, RECOMB 2015, Warsaw, Poland, April 12–15, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-16705-3/pbk; 978-3-319-16706-0/ebook). Lecture Notes in Computer Science 9029. Lecture Notes in Bioinformatics, 154-166 (2015). MSC: 92-08 92D20 PDF BibTeX XML Cite \textit{J. Jou} et al., Lect. Notes Comput. Sci. 9029, 154--166 (2015; Zbl 1355.92004) Full Text: DOI
Geelen, Jim; van Zwam, Stefan H. M. Matroid 3-connectivity and branch width. (English) Zbl 1310.05048 J. Comb. Theory, Ser. B 112, 104-123 (2015). MSC: 05B35 05C40 PDF BibTeX XML Cite \textit{J. Geelen} and \textit{S. H. M. van Zwam}, J. Comb. Theory, Ser. B 112, 104--123 (2015; Zbl 1310.05048) Full Text: DOI arXiv
Giannopoulou, Archontia C.; Kamiński, Marcin; Thilikos, Dimitrios M. Forbidding Kuratowski graphs as immersions. (English) Zbl 1306.05232 J. Graph Theory 78, No. 1, 43-60 (2015). MSC: 05C83 05C10 PDF BibTeX XML Cite \textit{A. C. Giannopoulou} et al., J. Graph Theory 78, No. 1, 43--60 (2015; Zbl 1306.05232) Full Text: DOI arXiv
Fink, Elisabeth Conjugacy growth and width of certain branch groups. (English) Zbl 1318.20028 Int. J. Algebra Comput. 24, No. 8, 1213-1231 (2014). MSC: 20E08 20F65 20F05 20F69 20E45 PDF BibTeX XML Cite \textit{E. Fink}, Int. J. Algebra Comput. 24, No. 8, 1213--1231 (2014; Zbl 1318.20028) Full Text: DOI arXiv
Nestoridis, Nestor V.; Thilikos, Dimitrios M. Square roots of minor closed graph classes. (English) Zbl 1285.05165 Discrete Appl. Math. 168, 34-39 (2014). MSC: 05C83 05C85 05C75 PDF BibTeX XML Cite \textit{N. V. Nestoridis} and \textit{D. M. Thilikos}, Discrete Appl. Math. 168, 34--39 (2014; Zbl 1285.05165) Full Text: DOI
Škoda, Petr Computability of width of submodular partition functions. (English) Zbl 1257.05134 Eur. J. Comb. 34, No. 3, 660-665 (2013). MSC: 05C70 05C05 05C85 68R10 68W05 PDF BibTeX XML Cite \textit{P. Škoda}, Eur. J. Comb. 34, No. 3, 660--665 (2013; Zbl 1257.05134) Full Text: DOI
Grigoriev, Alexander; Marchal, Bert; Usotskaya, Natalya; Todinca, Ioan A note on planar graphs with large width parameters and small grid-minors. (English) Zbl 1242.05070 Discrete Appl. Math. 160, No. 7-8, 1262-1269 (2012). MSC: 05C10 05C05 05C83 PDF BibTeX XML Cite \textit{A. Grigoriev} et al., Discrete Appl. Math. 160, No. 7--8, 1262--1269 (2012; Zbl 1242.05070) Full Text: DOI
Král’, Daniel Decomposition width of matroids. (English) Zbl 1241.05013 Discrete Appl. Math. 160, No. 6, 913-923 (2012). MSC: 05B35 03B15 05C85 PDF BibTeX XML Cite \textit{D. Král'}, Discrete Appl. Math. 160, No. 6, 913--923 (2012; Zbl 1241.05013) Full Text: DOI
Mayhew, Dillon; Whittle, Geoff; Van Zwam, Stefan H. M. Stability, fragility, and Rota’s conjecture. (English) Zbl 1241.05010 J. Comb. Theory, Ser. B 102, No. 3, 760-783 (2012). MSC: 05B25 PDF BibTeX XML Cite \textit{D. Mayhew} et al., J. Comb. Theory, Ser. B 102, No. 3, 760--783 (2012; Zbl 1241.05010) Full Text: DOI arXiv
Alekhnovich, Michael; Razborov, Alexander Satisfiability, branch-width and Tseitin tautologies. (English) Zbl 1243.68182 Comput. Complexity 20, No. 4, 649-678 (2011). MSC: 68Q17 68Q25 68T15 03F20 PDF BibTeX XML Cite \textit{M. Alekhnovich} and \textit{A. Razborov}, Comput. Complexity 20, No. 4, 649--678 (2011; Zbl 1243.68182) Full Text: DOI
Strozecki, Yann Monadic second-order model-checking on decomposable matroids. (English) Zbl 1225.05073 Discrete Appl. Math. 159, No. 10, 1022-1039 (2011). MSC: 05B35 PDF BibTeX XML Cite \textit{Y. Strozecki}, Discrete Appl. Math. 159, No. 10, 1022--1039 (2011; Zbl 1225.05073) Full Text: DOI
Azzato, Jeffrey Linked tree-decompositions of represented infinite matroids. (English) Zbl 1298.05052 J. Comb. Theory, Ser. B 101, No. 3, 123-140 (2011). Reviewer: Ratnakaram Nava Mohan (Hyderabad) MSC: 05B35 05C83 05C70 PDF BibTeX XML Cite \textit{J. Azzato}, J. Comb. Theory, Ser. B 101, No. 3, 123--140 (2011; Zbl 1298.05052) Full Text: DOI
Oum, Sang-Il Computing rank-width exactly. (English) Zbl 1197.05151 Inf. Process. Lett. 109, No. 13, 745-748 (2009). MSC: 05C85 68Q25 68R10 05C12 PDF BibTeX XML Cite \textit{S.-I. Oum}, Inf. Process. Lett. 109, No. 13, 745--748 (2009; Zbl 1197.05151) Full Text: DOI
Geelen, Jim; Gerards, Bert; Whittle, Geoff Tangles, tree-decompositions and grids in matroids. (English) Zbl 1229.05070 J. Comb. Theory, Ser. B 99, No. 4, 657-667 (2009). MSC: 05B35 05C70 05C83 PDF BibTeX XML Cite \textit{J. Geelen} et al., J. Comb. Theory, Ser. B 99, No. 4, 657--667 (2009; Zbl 1229.05070) Full Text: DOI
Barnea, Y.; Gavioli, N.; Jaikin-Zapirain, A.; Monti, V.; Scoppola, C. M. Pro-\(p\) groups with few normal subgroups. (English) Zbl 1206.20030 J. Algebra 321, No. 2, 429-449 (2009). Reviewer: Pavel Zalesskij (Brasília) MSC: 20E18 20E07 20E15 20F14 PDF BibTeX XML Cite \textit{Y. Barnea} et al., J. Algebra 321, No. 2, 429--449 (2009; Zbl 1206.20030) Full Text: DOI
Oum, Sang-Il Approximating rank-width and clique-width quickly. (English) Zbl 1451.05231 ACM Trans. Algorithms 5, No. 1, Article No. 10, 20 p. (2008). MSC: 05C85 05C12 68W25 05B35 PDF BibTeX XML Cite \textit{S.-I. Oum}, ACM Trans. Algorithms 5, No. 1, Article No. 10, 20 p. (2008; Zbl 1451.05231) Full Text: DOI
Hliněný, Petr; Oum, Sang-Il Finding branch-decompositions and rank-decompositions. (English) Zbl 1163.05331 SIAM J. Comput. 38, No. 3, 1012-1032 (2008). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{S.-I. Oum}, SIAM J. Comput. 38, No. 3, 1012--1032 (2008; Zbl 1163.05331) Full Text: DOI
Truffot, Jérôme; Duhamel, Christophe A Branch and Price algorithm for the \(k\)-splittable maximum flow problem. (English) Zbl 1140.90481 Discrete Optim. 5, No. 3, 629-646 (2008). MSC: 90C27 90B10 PDF BibTeX XML Cite \textit{J. Truffot} and \textit{C. Duhamel}, Discrete Optim. 5, No. 3, 629--646 (2008; Zbl 1140.90481) Full Text: DOI
Oum, Sang-Il Rank-width is less than or equal to branch-width. (English) Zbl 1135.05059 J. Graph Theory 57, No. 3, 239-244 (2008). MSC: 05C70 05B35 PDF BibTeX XML Cite \textit{S.-I. Oum}, J. Graph Theory 57, No. 3, 239--244 (2008; Zbl 1135.05059) Full Text: DOI
Hliněný, Petr; Oum, Sang-il Finding branch-decompositions and rank-decompositions. (English) Zbl 1151.05046 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 163-174 (2007). MSC: 05C85 05B35 68W40 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{S.-i. Oum}, Lect. Notes Comput. Sci. 4698, 163--174 (2007; Zbl 1151.05046) Full Text: DOI
Geelen, Jim; Gerards, Bert; Whittle, Geoff Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids. (English) Zbl 1125.05025 J. Comb. Theory, Ser. B 97, No. 6, 971-998 (2007). Reviewer: Kelly J. Pearson (Murray) MSC: 05B35 PDF BibTeX XML Cite \textit{J. Geelen} et al., J. Comb. Theory, Ser. B 97, No. 6, 971--998 (2007; Zbl 1125.05025) Full Text: DOI
Oum, Sang-il; Seymour, Paul Testing branch-width. (English) Zbl 1138.05070 J. Comb. Theory, Ser. B 97, No. 3, 385-393 (2007). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05B35 05C40 68R10 PDF BibTeX XML Cite \textit{S.-i. Oum} and \textit{P. Seymour}, J. Comb. Theory, Ser. B 97, No. 3, 385--393 (2007; Zbl 1138.05070) Full Text: DOI
Mazoit, Frédéric The branch-width of circular-arc graphs. (English) Zbl 1145.68474 Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 727-736 (2006). MSC: 68R10 05C62 05C85 68Q25 PDF BibTeX XML Cite \textit{F. Mazoit}, Lect. Notes Comput. Sci. 3887, 727--736 (2006; Zbl 1145.68474) Full Text: DOI
Geelen, J.; Gerards, B.; Robertson, N.; Whittle, G. Obstructions to branch-decomposition of matroids. (English) Zbl 1094.05011 J. Comb. Theory, Ser. B 96, No. 4, 560-570 (2006). Reviewer: Kelly J. Pearson (Murray) MSC: 05B35 PDF BibTeX XML Cite \textit{J. Geelen} et al., J. Comb. Theory, Ser. B 96, No. 4, 560--570 (2006; Zbl 1094.05011) Full Text: DOI
Hliněný, Petr; Seese, Detlef Trees, grids, and MSO decidability: from graphs to matroids. (English) Zbl 1093.03006 Theor. Comput. Sci. 351, No. 3, 372-393 (2006). MSC: 03B25 03B15 05B35 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{D. Seese}, Theor. Comput. Sci. 351, No. 3, 372--393 (2006; Zbl 1093.03006) Full Text: DOI
Hicks, Illya V. Planar branch decompositions. II: The cycle method. (English) Zbl 1239.05177 INFORMS J. Comput. 17, No. 4, 413-421 (2005). MSC: 05C85 05C70 05C65 68R10 PDF BibTeX XML Cite \textit{I. V. Hicks}, INFORMS J. Comput. 17, No. 4, 413--421 (2005; Zbl 1239.05177) Full Text: DOI
Hicks, Illya V. Planar branch decompositions. I: The ratcatcher. (English) Zbl 1239.05176 INFORMS J. Comput. 17, No. 4, 402-412 (2005). MSC: 05C85 05C70 68R10 68W25 PDF BibTeX XML Cite \textit{I. V. Hicks}, INFORMS J. Comput. 17, No. 4, 402--412 (2005; Zbl 1239.05176) Full Text: DOI
Oum, Sang-Il Rank-width and well-quasi-ordering of skew-symmetric matrices: (extended abstract). (English) Zbl 1200.05210 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, 281-285 (2005). MSC: 05C83 PDF BibTeX XML Cite \textit{S.-I. Oum}, Electron. Notes Discrete Math. 22, 281--285 (2005; Zbl 1200.05210) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. New upper bounds on the decomposability of planar graphs. (English) Zbl 1085.05049 J. Graph Theory 51, No. 1, 53-81 (2006). MSC: 05C70 05C35 05C10 PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, J. Graph Theory 51, No. 1, 53--81 (2005; Zbl 1085.05049) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimitrios M. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. (English) Zbl 1099.68077 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 581-592 (2004). MSC: 68R10 05C10 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 3142, 581--592 (2004; Zbl 1099.68077) Full Text: DOI
Hliněný, Petr; Seese, Detlef On decidability of MSO theories of representable matroids. (English) Zbl 1104.03007 Downey, Rod (ed.) et al., Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23071-8/pbk). Lecture Notes in Computer Science 3162, 96-107 (2004). MSC: 03B25 03B15 05B35 68R05 68R10 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{D. Seese}, Lect. Notes Comput. Sci. 3162, 96--107 (2004; Zbl 1104.03007) Full Text: DOI
Hliněný, Petr Using a computer in matroid theory research. (English) Zbl 1063.05030 Acta Univ. M. Belii, Ser. Math. 11, 27-44 (2004). Reviewer: David L. Forge (Orsay) MSC: 05B35 68R05 PDF BibTeX XML Cite \textit{P. Hliněný}, Acta Univ. M. Belii, Ser. Math. 11, 27--44 (2004; Zbl 1063.05030)
Zhou, Xiangqian On internally 4-connected non-regular binary matroids. (English) Zbl 1051.05027 J. Comb. Theory, Ser. B 91, No. 2, 327-343 (2004). MSC: 05B35 PDF BibTeX XML Cite \textit{X. Zhou}, J. Comb. Theory, Ser. B 91, No. 2, 327--343 (2004; Zbl 1051.05027) Full Text: DOI
Hliněný, Petr On matroid properties definable in the MSO logic. (English) Zbl 1124.68373 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25–29, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40671-9/pbk). Lect. Notes Comput. Sci. 2747, 470-479 (2003). MSC: 68Q25 03B15 05B35 68R05 PDF BibTeX XML Cite \textit{P. Hliněný}, Lect. Notes Comput. Sci. 2747, 470--479 (2003; Zbl 1124.68373) Full Text: DOI
Geelen, J. F.; Gerards, A. M. H.; Robertson, N.; Whittle, G. P. On the excluded minors for the matroids of branch-width \(k\). (English) Zbl 1032.05027 J. Comb. Theory, Ser. B 88, No. 2, 261-265 (2003). Reviewer: Kelly J.Pearson (Murray) MSC: 05B35 PDF BibTeX XML Cite \textit{J. F. Geelen} et al., J. Comb. Theory, Ser. B 88, No. 2, 261--265 (2003; Zbl 1032.05027) Full Text: DOI
Hliněný, Petr Branch-width, parse trees, and monadic second-order logic for matroids. (English) Zbl 1035.05029 Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 319-330 (2003). MSC: 05B35 68R05 03D05 PDF BibTeX XML Cite \textit{P. Hliněný}, Lect. Notes Comput. Sci. 2607, 319--330 (2003; Zbl 1035.05029) Full Text: Link
Cornuéjols, Gérard; Guenin, Bertrand Ideal clutters. (English) Zbl 1027.90060 Discrete Appl. Math. 123, No. 1-3, 303-338 (2002). Reviewer: G.Gutin (Odense) MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{G. Cornuéjols} and \textit{B. Guenin}, Discrete Appl. Math. 123, No. 1--3, 303--338 (2002; Zbl 1027.90060) Full Text: DOI
Bartholdi, Laurent; Grigorchuk, Rostislav I. Lie methods in growth of groups and groups of finite width. (English) Zbl 1032.20026 Atkinson, Michael (ed.) et al., Computational and geometric aspects of modern algebra. Proceedings of the workshop, Edinburgh, UK, July 23-31, 1998. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 275, 1-27 (2000). Reviewer: N.Yu.Makarenko (Novosibirsk) MSC: 20F50 20F14 16P90 17B60 17B50 20E08 20E18 20E26 20F40 20F05 PDF BibTeX XML Cite \textit{L. Bartholdi} and \textit{R. I. Grigorchuk}, Lond. Math. Soc. Lect. Note Ser. 275, 1--27 (2000; Zbl 1032.20026) Full Text: arXiv
Glover, Fred; Parker, Mark; Ryan, Jennifer Coloring by tabu branch and bound. (English) Zbl 0864.90120 Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 285-307 (1996). MSC: 90C35 05C85 68R10 PDF BibTeX XML Cite \textit{F. Glover} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 285--307 (1996; Zbl 0864.90120)
Dharmatilake, Jack S. A min-max theorem using matroid separations. (English) Zbl 0954.05014 Bonin, Joseph E. (ed.) et al., Matroid theory. AMS-IMS-SIAM joint summer research conference on matroid theory, July 2-6, 1995, University of Washington, Seattle, WA, USA. Providence, RI: American Mathematical Society. Contemp. Math. 197, 333-342 (1996). Reviewer: A.Recski (Budapest) MSC: 05B35 PDF BibTeX XML Cite \textit{J. S. Dharmatilake}, Contemp. Math. 197, 333--342 (1996; Zbl 0954.05014)
Seymour, P. D.; Thomas, R. Call routing and the ratcatcher. (English) Zbl 0799.05057 Combinatorica 14, No. 2, 217-241 (1994). MSC: 05C78 05C85 05C65 05C10 PDF BibTeX XML Cite \textit{P. D. Seymour} and \textit{R. Thomas}, Combinatorica 14, No. 2, 217--241 (1994; Zbl 0799.05057) Full Text: DOI
Matousěk, J.; Nešetřil, Jaroslav; Thomas, Robin On polynomial time decidability of induced-minor-closed classes. (English) Zbl 0668.68048 Commentat. Math. Univ. Carol. 29, No. 4, 703-710 (1988). MSC: 68Q25 68R10 05C99 PDF BibTeX XML Cite \textit{J. Matousěk} et al., Commentat. Math. Univ. Carol. 29, No. 4, 703--710 (1988; Zbl 0668.68048)
Baer, Jean-Loup; Koyama, Barbara On the minimization of the width of the control memory of microprogrammed processors. (English) Zbl 0398.68015 IEEE Trans. Comput. 28, 310-316 (1979). MSC: 68Q25 68W99 68N25 PDF BibTeX XML Cite \textit{J.-L. Baer} and \textit{B. Koyama}, IEEE Trans. Comput. 28, 310--316 (1979; Zbl 0398.68015) Full Text: DOI