Chen, Hong-Yu; Lai, Hong-Jian On the linear arboricity of graphs with treewidth at most four. (English) Zbl 1518.05151 Graphs Comb. 39, No. 4, Paper No. 70, 15 p. (2023). MSC: 05C70 05C35 05C07 05C15 05C12 05C75 05C05 PDFBibTeX XMLCite \textit{H.-Y. Chen} and \textit{H.-J. Lai}, Graphs Comb. 39, No. 4, Paper No. 70, 15 p. (2023; Zbl 1518.05151) Full Text: DOI
Abrishami, Tara; Chudnovsky, Maria; Hajebi, Sepehr; Spirkl, Sophie Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs. (English) Zbl 1517.05121 Electron. J. Comb. 30, No. 2, Research Paper P2.42, 19 p. (2023). MSC: 05C60 05C70 PDFBibTeX XMLCite \textit{T. Abrishami} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.42, 19 p. (2023; Zbl 1517.05121) Full Text: DOI arXiv
Araújo, Rafael; Sampaio, Rudini Domination and convexity problems in the target set selection model. (English) Zbl 1509.05138 Discrete Appl. Math. 330, 14-23 (2023). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{R. Araújo} and \textit{R. Sampaio}, Discrete Appl. Math. 330, 14--23 (2023; Zbl 1509.05138) Full Text: DOI
Lardas, Emmanouil; Protopapas, Evangelos; Thilikos, Dimitrios M.; Zoros, Dimitris On strict brambles. (English) Zbl 1509.05132 Graphs Comb. 39, No. 2, Paper No. 24, 26 p. (2023). MSC: 05C60 05C70 05C05 05C75 05C83 68Q17 PDFBibTeX XMLCite \textit{E. Lardas} et al., Graphs Comb. 39, No. 2, Paper No. 24, 26 p. (2023; Zbl 1509.05132) Full Text: DOI arXiv
Araújo, Júlio; Bougeret, Marin; Campos, Victor A.; Sau, Ignasi Parameterized complexity of computing maximum minimal blocking and hitting sets. (English) Zbl 1507.68222 Algorithmica 85, No. 2, 444-491 (2023). MSC: 68R10 05C69 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 85, No. 2, 444--491 (2023; Zbl 1507.68222) Full Text: DOI arXiv
Abrishami, Tara; Chudnovsky, Maria; Vušković, Kristina Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree. (English) Zbl 1497.05179 J. Comb. Theory, Ser. B 157, 144-175 (2022). MSC: 05C60 05C70 05C05 05C75 PDFBibTeX XMLCite \textit{T. Abrishami} et al., J. Comb. Theory, Ser. B 157, 144--175 (2022; Zbl 1497.05179) Full Text: DOI arXiv
Ueckerdt, Torsten; Wood, David R.; Yi, Wendy An improved planar graph product structure theorem. (English) Zbl 1527.05046 Electron. J. Comb. 29, No. 2, Research Paper P2.51, 12 p. (2022). Reviewer: Guillermo Pineda Villavicencio MSC: 05C10 05C76 05C70 05C05 PDFBibTeX XMLCite \textit{T. Ueckerdt} et al., Electron. J. Comb. 29, No. 2, Research Paper P2.51, 12 p. (2022; Zbl 1527.05046) Full Text: DOI arXiv
Bonomo-Braberman, Flavia; Gonzalez, Carolina Lucía A new approach on locally checkable problems. (English) Zbl 1486.05293 Discrete Appl. Math. 314, 53-80 (2022). MSC: 05C85 05C69 05C70 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} and \textit{C. L. Gonzalez}, Discrete Appl. Math. 314, 53--80 (2022; Zbl 1486.05293) Full Text: DOI arXiv
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese Structural parameterizations of clique coloring. (English) Zbl 1518.68268 Algorithmica 84, No. 2, 273-303 (2022). MSC: 68R10 05C15 05C69 68Q27 PDFBibTeX XMLCite \textit{L. Jaffke} et al., Algorithmica 84, No. 2, 273--303 (2022; Zbl 1518.68268) Full Text: DOI
Harp, Michael; Jackson, Elijah; Jensen, David; Speeter, Noah A new lower bound on graph gonality. (English) Zbl 1480.05080 Discrete Appl. Math. 309, 172-179 (2022). MSC: 05C40 05C09 05C70 PDFBibTeX XMLCite \textit{M. Harp} et al., Discrete Appl. Math. 309, 172--179 (2022; Zbl 1480.05080) Full Text: DOI arXiv
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structurally parameterized \(d\)-scattered set. (English) Zbl 1479.05081 Discrete Appl. Math. 308, 168-186 (2022). MSC: 05C12 05C69 68R10 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., Discrete Appl. Math. 308, 168--186 (2022; Zbl 1479.05081) Full Text: DOI
Pilipczuk, Marcin; Sintiari, Ni Luh Dewi; Thomassé, Stéphan; Trotignon, Nicolas (Theta, triangle)-free and (even hole, \(K_4)\)-free graphs. II: Bounds on treewidth. (English) Zbl 1522.05038 J. Graph Theory 97, No. 4, 624-641 (2021). MSC: 05C05 05C75 05C69 05C35 PDFBibTeX XMLCite \textit{M. Pilipczuk} et al., J. Graph Theory 97, No. 4, 624--641 (2021; Zbl 1522.05038) Full Text: DOI arXiv
Gaikwad, Ajinkya; Maity, Soumen; Tripathi, Shuvam Kant The balanced satisfactory partition problem. (English) Zbl 1490.68154 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 322-336 (2021). MSC: 68R10 05C70 68Q27 PDFBibTeX XMLCite \textit{A. Gaikwad} et al., Lect. Notes Comput. Sci. 12607, 322--336 (2021; Zbl 1490.68154) Full Text: DOI
Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. I: Graph classes with a forbidden structure. (English) Zbl 1479.05308 SIAM J. Discrete Math. 35, No. 4, 2618-2646 (2021). MSC: 05C75 05C05 05C69 05C83 05C40 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dallard} et al., SIAM J. Discrete Math. 35, No. 4, 2618--2646 (2021; Zbl 1479.05308) Full Text: DOI arXiv
Hommelsheim, Felix; Muehlenthaler, Moritz; Schaudt, Oliver How to secure matchings against edge failures. (English) Zbl 1528.68295 SIAM J. Discrete Math. 35, No. 3, 2265-2292 (2021). MSC: 68R10 05C40 05C70 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hommelsheim} et al., SIAM J. Discrete Math. 35, No. 3, 2265--2292 (2021; Zbl 1528.68295) Full Text: DOI arXiv
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese Structural parameterizations of clique coloring. (English) Zbl 1518.68269 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 49, 15 p. (2020). MSC: 68R10 05C15 05C69 68Q27 PDFBibTeX XMLCite \textit{L. Jaffke} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 49, 15 p. (2020; Zbl 1518.68269) Full Text: DOI arXiv
van Dobben de Bruyn, Josse; Gijswijt, Dion Treewidth is a lower bound on graph gonality. (English) Zbl 1477.05125 Algebr. Comb. 3, No. 4, 941-953 (2020). Reviewer: Alberto Luis Delgado (Normal) MSC: 05C57 05C83 14T99 14H51 PDFBibTeX XMLCite \textit{J. van Dobben de Bruyn} and \textit{D. Gijswijt}, Algebr. Comb. 3, No. 4, 941--953 (2020; Zbl 1477.05125) Full Text: DOI arXiv
Botler, Fábio; Sambinelli, Maycon; Coelho, Rafael S.; Lee, Orlando Gallai’s path decomposition conjecture for graphs with treewidth at most 3. (English) Zbl 1495.05247 J. Graph Theory 93, No. 3, 328-349 (2020). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{F. Botler} et al., J. Graph Theory 93, No. 3, 328--349 (2020; Zbl 1495.05247) Full Text: DOI arXiv
Lee, Jon; Skipper, Daphne Volume computation for sparse Boolean quadric relaxations. (English) Zbl 1433.90086 Discrete Appl. Math. 275, 79-94 (2020). MSC: 90C09 90C27 52B12 05C62 PDFBibTeX XMLCite \textit{J. Lee} and \textit{D. Skipper}, Discrete Appl. Math. 275, 79--94 (2020; Zbl 1433.90086) Full Text: DOI arXiv
Gómez, Renzo; Wakabayashi, Yoshiko Nontrivial path covers of graphs: existence, minimization and maximization. (English) Zbl 1434.90209 J. Comb. Optim. 39, No. 2, 437-456 (2020). MSC: 90C35 05C70 90C27 PDFBibTeX XMLCite \textit{R. Gómez} and \textit{Y. Wakabayashi}, J. Comb. Optim. 39, No. 2, 437--456 (2020; Zbl 1434.90209) Full Text: DOI
Bulteau, Laurent; Dabrowski, Konrad K.; Fertin, Guillaume; Johnson, Matthew; Paulusma, Daniël; Vialette, Stéphane Finding a small number of colourful components. (English) Zbl 1514.68204 Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019). MSC: 68R10 05C15 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{L. Bulteau} et al., LIPIcs -- Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019; Zbl 1514.68204) Full Text: DOI arXiv
Hommelsheim, Felix; Mühlenthaler, Moritz; Schaudt, Oliver How to secure matchings against edge failures. (English) Zbl 1528.68296 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019). MSC: 68R10 05C40 05C70 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hommelsheim} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019; Zbl 1528.68296) Full Text: DOI
Aboulker, Pierre; Fiorini, Samuel; Huynh, Tony; Macchia, Marco; Seif, Johanna Extension complexity of the correlation polytope. (English) Zbl 1476.05037 Oper. Res. Lett. 47, No. 1, 47-51 (2019). MSC: 05C10 05C75 52B12 PDFBibTeX XMLCite \textit{P. Aboulker} et al., Oper. Res. Lett. 47, No. 1, 47--51 (2019; Zbl 1476.05037) Full Text: DOI arXiv
Bai, Zongwen; Tu, Jianhua; Shi, Yongtang An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth. (English) Zbl 1464.05303 Discrete Math. Theor. Comput. Sci. 21, No. 4, Paper No. 17, 13 p. (2019). MSC: 05C70 05C85 05C35 90C27 90C39 68W20 PDFBibTeX XMLCite \textit{Z. Bai} et al., Discrete Math. Theor. Comput. Sci. 21, No. 4, Paper No. 17, 13 p. (2019; Zbl 1464.05303) Full Text: arXiv Link
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structural parameters, tight bounds, and approximation for \((k, r)\)-center. (English) Zbl 1414.05102 Discrete Appl. Math. 264, 90-117 (2019). MSC: 05C12 05C69 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., Discrete Appl. Math. 264, 90--117 (2019; Zbl 1414.05102) Full Text: DOI arXiv Link
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. (English) Zbl 1418.05120 Algorithmica 81, No. 3, 986-1005 (2019). MSC: 05C85 05C35 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Liedloff} et al., Algorithmica 81, No. 3, 986--1005 (2019; Zbl 1418.05120) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Kim, Eun Jung; Lampis, Michael New results on directed edge dominating set. (English) Zbl 1512.68191 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018). MSC: 68R10 05C20 05C69 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018; Zbl 1512.68191) Full Text: DOI arXiv
Wan, Pengfei; Tu, Jianhua; Zhang, Shenggui; Li, Binlong Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. (English) Zbl 1427.05170 Appl. Math. Comput. 332, 42-47 (2018). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Wan} et al., Appl. Math. Comput. 332, 42--47 (2018; Zbl 1427.05170) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 1427.68353 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 574-586 (2018). MSC: 68W05 05C62 05C69 05C83 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{M. de Berg} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 574--586 (2018; Zbl 1427.68353) Full Text: DOI arXiv
Dujmović, Vida; Joret, Gwenaël; Morin, Pat; Norin, Sergey; Wood, David R. Corrigendum to: “Orthogonal tree decompositions of graphs”. (English) Zbl 1440.05167 SIAM J. Discrete Math. 32, No. 4, 3003-3004 (2018). MSC: 05C70 05C83 05C62 05C75 05C05 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 32, No. 4, 3003--3004 (2018; Zbl 1440.05167) Full Text: DOI
Angel, Eric; Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael Parameterized power vertex cover. (English) Zbl 1401.05229 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 10, 18 p. (2018). MSC: 05C70 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{E. Angel} et al., Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 10, 18 p. (2018; Zbl 1401.05229) Full Text: arXiv Link
Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper Fast Hamiltonicity checking via bases of perfect matchings. (English) Zbl 1426.68117 J. ACM 65, No. 3, Article No. 12, 46 p. (2018). MSC: 68Q25 05C45 05C70 PDFBibTeX XMLCite \textit{M. Cygan} et al., J. ACM 65, No. 3, Article No. 12, 46 p. (2018; Zbl 1426.68117) Full Text: DOI arXiv
Fomin, Fedorr V.; Lokshtanov, Daniel; Saurabh, Saket Excluded grid minors and efficient polynomial-time approximation schemes. (English) Zbl 1426.68303 J. ACM 65, No. 2, Article No. 10, 44 p. (2018). MSC: 68W25 05C62 05C69 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. ACM 65, No. 2, Article No. 10, 44 p. (2018; Zbl 1426.68303) Full Text: DOI
Bliem, Bernhard; Woltran, Stefan Defensive alliances in graphs of bounded treewidth. (English) Zbl 1401.05211 Discrete Appl. Math. 251, 334-339 (2018). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{B. Bliem} and \textit{S. Woltran}, Discrete Appl. Math. 251, 334--339 (2018; Zbl 1401.05211) Full Text: DOI arXiv
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
Li, Bi; Moataz, Fatima Zahra; Nisse, Nicolas; Suchan, Karol Minimum size tree-decompositions. (English) Zbl 1387.05205 Discrete Appl. Math. 245, 109-127 (2018). MSC: 05C70 05C05 05C12 05C40 68Q25 PDFBibTeX XMLCite \textit{B. Li} et al., Discrete Appl. Math. 245, 109--127 (2018; Zbl 1387.05205) Full Text: DOI
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. (English) Zbl 1390.68344 Algorithmica 80, No. 4, 1146-1169 (2018). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 80, No. 4, 1146--1169 (2018; Zbl 1390.68344) Full Text: DOI arXiv
Dujmović, Vida; Joret, Gwenaël; Morin, Pat; Norin, Sergey; Wood, David R. Orthogonal tree decompositions of graphs. (English) Zbl 1383.05257 SIAM J. Discrete Math. 32, No. 2, 839-863 (2018); corrigendum ibid. 32, No. 4, 3003-3004 (2018). MSC: 05C70 05C05 05C83 05C62 05C75 PDFBibTeX XMLCite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 32, No. 2, 839--863 (2018; Zbl 1383.05257) Full Text: DOI arXiv
Coudert, David; Ducoffe, Guillaume Revisiting decomposition by clique separators. (English) Zbl 1383.05256 SIAM J. Discrete Math. 32, No. 1, 682-694 (2018). MSC: 05C70 05C10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{D. Coudert} and \textit{G. Ducoffe}, SIAM J. Discrete Math. 32, No. 1, 682--694 (2018; Zbl 1383.05256) Full Text: DOI
Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik Matchings with lower quotas: algorithms and complexity. (English) Zbl 1386.68115 Algorithmica 80, No. 1, 185-208 (2018). MSC: 68R10 05C70 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Arulselvan} et al., Algorithmica 80, No. 1, 185--208 (2018; Zbl 1386.68115) Full Text: DOI
Cameron, Kathie; da Silva, Murilo V. G.; Huang, Shenwei; Vušković, Kristina Structure and algorithms for (cap, even hole)-free graphs. (English) Zbl 1376.05132 Discrete Math. 341, No. 2, 463-473 (2018). MSC: 05C75 05C85 05C69 05C12 05C38 05C35 05C07 PDFBibTeX XMLCite \textit{K. Cameron} et al., Discrete Math. 341, No. 2, 463--473 (2018; Zbl 1376.05132) Full Text: DOI arXiv Link
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structural parameters, tight bounds, and approximation for \((k,r)\)-center. (English) Zbl 1457.68126 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 50, 13 p. (2017). MSC: 68Q25 05C12 05C69 05C85 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 50, 13 p. (2017; Zbl 1457.68126) Full Text: DOI
Botler, Fábio; Sambinelli, Maycon Gallai’s conjecture for graphs with treewidth 3. (English) Zbl 1383.05252 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 147-152 (2017). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{F. Botler} and \textit{M. Sambinelli}, Electron. Notes Discrete Math. 62, 147--152 (2017; Zbl 1383.05252) Full Text: DOI
Chaplick, Steven; Zeman, Peter Combinatorial problems on \(H\)-graphs. (English) Zbl 1378.05051 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 223-229 (2017). MSC: 05C15 05C69 05C60 PDFBibTeX XMLCite \textit{S. Chaplick} and \textit{P. Zeman}, Electron. Notes Discrete Math. 61, 223--229 (2017; Zbl 1378.05051) Full Text: DOI arXiv
Dvořák, Zdeněk; Mnich, Matthias Large independent sets in triangle-free planar graphs. (English) Zbl 1371.68111 SIAM J. Discrete Math. 31, No. 2, 1355-1373 (2017). MSC: 68Q25 05C10 05C69 05C85 PDFBibTeX XMLCite \textit{Z. Dvořák} and \textit{M. Mnich}, SIAM J. Discrete Math. 31, No. 2, 1355--1373 (2017; Zbl 1371.68111) 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
Kintali, Shiva Directed width parameters and circumference of digraphs. (English) Zbl 1357.05052 Theor. Comput. Sci. 659, 83-87 (2017). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{S. Kintali}, Theor. Comput. Sci. 659, 83--87 (2017; Zbl 1357.05052) Full Text: DOI arXiv
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve Treewidth and pathwidth parameterized by the vertex cover number. (English) Zbl 1350.68136 Discrete Appl. Math. 216, Part 1, 114-129 (2017). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{M. Chapelle} et al., Discrete Appl. Math. 216, Part 1, 114--129 (2017; Zbl 1350.68136) Full Text: DOI arXiv
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin Characterizing width two for variants of treewidth. (English) Zbl 1350.05116 Discrete Appl. Math. 216, Part 1, 29-46 (2017). MSC: 05C69 05C70 05C05 03B15 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Discrete Appl. Math. 216, Part 1, 29--46 (2017; Zbl 1350.05116) Full Text: DOI arXiv
Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Squares of low clique number. (English) Zbl 1356.05102 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 195-198 (2016). MSC: 05C69 05C75 PDFBibTeX XMLCite \textit{P. Golovach} et al., Electron. Notes Discrete Math. 55, 195--198 (2016; Zbl 1356.05102) Full Text: DOI Link
Águeda, Raquel; Cohen, Nathann; Fujita, Shinya; Legay, Sylvain; Manoussakis, Yannis; Matsui, Yasuko; Montero, Leandro; Naserasr, Reza; Otachi, Yota; Sakuma, Tadashi; Tuza, Zsolt; Xu, Renyu Safe sets in graphs: graph classes and structural parameters. (English) Zbl 1483.68245 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 241-253 (2016). MSC: 68R10 05C69 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Águeda} et al., Lect. Notes Comput. Sci. 10043, 241--253 (2016; Zbl 1483.68245) Full Text: DOI HAL
Chen, Hao; Lei, Zihan; Liu, Tian; Tang, Ziyang; Wang, Chaoyi; Xu, Ke Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs. (English) Zbl 1348.05150 J. Comb. Optim. 32, No. 1, 95-110 (2016). MSC: 05C69 05C45 PDFBibTeX XMLCite \textit{H. Chen} et al., J. Comb. Optim. 32, No. 1, 95--110 (2016; Zbl 1348.05150) 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
Cifuentes, Diego; Parrilo, Pablo A. An efficient tree decomposition method for permanents and mixed discriminants. (English) Zbl 1329.15020 Linear Algebra Appl. 493, 45-81 (2016). Reviewer: C. M. da Fonseca (Safat) MSC: 15A15 68Q25 PDFBibTeX XMLCite \textit{D. Cifuentes} and \textit{P. A. Parrilo}, Linear Algebra Appl. 493, 45--81 (2016; Zbl 1329.15020) Full Text: DOI arXiv
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1378.68082 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, 212-223 (2015). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{J. Jeong} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 212--223 (2015; Zbl 1378.68082) Full Text: DOI arXiv
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve Large induced subgraphs via triangulations and CMSO. (English) Zbl 1357.05144 SIAM J. Comput. 44, No. 1, 54-87 (2015). MSC: 05C85 05C69 68W40 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 44, No. 1, 54--87 (2015; Zbl 1357.05144) Full Text: DOI arXiv
Li, Bi; Moataz, Fatima Zahra; Nisse, Nicolas; Suchan, Karol Minimum size tree-decompositions. (English) Zbl 1347.05158 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 21-27, electronic only (2015). MSC: 05C70 05C05 05C85 90C39 68Q17 PDFBibTeX XMLCite \textit{B. Li} et al., Electron. Notes Discrete Math. 50, 21--27 (2015; Zbl 1347.05158) Full Text: DOI
Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik Many-to-one matchings with lower quotas: algorithms and complexity. (English) Zbl 1386.68114 Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48970-3/pbk; 978-3-662-48971-0/ebook). Lecture Notes in Computer Science 9472, 176-187 (2015). MSC: 68R10 05C70 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Arulselvan} et al., Lect. Notes Comput. Sci. 9472, 176--187 (2015; Zbl 1386.68114) Full Text: DOI arXiv
Ito, Takehiro; Ono, Hirotaka; Otachi, Yota Reconfiguration of cliques in a graph. (English) Zbl 1462.05280 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9076, 212-223 (2015). MSC: 05C69 68Q25 05C17 05C85 PDFBibTeX XMLCite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 9076, 212--223 (2015; Zbl 1462.05280) Full Text: DOI arXiv
Alon, Noga; Mehrabian, Abbas Chasing a fast robber on planar graphs and random graphs. (English) Zbl 1305.05142 J. Graph Theory 78, No. 2, 81-96 (2015). MSC: 05C57 05C10 05C80 05C69 91A43 91A24 PDFBibTeX XMLCite \textit{N. Alon} and \textit{A. Mehrabian}, J. Graph Theory 78, No. 2, 81--96 (2015; Zbl 1305.05142) Full Text: DOI
Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese A single-exponential FPT algorithm for the \(K_4\)-minor cover problem. (English) Zbl 1357.68289 J. Comput. Syst. Sci. 81, No. 1, 186-207 (2015). MSC: 68W05 05C70 05C83 05C85 68Q25 PDFBibTeX XMLCite \textit{E. J. Kim} et al., J. Comput. Syst. Sci. 81, No. 1, 186--207 (2015; Zbl 1357.68289) Full Text: DOI
Bykova, Valentina; Illarionov, Roman On CLIQUE problem for sparse graphs of large dimension. (English) Zbl 1336.05077 Dudin, Alexander (ed.) et al., Information technologies and mathematical modelling. 13th international scientific conference, named after A. F. Terpugov, ITMM 2014, Anzhero-Sudzhensk, Russia, November 20–22, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13670-7/pbk; 978-3-319-13671-4/ebook). Communications in Computer and Information Science 487, 69-75 (2014). Reviewer: Sebastian Cioaba (Newark) MSC: 05C42 05C85 05C69 PDFBibTeX XMLCite \textit{V. Bykova} and \textit{R. Illarionov}, Commun. Comput. Inf. Sci. 487, 69--75 (2014; Zbl 1336.05077) Full Text: DOI
Gross, Jonathan L. Embeddings of graphs of fixed treewidth and bounded degree. (English) Zbl 1306.05162 Ars Math. Contemp. 7, No. 2, 379-403 (2014). MSC: 05C60 05C10 05C70 05C07 05C85 PDFBibTeX XMLCite \textit{J. L. Gross}, Ars Math. Contemp. 7, No. 2, 379--403 (2014; Zbl 1306.05162) Full Text: DOI
Farzan, Arash; Kamali, Shahin Compact navigation and distance oracles for graphs with small treewidth. (English) Zbl 1303.05188 Algorithmica 69, No. 1, 92-116 (2014). MSC: 05C85 05C70 05C12 68R10 PDFBibTeX XMLCite \textit{A. Farzan} and \textit{S. Kamali}, Algorithmica 69, No. 1, 92--116 (2014; Zbl 1303.05188) Full Text: DOI
Wang, Chaoyi; Chen, Hao; Lei, Zihan; Tang, Ziyang; Liu, Tian; Xu, Ke Tree convex bipartite graphs: NP-complete domination, Hamiltonicity and treewidth. (English) Zbl 1407.68198 Chen, Jianer (ed.) et al., Frontiers in algorithmics. 8th international workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8497, 252-263 (2014). MSC: 68Q17 05C45 05C69 68Q25 PDFBibTeX XMLCite \textit{C. Wang} et al., Lect. Notes Comput. Sci. 8497, 252--263 (2014; Zbl 1407.68198) Full Text: DOI
Furuse, Masanobu; Yamazaki, Koichi A revisit of the scheme for computing treewidth and minimum fill-in. (English) Zbl 1358.05278 Theor. Comput. Sci. 531, 66-76 (2014). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Furuse} and \textit{K. Yamazaki}, Theor. Comput. Sci. 531, 66--76 (2014; Zbl 1358.05278) Full Text: DOI
Campos, Victor; Klein, Sulamita; Sampaio, Rudini; Silva, Ana Fixed-parameter algorithms for the cocoloring problem. (English) Zbl 1284.05093 Discrete Appl. Math. 167, 52-60 (2014). MSC: 05C15 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Campos} et al., Discrete Appl. Math. 167, 52--60 (2014; Zbl 1284.05093) Full Text: DOI
Bykova, Valentina V. The clique minimal separator decomposition of a hypergraph. (Russian. English summary) Zbl 1521.05128 J. Sib. Fed. Univ., Math. Phys. 5, No. 1, 36-45 (2012). MSC: 05C65 05C69 PDFBibTeX XMLCite \textit{V. V. Bykova}, J. Sib. Fed. Univ., Math. Phys. 5, No. 1, 36--45 (2012; Zbl 1521.05128) Full Text: MNR
Fomin, Fedor V.; Villanger, Yngve Treewidth computation and extremal combinatorics. (English) Zbl 1289.05447 Combinatorica 32, No. 3, 289-308 (2012). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C69 68Q25 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, Combinatorica 32, No. 3, 289--308 (2012; Zbl 1289.05447) Full Text: DOI
Bazgan, Cristina; Toubaline, Sonia; Tuza, Zsolt The most vital nodes with respect to independent set and vertex cover. (English) Zbl 1236.05141 Discrete Appl. Math. 159, No. 17, 1933-1946 (2011). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Discrete Appl. Math. 159, No. 17, 1933--1946 (2011; Zbl 1236.05141) Full Text: DOI
Lee, Chuan-Min Weighted maximum-clique transversal sets of graphs. (English) Zbl 1237.05153 ISRN Discrete Math. 2011, Article ID 540834, 20 p. (2011). MSC: 05C69 68R10 PDFBibTeX XMLCite \textit{C.-M. Lee}, ISRN Discrete Math. 2011, Article ID 540834, 20 p. (2011; Zbl 1237.05153) Full Text: DOI
Fomin, Fedor V.; Villanger, Yngve Finding induced subgraphs via minimal triangulations. (English) Zbl 1230.68108 Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 383-394, electronic only (2010). MSC: 68Q25 05C85 05C69 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, LIPIcs -- Leibniz Int. Proc. Inform. 5, 383--394 (2010; Zbl 1230.68108) Full Text: DOI Link
Szeider, Stefan Not so easy problems for tree decomposable graphs. (English) Zbl 1231.05252 Acharya, B. D. (ed.) et al., Advances in discrete mathematics and applications: Mysore, 2008. Proceedings of the international conference on discrete mathematics (ICDM 2008), Mysore, India, June 6–10, 2008. Mysore: Ramanujan Mathematical Society (ISBN 978-93-80416-03-8/hbk). Ramanujan Mathematical Society Lecture Notes Series 13, 179-190 (2010). MSC: 05C85 05C15 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Szeider}, Ramanujan Math. Soc. Lect. Notes Ser. 13, 179--190 (2010; Zbl 1231.05252) Full Text: arXiv
Zenklusen, Rico Matching interdiction. (English) Zbl 1208.05120 Discrete Appl. Math. 158, No. 15, 1676-1690 (2010). MSC: 05C70 68W25 PDFBibTeX XMLCite \textit{R. Zenklusen}, Discrete Appl. Math. 158, No. 15, 1676--1690 (2010; Zbl 1208.05120) Full Text: DOI
Grigoriev, Alexander; Marchal, Bert; Usotskaya, Natalya Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph. (English) Zbl 1274.05449 van Leeuwen, Jan (ed.) et al., SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11265-2/pbk). Lecture Notes in Computer Science 5901, 452-464 (2010). MSC: 05C85 05C70 68W25 PDFBibTeX XMLCite \textit{A. Grigoriev} et al., Lect. Notes Comput. Sci. 5901, 452--464 (2010; Zbl 1274.05449) Full Text: DOI
Dorn, Frederic; Telle, Jan Arne Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm. (English) Zbl 1211.05065 Discrete Appl. Math. 157, No. 12, 2737-2746 (2009). MSC: 05C40 05C12 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{F. Dorn} and \textit{J. A. Telle}, Discrete Appl. Math. 157, No. 12, 2737--2746 (2009; Zbl 1211.05065) Full Text: DOI
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket Implicit branching and parameterized partial cover problems (extended abstract). (English) Zbl 1248.68541 Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9–11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPIcs – Leibniz International Proceedings in Informatics 2, 1-12, electronic only (2008). MSC: 68W05 05C85 05C70 68R10 68W40 PDFBibTeX XMLCite \textit{O. Amini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 2, 1--12 (2008; Zbl 1248.68541) Full Text: DOI Link
Gassner, Elisabeth; Hatzl, Johannes A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. (English) Zbl 1161.05336 Computing 82, No. 2-3, 171-187 (2008). MSC: 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{E. Gassner} and \textit{J. Hatzl}, Computing 82, No. 2--3, 171--187 (2008; Zbl 1161.05336) Full Text: DOI
Peng, Sheng-Lung; Yang, Yi-Chuan On the treewidth and pathwidth of biconvex bipartite graphs. (English) Zbl 1198.05144 Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. 4th international conference, TAMC 2007, Shanghai, China, May 22–25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72503-9/pbk). Lecture Notes in Computer Science 4484, 244-255 (2007). MSC: 05C85 05C69 05C70 68Q25 PDFBibTeX XMLCite \textit{S.-L. Peng} and \textit{Y.-C. Yang}, Lect. Notes Comput. Sci. 4484, 244--255 (2007; Zbl 1198.05144) Full Text: DOI
Chandran, L. Sunil; Sivadasan, Naveen Boxicity and treewidth. (English) Zbl 1121.05091 J. Comb. Theory, Ser. B 97, No. 5, 733-744 (2007). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{L. S. Chandran} and \textit{N. Sivadasan}, J. Comb. Theory, Ser. B 97, No. 5, 733--744 (2007; Zbl 1121.05091) Full Text: DOI arXiv
Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel Degree-constrained decompositions of graphs: Bounded treewidth and planarity. (English) Zbl 1088.68138 Theor. Comput. Sci. 355, No. 3, 389-395 (2006). MSC: 68R10 05C70 05C85 68W05 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Theor. Comput. Sci. 355, No. 3, 389--395 (2006; Zbl 1088.68138) Full Text: DOI
Fomin, Fedor V.; Thilikos, Dimtirios M. Dominating sets and local treewidth. (English) Zbl 1266.05164 Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 221-229 (2003). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. M. Thilikos}, Lect. Notes Comput. Sci. 2832, 221--229 (2003; Zbl 1266.05164) Full Text: DOI
Reed, B. A. Algorithmic aspects of tree width. (English) Zbl 1035.05090 Reed, Bruce A. (ed.) et al., Recent advances in algorithms and combinatorics. New York, NY: Springer (ISBN 0-387-95434-1/hbk). CMS Books Math./Ouvrages Math. SMC 11, 85-107 (2003). Reviewer: Hans L. Bodlaender (Utrecht) MSC: 05C85 68R10 90C39 05C70 05C05 05C83 PDFBibTeX XMLCite \textit{B. A. Reed}, CMS Books Math./Ouvrages Math. SMC 11, 85--107 (2003; Zbl 1035.05090)
Bellenbaum, Patrick; Diestel, Reinhard Two short proofs concerning tree-decompositions. (English) Zbl 1018.05081 Comb. Probab. Comput. 11, No. 6, 541-547 (2002). Reviewer: Oriol Serra (Barcelona) MSC: 05C70 PDFBibTeX XMLCite \textit{P. Bellenbaum} and \textit{R. Diestel}, Comb. Probab. Comput. 11, No. 6, 541--547 (2002; Zbl 1018.05081)
van der Holst, Hein On the “largeur d’arborescence”. (English) Zbl 0996.05034 J. Graph Theory 41, No. 1, 24-52 (2002). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C05 05C83 05C70 05C50 PDFBibTeX XMLCite \textit{H. van der Holst}, J. Graph Theory 41, No. 1, 24--52 (2002; Zbl 0996.05034) Full Text: DOI
Bodlaender, H. L.; van Antwerpen-de Fluiter, B. Parallel algorithms for series parallel graphs and graphs with treewidth two. (English) Zbl 0979.05095 Algorithmica 29, No. 4, 534-559 (2001). Reviewer: Haiko Müller (Leeds) MSC: 05C85 68R10 68W10 68Q25 05C62 05C70 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{B. van Antwerpen-de Fluiter}, Algorithmica 29, No. 4, 534--559 (2001; Zbl 0979.05095) Full Text: DOI
Perković, Ljubomir; Reed, Bruce An improved algorithm for finding tree decompositions of small width. (English) Zbl 1320.05128 Int. J. Found. Comput. Sci. 11, No. 3, 365-371 (2000). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{L. Perković} and \textit{B. Reed}, Int. J. Found. Comput. Sci. 11, No. 3, 365--371 (2000; Zbl 1320.05128) Full Text: DOI
Gupta, A.; Kaller, D.; Shermer, T. Linear-time algorithms for partial \(k\)-tree complements. (English) Zbl 0955.05093 Algorithmica 27, No. 3-4, 254-274 (2000). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C85 05C05 05C70 68R10 PDFBibTeX XMLCite \textit{A. Gupta} et al., Algorithmica 27, No. 3--4, 254--274 (2000; Zbl 0955.05093) Full Text: DOI
Bodlaender, H. L. (ed.) Special issue: Treewidth. (English) Zbl 0955.00018 Algorithmica 27, No. 3-4, 209-430 (2000). MSC: 00B15 68-06 05-06 PDFBibTeX XMLCite \textit{H. L. Bodlaender} (ed.), Algorithmica 27, No. 3--4, 209--430 (2000; Zbl 0955.00018) Full Text: DOI
Caro, Yair; Yuster, Raphael Graph decomposition of slim graphs. (English) Zbl 0937.05063 Graphs Comb. 15, No. 1, 5-19 (1999). Reviewer: P.Hell (Burnaby) MSC: 05C70 PDFBibTeX XMLCite \textit{Y. Caro} and \textit{R. Yuster}, Graphs Comb. 15, No. 1, 5--19 (1999; Zbl 0937.05063)
Thilikos, Dimitrios M.; Bodlaender, Hans L. Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems. (English) Zbl 1336.05138 Inf. Process. Lett. 61, No. 5, 227-232 (1997). MSC: 05C85 05C70 68Q25 68W25 PDFBibTeX XMLCite \textit{D. M. Thilikos} and \textit{H. L. Bodlaender}, Inf. Process. Lett. 61, No. 5, 227--232 (1997; Zbl 1336.05138) Full Text: DOI
Proskurowski, Andrzej; Sysło, Maciej; Winter, Paweł Plane embeddings of 2-trees and biconnected partial 2-trees. (English) Zbl 0862.05029 SIAM J. Discrete Math. 9, No. 4, 577-596 (1996). Reviewer: C.J.Colbourn (Burlington) MSC: 05C10 05C30 05C70 05C05 PDFBibTeX XMLCite \textit{A. Proskurowski} et al., SIAM J. Discrete Math. 9, No. 4, 577--596 (1996; Zbl 0862.05029) Full Text: DOI
Nešetřil, Jaroslav; Zhu, Xuding On bounded treewidth duality of graphs. (English) Zbl 0858.05045 J. Graph Theory 23, No. 2, 151-162 (1996). Reviewer: A.T.White (Kalamazoo) MSC: 05C15 05C70 05C05 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{X. Zhu}, J. Graph Theory 23, No. 2, 151--162 (1996; Zbl 0858.05045) Full Text: DOI
Borie, Richard; Gupta, Arobinda Balanced decompositions for partial \(k\)-trees. (English) Zbl 0803.05044 Congr. Numerantium 98, 33-38 (1993). Reviewer: H.L.Bodlaender MSC: 05C70 05C05 05C85 68W15 PDFBibTeX XMLCite \textit{R. Borie} and \textit{A. Gupta}, Congr. Numerantium 98, 33--38 (1993; Zbl 0803.05044)
Bodlaender, Hans L.; Kloks, Ton Better algorithms for the pathwidth and treewidth of graphs. (English) Zbl 0764.68108 Automata, languages and programming, Proc. 18th Int. Colloq., Madrid/Spain 1991, Lect. Notes Comput. Sci. 510, 544-555 (1991). MSC: 68R10 05C70 05C05 05C38 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{T. Kloks}, Lect. Notes Comput. Sci. 510, 544--555 (1991; Zbl 0764.68108)
Bodlaender, Hans L. Improved self-reduction algorithms for graphs with bounded treewidth. (English) Zbl 0768.68033 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 232-244 (1990). MSC: 68Q25 68R10 05C70 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Lect. Notes Comput. Sci. 411, 232--244 (1990; Zbl 0768.68033)