Binucci, Carla; Da Lozzo, Giordano; Di Giacomo, Emilio; Didimo, Walter; Mchedlidze, Tamara; Patrignani, Maurizio Upward book embeddability of \(st\)-graphs: complexity and algorithms. (English) Zbl 07777564 Algorithmica 85, No. 12, 3521-3571 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{C. Binucci} et al., Algorithmica 85, No. 12, 3521--3571 (2023; Zbl 07777564) Full Text: DOI OA License
Hicks, Illya V.; Brimkov, Boris Tangle bases: revisited. (English) Zbl 07775256 Networks 77, No. 1, 161-172 (2021). MSC: 68R10 05C70 05C85 90C27 90C35 90C39 PDFBibTeX XMLCite \textit{I. V. Hicks} and \textit{B. Brimkov}, Networks 77, No. 1, 161--172 (2021; Zbl 07775256) Full Text: DOI
Binucci, Carla; Da Lozzo, Giordano; Di Giacomo, Emilio; Didimo, Walter; Mchedlidze, Tamara; Patrignani, Maurizio Upward book embeddings of st-graphs. (English) Zbl 1512.68194 Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 13, 22 p. (2019). MSC: 68R10 05C10 05C85 68Q17 68W40 PDFBibTeX XMLCite \textit{C. Binucci} et al., LIPIcs -- Leibniz Int. Proc. Inform. 129, Article 13, 22 p. (2019; Zbl 1512.68194) Full Text: DOI arXiv
Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan A SAT approach to branchwidth. (English) Zbl 1433.68412 ACM Trans. Comput. Log. 20, No. 3, Article No. 15, 24 p. (2019). MSC: 68T20 05C65 05C78 05C85 68R07 PDFBibTeX XMLCite \textit{N. Lodha} et al., ACM Trans. Comput. Log. 20, No. 3, Article No. 15, 24 p. (2019; Zbl 1433.68412) Full Text: DOI Link
Eppstein, David The effect of planarization on width. (English) Zbl 1398.05141 J. Graph Algorithms Appl. 22, No. 3, 461-481 (2018). MSC: 05C62 05C10 05C07 PDFBibTeX XMLCite \textit{D. Eppstein}, J. Graph Algorithms Appl. 22, No. 3, 461--481 (2018; Zbl 1398.05141) Full Text: DOI
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1395.05116 Discrete Appl. Math. 248, 114-124 (2018). MSC: 05C62 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 114--124 (2018; Zbl 1395.05116) Full Text: DOI Link
Pino, Willem J. A.; Bodlaender, Hans L.; van Rooij, Johan M. M. Cut and count and representative sets on branch decompositions. (English) Zbl 1398.05205 Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 27, 12 p. (2017). MSC: 05C85 68W20 90C35 90C39 PDFBibTeX XMLCite \textit{W. J. A. Pino} et al., LIPIcs -- Leibniz Int. Proc. Inform. 63, Article 27, 12 p. (2017; Zbl 1398.05205) Full Text: DOI
Harvey, Daniel J.; Wood, David R. Parameters tied to treewidth. (English) Zbl 1359.05030 J. Graph Theory 84, No. 4, 364-385 (2017). MSC: 05C12 05C70 05C76 PDFBibTeX XMLCite \textit{D. J. Harvey} and \textit{D. R. Wood}, J. Graph Theory 84, No. 4, 364--385 (2017; Zbl 1359.05030) Full Text: DOI arXiv
Thilikos, Dimitrios M. Coverability and sub-exponential parameterized algorithms in planar graphs. (English) Zbl 1425.05041 Bull. Hell. Math. Soc. 60, 110-124 (2016). MSC: 05C10 05C12 05C69 05C85 68R10 68W40 68Q25 PDFBibTeX XMLCite \textit{D. M. Thilikos}, Bull. Hell. Math. Soc. 60, 110--124 (2016; Zbl 1425.05041) Full Text: Link
Ishii, Toshimasa; Ono, Hirotaka; Uno, Yushi Subexponential fixed-parameter algorithms for partial vector domination. (English) Zbl 1387.90265 Discrete Optim. 22, Part A, 111-121 (2016). MSC: 90C35 05C85 90C60 PDFBibTeX XMLCite \textit{T. Ishii} et al., Discrete Optim. 22, Part A, 111--121 (2016; Zbl 1387.90265) Full Text: DOI
Kammer, Frank; Tholey, Torsten Approximate tree decompositions of planar graphs in linear time. (English) Zbl 1348.68296 Theor. Comput. Sci. 645, 60-90 (2016). MSC: 68W25 05C10 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{F. Kammer} and \textit{T. Tholey}, Theor. Comput. Sci. 645, 60--90 (2016; Zbl 1348.68296) Full Text: DOI
Ishii, Toshimasa; Ono, Hirotaka; Uno, Yushi (Total) vector domination for graphs with bounded branchwidth. (English) Zbl 1337.05082 Discrete Appl. Math. 207, 80-89 (2016). MSC: 05C69 05C10 PDFBibTeX XMLCite \textit{T. Ishii} et al., Discrete Appl. Math. 207, 80--89 (2016; Zbl 1337.05082) Full Text: DOI
Golovach, Petr A.; Requilé, Clément; Thilikos, Dimitrios M. Variants of plane diameter completion. (English) Zbl 1378.68078 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 30-42 (2015). MSC: 68Q25 05C10 05C85 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 30--42 (2015; Zbl 1378.68078) Full Text: DOI arXiv
Hall, Dennis A characterization of tangle matroids. (English) Zbl 1310.05049 Ann. Comb. 19, No. 1, 125-130 (2015). MSC: 05B35 05B40 PDFBibTeX XMLCite \textit{D. Hall}, Ann. Comb. 19, No. 1, 125--130 (2015; Zbl 1310.05049) Full Text: DOI
Biedl, Therese On triangulating \(k\)-outerplanar graphs. (English) Zbl 1304.05021 Discrete Appl. Math. 181, 275-279 (2015). MSC: 05C10 PDFBibTeX XMLCite \textit{T. Biedl}, Discrete Appl. Math. 181, 275--279 (2015; Zbl 1304.05021) Full Text: DOI arXiv
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. Dynamic programming for graphs on surfaces. (English) Zbl 1321.05276 ACM Trans. Algorithms 10, No. 2, Article No. 8, 26 p. (2014). MSC: 05C85 68Q25 90C39 PDFBibTeX XMLCite \textit{J. Rué} et al., ACM Trans. Algorithms 10, No. 2, Article No. 8, 26 p. (2014; Zbl 1321.05276) Full Text: DOI Link
Ma, Jing; Margulies, Susan; Hicks, Illya V.; Goins, Edray Branch decomposition heuristics for linear matroids. (English) Zbl 1284.05053 Discrete Optim. 10, No. 2, 102-119 (2013). MSC: 05B35 PDFBibTeX XMLCite \textit{J. Ma} et al., Discrete Optim. 10, No. 2, 102--119 (2013; Zbl 1284.05053) Full Text: DOI
Gu, Qian-Ping; Tamaki, Hisao Improved bounds on the planar branchwidth with respect to the largest grid minor size. (English) Zbl 1257.05028 Algorithmica 64, No. 3, 416-453 (2012). MSC: 05C10 05C83 05C78 05C65 PDFBibTeX XMLCite \textit{Q.-P. Gu} and \textit{H. Tamaki}, Algorithmica 64, No. 3, 416--453 (2012; Zbl 1257.05028) Full Text: DOI
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Fast minor testing in planar graphs. (English) Zbl 1254.05185 Algorithmica 64, No. 1, 69-84 (2012). Reviewer: Ján Plesník (Bratislava) MSC: 05C83 05C10 05C85 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Algorithmica 64, No. 1, 69--84 (2012; Zbl 1254.05185) Full Text: DOI Link
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. Dynamic programming for \(H\)-minor-free graphs. (English) Zbl 1364.68231 Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 86-97 (2012). MSC: 68Q25 05C83 05C85 90C39 PDFBibTeX XMLCite \textit{J. Rué} et al., Lect. Notes Comput. Sci. 7434, 86--97 (2012; Zbl 1364.68231) Full Text: DOI
Sau, Ignasi; Thilikos, Dimitrios M. On self-duality of branchwidth in graphs of bounded genus. (English) Zbl 1237.05135 Discrete Appl. Math. 159, No. 17, 2184-2186 (2011). MSC: 05C60 05C10 PDFBibTeX XMLCite \textit{I. Sau} and \textit{D. M. Thilikos}, Discrete Appl. Math. 159, No. 17, 2184--2186 (2011; Zbl 1237.05135) Full Text: DOI
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Faster parameterized algorithms for minor containment. (English) Zbl 1228.68035 Theor. Comput. Sci. 412, No. 50, 7018-7028 (2011). MSC: 68Q25 05C83 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Theor. Comput. Sci. 412, No. 50, 7018--7028 (2011; Zbl 1228.68035) Full Text: DOI
Thilikos, Dimitrios M. Fast sub-exponential algorithms and compactness in planar graphs. (English) Zbl 1346.68117 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 358-369 (2011). MSC: 68Q25 05C10 05C85 PDFBibTeX XMLCite \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 6942, 358--369 (2011; Zbl 1346.68117) Full Text: DOI
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V. Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. (English) Zbl 1200.05223 Algorithmica 58, No. 3, 790-810 (2010). MSC: 05C85 05C10 05C45 PDFBibTeX XMLCite \textit{F. Dorn} et al., Algorithmica 58, No. 3, 790--810 (2010; Zbl 1200.05223) Full Text: DOI Link
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M. Dynamic programming for graphs on surfaces. (English) Zbl 1288.05286 Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 372-383 (2010). MSC: 05C85 68Q25 90C39 PDFBibTeX XMLCite \textit{J. Rué} et al., Lect. Notes Comput. Sci. 6198, 372--383 (2010; Zbl 1288.05286) Full Text: DOI arXiv Link
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Fast minor testing in planar graphs. (English) Zbl 1287.05141 de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 97-109 (2010). MSC: 05C85 05C10 05C83 68Q25 90C39 PDFBibTeX XMLCite \textit{I. Adler} et al., Lect. Notes Comput. Sci. 6346, 97--109 (2010; Zbl 1287.05141) Full Text: DOI Link
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M. Faster parameterized algorithms for minor containment. (English) Zbl 1285.68206 Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 322-333 (2010). MSC: 68W05 05C83 05C85 68Q25 PDFBibTeX XMLCite \textit{I. Adler} et al., Lect. Notes Comput. Sci. 6139, 322--333 (2010; Zbl 1285.68206) Full Text: DOI
Fomin, Fedor V.; Mazoit, Frédéric; Todinca, Ioan Computing branchwidth via efficient triangulations and blocks. (English) Zbl 1211.05163 Discrete Appl. Math. 157, No. 12, 2726-2736 (2009). MSC: 05C85 05C12 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 157, No. 12, 2726--2736 (2009; Zbl 1211.05163) Full Text: DOI HAL
Paul, Christophe; Telle, Jan Arne Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches. (English) Zbl 1229.05153 Discrete Math. 309, No. 6, 1467-1475 (2009). MSC: 05C35 05C40 05C05 PDFBibTeX XMLCite \textit{C. Paul} and \textit{J. A. Telle}, Discrete Math. 309, No. 6, 1467--1475 (2009; Zbl 1229.05153) Full Text: DOI
Mazoit, Frédéric; Thomassé, Stéphan Branchwidth of graphic matroids. (English) Zbl 1130.05017 Hilton, Anthony (ed.) et al., Surveys in combinatorics 2007. Papers from the 21st British combinatorial conference, Reading, UK, July 8–13, 2007. Cambridge: Cambridge University Press (ISBN 978-0-521-69823-8/pbk). London Mathematical Society Lecture Note Series 346, 275-286 (2007). Reviewer: Kelly J. Pearson (Murray) MSC: 05B35 PDFBibTeX XMLCite \textit{F. Mazoit} and \textit{S. Thomassé}, Lond. Math. Soc. Lect. Note Ser. 346, 275--286 (2007; Zbl 1130.05017)
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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{I. V. Hicks}, INFORMS J. Comput. 17, No. 4, 402--412 (2005; Zbl 1239.05176) Full Text: DOI Link
Hicks, Illya V. Graphs, branchwidth, and tangles! Oh my! (English) Zbl 1067.68103 Networks 45, No. 2, 55-60 (2005). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{I. V. Hicks}, Networks 45, No. 2, 55--60 (2005; Zbl 1067.68103) Full Text: DOI
Hicks, Illya V. Branch decompositions and minor containment. (English) Zbl 1031.05121 Networks 43, No. 1, 1-9 (2004). MSC: 05C85 68R10 05C70 05C83 PDFBibTeX XMLCite \textit{I. V. Hicks}, Networks 43, No. 1, 1--9 (2004; Zbl 1031.05121) Full Text: DOI
Koster, Arie M. C. A.; Bodlaender, Hans L.; van Hoesel, Stan P. M. Treewidth: computational experiments. (English) Zbl 1409.05176 Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 54-57 (2001). MSC: 05C78 05-04 PDFBibTeX XMLCite \textit{A. M. C. A. Koster} et al., Electron. Notes Discrete Math. 8, 54--57 (2001; Zbl 1409.05176) Full Text: Link
Bodlaender, Hans L.; Thilikos, Dimitrios M. Graphs with branchwidth at most three. (English) Zbl 0946.68103 J. Algorithms 32, No. 2, 167-194 (1999). MSC: 68R10 68W10 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{D. M. Thilikos}, J. Algorithms 32, No. 2, 167--194 (1999; Zbl 0946.68103) Full Text: DOI Link
Kloks, Ton; Kratochvíl, Jan; Müller, Haiko New branchwidth territories. (English) Zbl 0924.05063 Meinel, Christoph (ed.) et al., STACS 99. 16th annual symposium on Theoretical aspects of computer science, Trier, Germany, March 4–6, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1563, 173-183 (1999). Reviewer: H.Bodlaender (Utrecht) MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 1563, 173--183 (1999; Zbl 0924.05063)
Bienstock, Daniel; Langston, Michael A. Algorithmic implications of the graph minor theorem. (English) Zbl 0831.05022 Ball, M. O. (ed.) et al., Network models. Amsterdam: North-Holland. Handb. Oper. Res. Manage. Sci. 7, 481-502 (1995). Reviewer: C.J.Colbourn (Waterloo/Ontario) MSC: 05C10 05C38 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{D. Bienstock} and \textit{M. A. Langston}, Handb. Oper. Res. Manage. Sci. 7, 481--502 (1995; Zbl 0831.05022)