Fomin, Fedor V.; Ramamoorthi, Vijayaragunathan On the parameterized complexity of the expected coverage problem. (English) Zbl 07523541 Theory Comput. Syst. 66, No. 2, 432-453 (2022). MSC: 68Qxx 05Cxx 90Bxx PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{V. Ramamoorthi}, Theory Comput. Syst. 66, No. 2, 432--453 (2022; Zbl 07523541) Full Text: DOI OpenURL
Bonomo-Braberman, Flavia; Gonzalez, Carolina Lucía A new approach on locally checkable problems. (English) Zbl 07510690 Discrete Appl. Math. 314, 53-80 (2022). MSC: 05C85 05C69 05C70 PDF BibTeX XML Cite \textit{F. Bonomo-Braberman} and \textit{C. L. Gonzalez}, Discrete Appl. Math. 314, 53--80 (2022; Zbl 07510690) Full Text: DOI OpenURL
Masařík, Tomáš; Pilipczuk, Marcin; Rzążewski, Paweł; Sorge, Manuel Constant congestion brambles in directed graphs. (English) Zbl 07510396 SIAM J. Discrete Math. 36, No. 2, 922-938 (2022). MSC: 05C20 05C40 05C83 PDF BibTeX XML Cite \textit{T. Masařík} et al., SIAM J. Discrete Math. 36, No. 2, 922--938 (2022; Zbl 07510396) Full Text: DOI OpenURL
Liu, Ke; Cao, Mengyu; Lu, Mei Treewidth of the generalized Kneser graphs. (English) Zbl 07503060 Electron. J. Comb. 29, No. 1, Research Paper P1.57, 19 p. (2022). MSC: 05C75 05D05 PDF BibTeX XML Cite \textit{K. Liu} et al., Electron. J. Comb. 29, No. 1, Research Paper P1.57, 19 p. (2022; Zbl 07503060) Full Text: DOI OpenURL
Baste, Julien; Thilikos, Dimitrios M. Contraction bidimensionality of geometric intersection graphs. (English) Zbl 07498369 Algorithmica 84, No. 2, 510-531 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Baste} and \textit{D. M. Thilikos}, Algorithmica 84, No. 2, 510--531 (2022; Zbl 07498369) Full Text: DOI OpenURL
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese Structural parameterizations of clique coloring. (English) Zbl 07498360 Algorithmica 84, No. 2, 273-303 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{L. Jaffke} et al., Algorithmica 84, No. 2, 273--303 (2022; Zbl 07498360) Full Text: DOI OpenURL
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. (English) Zbl 07497778 Discrete Appl. Math. 312, 72-85 (2022). MSC: 68R10 68Q25 05C85 91A43 05C05 PDF BibTeX XML Cite \textit{G. Mescoff} et al., Discrete Appl. Math. 312, 72--85 (2022; Zbl 07497778) Full Text: DOI OpenURL
Behague, Natalie C.; Bonato, Anthony; Huggan, Melissa A.; Marbach, Trent G.; Pittman, Brittany The localization capture time of a graph. (English) Zbl 07496388 Theor. Comput. Sci. 911, 80-91 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. C. Behague} et al., Theor. Comput. Sci. 911, 80--91 (2022; Zbl 07496388) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI OpenURL
Faenza, Yuri; Muñoz, Gonzalo; Pokutta, Sebastian New limits of treewidth-based tractability in optimization. (English) Zbl 07495396 Math. Program. 191, No. 2 (A), 559-594 (2022). MSC: 90C35 90C05 90C22 PDF BibTeX XML Cite \textit{Y. Faenza} et al., Math. Program. 191, No. 2 (A), 559--594 (2022; Zbl 07495396) Full Text: DOI OpenURL
Gupta, Sushmita; Saurabh, Saket; Zehavi, Meirav On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization). (English) Zbl 07489485 SIAM J. Discrete Math. 36, No. 1, 596-681 (2022). MSC: 91B68 90C27 05C85 PDF BibTeX XML Cite \textit{S. Gupta} et al., SIAM J. Discrete Math. 36, No. 1, 596--681 (2022; Zbl 07489485) Full Text: DOI OpenURL
Hecher, Markus Treewidth-aware reductions of normal ASP to SAT - is normal ASP Harder than SAT after all? (English) Zbl 07482903 Artif. Intell. 304, Article ID 103651, 24 p. (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{M. Hecher}, Artif. Intell. 304, Article ID 103651, 24 p. (2022; Zbl 07482903) Full Text: DOI OpenURL
Eppstein, David; Frishberg, Daniel; Maxwell, William On the treewidth of Hanoi graphs. (English) Zbl 07477129 Theor. Comput. Sci. 906, 1-17 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Eppstein} et al., Theor. Comput. Sci. 906, 1--17 (2022; Zbl 07477129) Full Text: DOI arXiv OpenURL
Gaikwad, Ajinkya; Maity, Soumen; Tripathi, Shuvam Kant Parameterized complexity of satisfactory partition problem. (English) Zbl 07477127 Theor. Comput. Sci. 907, 113-127 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Gaikwad} et al., Theor. Comput. Sci. 907, 113--127 (2022; Zbl 07477127) Full Text: DOI OpenURL
Bojańczyk, Mikołaj; Pilipczuk, Michał Optimizing tree decompositions in MSO. (English) Zbl 07471715 Log. Methods Comput. Sci. 18, No. 1, Paper No. 26, 36 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{M. Bojańczyk} and \textit{M. Pilipczuk}, Log. Methods Comput. Sci. 18, No. 1, Paper No. 26, 36 p. (2022; Zbl 07471715) Full Text: arXiv Link OpenURL
Carbonnel, Clément; Romero, Miguel; Živný, Stanislav The complexity of general-valued constraint satisfaction problems seen from the other side. (English) Zbl 07470541 SIAM J. Comput. 51, No. 1, 19-69 (2022). MSC: 68Q25 68R01 03B70 90C05 PDF BibTeX XML Cite \textit{C. Carbonnel} et al., SIAM J. Comput. 51, No. 1, 19--69 (2022; Zbl 07470541) Full Text: DOI arXiv OpenURL
Di Giacomo, Emilio; Liotta, Giuseppe; Montecchiani, Fabrizio Orthogonal planarity testing of bounded treewidth graphs. (English) Zbl 07466701 J. Comput. Syst. Sci. 125, 129-148 (2022). MSC: 68-XX PDF BibTeX XML Cite \textit{E. Di Giacomo} et al., J. Comput. Syst. Sci. 125, 129--148 (2022; Zbl 07466701) Full Text: DOI OpenURL
Kortsarz, Guy; Nutov, Zeev The minimum degree group Steiner problem. (English) Zbl 07456395 Discrete Appl. Math. 309, 229-239 (2022). MSC: 68Wxx 68Qxx 68Rxx PDF BibTeX XML Cite \textit{G. Kortsarz} and \textit{Z. Nutov}, Discrete Appl. Math. 309, 229--239 (2022; Zbl 07456395) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{M. Harp} et al., Discrete Appl. Math. 309, 172--179 (2022; Zbl 1480.05080) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{I. Katsikarelis} et al., Discrete Appl. Math. 308, 168--186 (2022; Zbl 1479.05081) Full Text: DOI OpenURL
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka Upper and lower degree-constrained graph orientation with minimum penalty. (English) Zbl 07450581 Theor. Comput. Sci. 900, 53-78 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 900, 53--78 (2022; Zbl 07450581) Full Text: DOI OpenURL
Schierreich, Šimon; Suchý, Ondřej Waypoint routing on bounded treewidth graphs. (English) Zbl 1472.68121 Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022). MSC: 68R10 05C85 68Q27 90C27 90C35 PDF BibTeX XML Cite \textit{Š. Schierreich} and \textit{O. Suchý}, Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022; Zbl 1472.68121) Full Text: DOI arXiv OpenURL
Gaikwad, Ajinkya; Maity, Soumen; Tripathi, Shuvam Kant Parameterized complexity of locally minimal defensive alliances. (English) Zbl 07497527 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 135-148 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{A. Gaikwad} et al., Lect. Notes Comput. Sci. 12601, 135--148 (2021; Zbl 07497527) Full Text: DOI OpenURL
de Colnet, Alexis; Mengel, Stefan Characterizing Tseitin-formulas with short regular resolution refutations. (English) Zbl 07495569 Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 116-133 (2021). MSC: 68Q25 68R07 68T20 PDF BibTeX XML Cite \textit{A. de Colnet} and \textit{S. Mengel}, Lect. Notes Comput. Sci. 12831, 116--133 (2021; Zbl 07495569) Full Text: DOI OpenURL
Goles, Eric; Montealegre, Pedro; Ríos Wilson, Martín; Theyssier, Guillaume On the impact of treewidth in the computational complexity of freezing dynamics. (English) Zbl 07495174 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 260-272 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Goles} et al., Lect. Notes Comput. Sci. 12813, 260--272 (2021; Zbl 07495174) Full Text: DOI arXiv OpenURL
Liu, Ke; Lu, Mei The treewidth of 2-section of hypergraphs. (English) Zbl 1481.05114 Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 1, 20 p. (2021). MSC: 05C65 PDF BibTeX XML Cite \textit{K. Liu} and \textit{M. Lu}, Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 1, 20 p. (2021; Zbl 1481.05114) Full Text: arXiv Link OpenURL
Besin, Viktor; Hecher, Markus; Woltran, Stefan Utilizing treewidth for quantitative reasoning on epistemic logic programs. (English) Zbl 07454770 Theory Pract. Log. Program. 21, No. 5, 575-592 (2021). MSC: 68N17 PDF BibTeX XML Cite \textit{V. Besin} et al., Theory Pract. Log. Program. 21, No. 5, 575--592 (2021; Zbl 07454770) Full Text: DOI arXiv OpenURL
Chatterjee, Krishnendu; Ibsen-Jensen, Rasmus; Pavlogiannis, Andreas Faster algorithms for quantitative verification in bounded treewidth graphs. (English) Zbl 07440328 Form. Methods Syst. Des. 57, No. 3, 401-428 (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{K. Chatterjee} et al., Form. Methods Syst. Des. 57, No. 3, 401--428 (2021; Zbl 07440328) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{C. Dallard} et al., SIAM J. Discrete Math. 35, No. 4, 2618--2646 (2021; Zbl 1479.05308) Full Text: DOI arXiv OpenURL
Sau, Ignasi; dos Santos Souza, Uéverton Hitting forbidden induced subgraphs on bounded treewidth graphs. (English) Zbl 07433326 Inf. Comput. 281, Article ID 104812, 18 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{I. Sau} and \textit{U. dos Santos Souza}, Inf. Comput. 281, Article ID 104812, 18 p. (2021; Zbl 07433326) Full Text: DOI arXiv OpenURL
Chaplick, Steven; Töpfer, Martin; Voborník, Jan; Zeman, Peter On \(H\)-topological intersection graphs. (English) Zbl 07431037 Algorithmica 83, No. 11, 3281-3318 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{S. Chaplick} et al., Algorithmica 83, No. 11, 3281--3318 (2021; Zbl 07431037) Full Text: DOI OpenURL
Herrera, Luis H.; Pérez-Lantero, Pablo On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon. (English) Zbl 07426865 Appl. Math. Comput. 411, Article ID 126472, 9 p. (2021). MSC: 05Cxx 68Qxx 68Rxx PDF BibTeX XML Cite \textit{L. H. Herrera} and \textit{P. Pérez-Lantero}, Appl. Math. Comput. 411, Article ID 126472, 9 p. (2021; Zbl 07426865) Full Text: DOI arXiv OpenURL
Ganian, Robert; Szeider, Stefan New width parameters for SAT and #SAT. (English) Zbl 07418649 Artif. Intell. 295, Article ID 103460, 18 p. (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{R. Ganian} and \textit{S. Szeider}, Artif. Intell. 295, Article ID 103460, 18 p. (2021; Zbl 07418649) Full Text: DOI OpenURL
Hommelsheim, Felix; Muehlenthaler, Moritz; Schaudt, Oliver How to secure matchings against edge failures. (English) Zbl 07410690 SIAM J. Discrete Math. 35, No. 3, 2265-2292 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{F. Hommelsheim} et al., SIAM J. Discrete Math. 35, No. 3, 2265--2292 (2021; Zbl 07410690) Full Text: DOI arXiv OpenURL
Alves, Mateus Rodrigues; de Oliveira Oliveira, Mateus; Nascimento Silva, Janio Carlos; dos Santos Souza, Uéverton Succinct certification of monotone circuits. (English) Zbl 07407467 Theor. Comput. Sci. 889, 1-13 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. R. Alves} et al., Theor. Comput. Sci. 889, 1--13 (2021; Zbl 07407467) Full Text: DOI OpenURL
Agrawal, Garima; Maity, Soumen The Small Set Vertex expansion problem. (English) Zbl 07407460 Theor. Comput. Sci. 886, 84-93 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{G. Agrawal} and \textit{S. Maity}, Theor. Comput. Sci. 886, 84--93 (2021; Zbl 07407460) Full Text: DOI OpenURL
Hanaka, Tesshu; Kawai, Kazuma; Ono, Hirotaka Computing \(L(p, 1)\)-labeling with combined parameters. (English) Zbl 07405963 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 208-220 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Hanaka} et al., Lect. Notes Comput. Sci. 12635, 208--220 (2021; Zbl 07405963) Full Text: DOI arXiv OpenURL
Saitoh, Toshiki; Yoshinaka, Ryo; Bodlaender, Hans L. Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes. (English) Zbl 07405958 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 142-153 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Saitoh} et al., Lect. Notes Comput. Sci. 12635, 142--153 (2021; Zbl 07405958) Full Text: DOI arXiv OpenURL
Bagan, Guillaume; Gledel, Valentin; Heinrich, Marc; Mc Inerney, Fionn Weighted total acquisition. (English) Zbl 1473.05289 Discrete Appl. Math. 304, 260-282 (2021). MSC: 05C82 05C22 05C90 68R10 68Q17 90C39 PDF BibTeX XML Cite \textit{G. Bagan} et al., Discrete Appl. Math. 304, 260--282 (2021; Zbl 1473.05289) Full Text: DOI OpenURL
Bartier, Valentin; Bousquet, Nicolas; Heinrich, Marc Recoloring graphs of treewidth 2. (English) Zbl 07404821 Discrete Math. 344, No. 12, Article ID 112553, 7 p. (2021). MSC: 05Cxx 68Qxx 60Jxx PDF BibTeX XML Cite \textit{V. Bartier} et al., Discrete Math. 344, No. 12, Article ID 112553, 7 p. (2021; Zbl 07404821) Full Text: DOI arXiv OpenURL
Itsykson, Dmitry; Riazanov, Artur; Sagunov, Danil; Smirnov, Petr Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs. (English) Zbl 07393895 Comput. Complexity 30, No. 2, Paper No. 13, 74 p. (2021); correction ibid. 30, No. 2, Paper No. 16, 2 p. (2021). Reviewer: Ariel Germán Fernández (Buenos Aires) MSC: 03F20 68Q17 PDF BibTeX XML Cite \textit{D. Itsykson} et al., Comput. Complexity 30, No. 2, Paper No. 13, 74 p. (2021; Zbl 07393895) Full Text: DOI OpenURL
Berger, Sören; Kohayakawa, Yoshiharu; Maesaka, Giulia Satiko; Martins, Taísa; Mendonça, Walner; Mota, Guilherme Oliveira; Parczyk, Olaf The size-Ramsey number of powers of bounded degree trees. (English) Zbl 1470.05110 J. Lond. Math. Soc., II. Ser. 103, No. 4, 1314-1332 (2021). MSC: 05C55 05C80 05D40 05D10 05C07 05C05 PDF BibTeX XML Cite \textit{S. Berger} et al., J. Lond. Math. Soc., II. Ser. 103, No. 4, 1314--1332 (2021; Zbl 1470.05110) Full Text: DOI arXiv OpenURL
Liu, Ke; Lu, Mei Complete-subgraph-transversal-sets problem on bounded treewidth graphs. (English) Zbl 07380949 J. Comb. Optim. 41, No. 4, 923-933 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Liu} and \textit{M. Lu}, J. Comb. Optim. 41, No. 4, 923--933 (2021; Zbl 07380949) Full Text: DOI OpenURL
Glinskih, Ludmila; Itsykson, Dmitry On tseitin formulas, read-once branching programs and treewidth. (English) Zbl 07377746 Theory Comput. Syst. 65, No. 3, 613-633 (2021). MSC: 68Qxx 03Fxx 68Txx PDF BibTeX XML Cite \textit{L. Glinskih} and \textit{D. Itsykson}, Theory Comput. Syst. 65, No. 3, 613--633 (2021; Zbl 07377746) Full Text: DOI OpenURL
Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI OpenURL
Bonnet, Édouard; Purohit, Nidhi Metric dimension parameterized by treewidth. (English) Zbl 07374885 Algorithmica 83, No. 8, 2606-2633 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{É. Bonnet} and \textit{N. Purohit}, Algorithmica 83, No. 8, 2606--2633 (2021; Zbl 07374885) Full Text: DOI arXiv OpenURL
Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Kwon, O-joung Measuring what matters: a hybrid approach to dynamic programming with treewidth. (English) Zbl 07368162 J. Comput. Syst. Sci. 121, 57-75 (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 121, 57--75 (2021; Zbl 07368162) Full Text: DOI arXiv OpenURL
Hanaka, Tesshu; Kobayashi, Yasuaki; Sone, Taiga A (probably) optimal algorithm for bisection on bounded-treewidth graphs. (English) Zbl 07361598 Theor. Comput. Sci. 873, 38-46 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. Hanaka} et al., Theor. Comput. Sci. 873, 38--46 (2021; Zbl 07361598) Full Text: DOI OpenURL
Foucaud, Florent; Hocquard, Hervé; Lajou, Dimitri Complexity and algorithms for injective edge-coloring in graphs. (English) Zbl 07360081 Inf. Process. Lett. 170, Article ID 106121, 9 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{F. Foucaud} et al., Inf. Process. Lett. 170, Article ID 106121, 9 p. (2021; Zbl 07360081) Full Text: DOI arXiv OpenURL
Ganian, Robert; Ordyniak, Sebastian; Ramanujan, M. S. On structural parameterizations of the edge disjoint paths problem. (English) Zbl 07357812 Algorithmica 83, No. 6, 1605-1637 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{R. Ganian} et al., Algorithmica 83, No. 6, 1605--1637 (2021; Zbl 07357812) Full Text: DOI OpenURL
Czerwiński, Wojciech; Nadara, Wojciech; Pilipczuk, Marcin Improved bounds for the excluded-minor approximation of treedepth. (English) Zbl 1465.05174 SIAM J. Discrete Math. 35, No. 2, 934-947 (2021). MSC: 05C83 05C85 05C12 PDF BibTeX XML Cite \textit{W. Czerwiński} et al., SIAM J. Discrete Math. 35, No. 2, 934--947 (2021; Zbl 1465.05174) Full Text: DOI arXiv OpenURL
Duarte, Gabriel L.; Eto, Hiroshi; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lokshtanov, Daniel; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Souza, Uéverton S. Computing the largest bond and the maximum connected cut of a graph. (English) Zbl 07335028 Algorithmica 83, No. 5, 1421-1458 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{G. L. Duarte} et al., Algorithmica 83, No. 5, 1421--1458 (2021; Zbl 07335028) Full Text: DOI arXiv OpenURL
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan Steiner trees for hereditary graph classes: a treewidth perspective. (English) Zbl 1477.68203 Theor. Comput. Sci. 867, 30-39 (2021). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 867, 30--39 (2021; Zbl 1477.68203) Full Text: DOI arXiv OpenURL
Okrasa, Karolina; Rzążewski, Paweł Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs. (English) Zbl 07333144 SIAM J. Comput. 50, No. 2, 487-508 (2021). MSC: 68Q25 05C85 05C60 68R10 PDF BibTeX XML Cite \textit{K. Okrasa} and \textit{P. Rzążewski}, SIAM J. Comput. 50, No. 2, 487--508 (2021; Zbl 07333144) Full Text: DOI arXiv OpenURL
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E. Bisection of bounded treewidth graphs by convolutions. (English) Zbl 1477.68220 J. Comput. Syst. Sci. 119, 125-132 (2021). MSC: 68R10 68Q25 68W40 PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 119, 125--132 (2021; Zbl 1477.68220) Full Text: DOI OpenURL
Erlebach, Thomas; Hoffmann, Michael; Kammer, Frank On temporal graph exploration. (English) Zbl 1477.68222 J. Comput. Syst. Sci. 119, 1-18 (2021). MSC: 68R10 68Q17 68Q25 68W15 90C27 PDF BibTeX XML Cite \textit{T. Erlebach} et al., J. Comput. Syst. Sci. 119, 1--18 (2021; Zbl 1477.68222) Full Text: DOI arXiv OpenURL
Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Yagita, Tsuyoshi Finding a maximum minimal separator: graph classes and fixed-parameter tractability. (English) Zbl 07331476 Theor. Comput. Sci. 865, 131-140 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. Hanaka} et al., Theor. Comput. Sci. 865, 131--140 (2021; Zbl 07331476) Full Text: DOI arXiv OpenURL
Biedl, Therese; Mehrabi, Saeed On orthogonally guarding orthogonal polygons with bounded treewidth. (English) Zbl 07328487 Algorithmica 83, No. 2, 641-666 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{T. Biedl} and \textit{S. Mehrabi}, Algorithmica 83, No. 2, 641--666 (2021; Zbl 07328487) Full Text: DOI arXiv OpenURL
Botler, Fábio; Fernandes, Cristina G.; Gutiérrez, Juan On Tuza’s conjecture for triangulations and graphs with small treewidth. (English) Zbl 1460.05188 Discrete Math. 344, No. 4, Article ID 112281, 12 p. (2021). MSC: 05D15 PDF BibTeX XML Cite \textit{F. Botler} et al., Discrete Math. 344, No. 4, Article ID 112281, 12 p. (2021; Zbl 1460.05188) Full Text: DOI arXiv OpenURL
Kamcev, Nina; Liebenau, Anita; Wood, David R.; Yepremyan, Liana The size Ramsey number of graphs with bounded treewidth. (English) Zbl 1459.05201 SIAM J. Discrete Math. 35, No. 1, 281-293 (2021). MSC: 05C55 05D10 05C05 05C42 PDF BibTeX XML Cite \textit{N. Kamcev} et al., SIAM J. Discrete Math. 35, No. 1, 281--293 (2021; Zbl 1459.05201) Full Text: DOI arXiv OpenURL
Klavík, Pavel; Knop, Dušan; Zeman, Peter Graph isomorphism restricted by lists. (English) Zbl 07318687 Theor. Comput. Sci. 860, 51-71 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Klavík} et al., Theor. Comput. Sci. 860, 51--71 (2021; Zbl 07318687) Full Text: DOI arXiv OpenURL
Li, Yan; Zhang, Xin Equitable list tree-coloring of bounded treewidth graphs. (English) Zbl 1481.05049 Theor. Comput. Sci. 855, 61-67 (2021). MSC: 05C15 05C05 05C10 68R10 PDF BibTeX XML Cite \textit{Y. Li} and \textit{X. Zhang}, Theor. Comput. Sci. 855, 61--67 (2021; Zbl 1481.05049) Full Text: DOI OpenURL
Merker, Laura; Ueckerdt, Torsten The local queue number of graphs with bounded treewidth. (English) Zbl 07436605 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 26-39 (2020). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{L. Merker} and \textit{T. Ueckerdt}, Lect. Notes Comput. Sci. 12590, 26--39 (2020; Zbl 07436605) Full Text: DOI arXiv OpenURL
Hanaka, Tesshu; Kobayashi, Yasuaki; Sone, Taiga An optimal algorithm for bisection for bounded-treewidth graph. (English) Zbl 07369998 Li, Minming (ed.), Frontiers in algorithmics. 14th international workshop, FAW 2020, Haikou, China, October 19–21, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12340, 25-36 (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Hanaka} et al., Lect. Notes Comput. Sci. 12340, 25--36 (2020; Zbl 07369998) Full Text: DOI arXiv OpenURL
Fomin, Fedor V.; Lokshtanov, Daniel; Kolay, Sudeshna; Panolan, Fahad; Saurabh, Saket Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (English) Zbl 07342464 ACM Trans. Algorithms 16, No. 2, Article No. 21, 37 p. (2020). MSC: 68R10 05C85 68Q25 68U05 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 16, No. 2, Article No. 21, 37 p. (2020; Zbl 07342464) Full Text: DOI Link OpenURL
Alves, Mateus Rodrigues; de Oliveira Oliveira, Mateus; Silva, Janio Carlos Nascimento; dos Santos Souza, Uéverton Succinct monotone circuit certification: planarity and parameterized complexity. (English) Zbl 07336129 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 496-507 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{M. R. Alves} et al., Lect. Notes Comput. Sci. 12273, 496--507 (2020; Zbl 07336129) Full Text: DOI OpenURL
Akutsu, Tatsuya; Melkman, Avraham A.; Tamura, Takeyuki Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree. (English) Zbl 1458.68137 Int. J. Found. Comput. Sci. 31, No. 2, 253-273 (2020). MSC: 68R10 05C60 68Q17 PDF BibTeX XML Cite \textit{T. Akutsu} et al., Int. J. Found. Comput. Sci. 31, No. 2, 253--273 (2020; Zbl 1458.68137) Full Text: DOI OpenURL
Fichte, Johannes K.; Hecher, Markus; Pfandler, Andreas Lower bounds for QBFs of bounded treewidth. (English) Zbl 07299485 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 410-424 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{J. K. Fichte} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 410--424 (2020; Zbl 07299485) Full Text: DOI arXiv OpenURL
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1475.05161 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). Reviewer: Steve Noble (London) MSC: 05C85 05C10 68R10 05C83 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 1475.05161) Full Text: DOI arXiv OpenURL
Doczkal, Christian; Pous, Damien Graph theory in Coq: minors, treewidth, and isomorphisms. (English) Zbl 1468.68320 J. Autom. Reasoning 64, No. 5, 795-825 (2020). MSC: 68V20 03B35 05C05 05C40 05C60 05C83 PDF BibTeX XML Cite \textit{C. Doczkal} and \textit{D. Pous}, J. Autom. Reasoning 64, No. 5, 795--825 (2020; Zbl 1468.68320) Full Text: DOI HAL OpenURL
Dujmović, Vida; Eppstein, David; Joret, Gwenaël; Morin, Pat; Wood, David R. Minor-closed graph classes with bounded layered pathwidth. (English) Zbl 1450.05086 SIAM J. Discrete Math. 34, No. 3, 1693-1709 (2020). MSC: 05C83 05C38 PDF BibTeX XML Cite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 34, No. 3, 1693--1709 (2020; Zbl 1450.05086) Full Text: DOI arXiv OpenURL
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. I: General upper bounds. (English) Zbl 1450.05084 SIAM J. Discrete Math. 34, No. 3, 1623-1648 (2020). MSC: 05C83 05C85 68Q25 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., SIAM J. Discrete Math. 34, No. 3, 1623--1648 (2020; Zbl 1450.05084) Full Text: DOI arXiv OpenURL
Jansen, Klaus; Maack, Marten; Solis-Oba, Roberto Structural parameters for scheduling with assignment restrictions. (English) Zbl 1464.90027 Theor. Comput. Sci. 844, 154-170 (2020). MSC: 90B35 68Q25 68R10 68W25 PDF BibTeX XML Cite \textit{K. Jansen} et al., Theor. Comput. Sci. 844, 154--170 (2020; Zbl 1464.90027) Full Text: DOI arXiv OpenURL
Wiederrecht, Sebastian Digraphs of directed treewidth one. (English) Zbl 1448.05092 Discrete Math. 343, No. 12, Article ID 112124, 9 p. (2020). MSC: 05C20 05C05 PDF BibTeX XML Cite \textit{S. Wiederrecht}, Discrete Math. 343, No. 12, Article ID 112124, 9 p. (2020; Zbl 1448.05092) Full Text: DOI OpenURL
Chen, Meirun; Naserasr, Reza Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees. (English) Zbl 1452.05054 J. Comb. Theory, Ser. B 145, 1-31 (2020). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C15 05C05 05C10 51A10 PDF BibTeX XML Cite \textit{M. Chen} and \textit{R. Naserasr}, J. Comb. Theory, Ser. B 145, 1--31 (2020; Zbl 1452.05054) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \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 OpenURL
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 1452.68134 Algorithmica 82, No. 8, 2292-2315 (2020). MSC: 68R10 05C09 05C12 68P05 68Q25 68U05 PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 82, No. 8, 2292--2315 (2020; Zbl 1452.68134) Full Text: DOI OpenURL
Ashok, Pradeesha; Bhargava, Rathin; Gupta, Naman; Khalid, Mohammad; Yadav, Dolly Minimum conflict free colouring parameterized by treewidth. (English) Zbl 1453.68094 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 439-450 (2020). MSC: 68Q27 05C15 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{P. Ashok} et al., Lect. Notes Comput. Sci. 12016, 439--450 (2020; Zbl 1453.68094) Full Text: DOI OpenURL
Kaur, Chamanvir; Misra, Neeldhara On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 427-438 (2020). MSC: 68Q27 05C05 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{C. Kaur} and \textit{N. Misra}, Lect. Notes Comput. Sci. 12016, 427--438 (2020; Zbl 1453.68096) Full Text: DOI OpenURL
Amarilli, Antoine; Capelli, Florent; Monet, Mikaël; Senellart, Pierre Connecting knowledge compilation classes and width parameters. (Connecting knowledge compilation classes width parameters.) (English) Zbl 1446.68149 Theory Comput. Syst. 64, No. 5, 861-914 (2020). MSC: 68T30 68P05 68P15 PDF BibTeX XML Cite \textit{A. Amarilli} et al., Theory Comput. Syst. 64, No. 5, 861--914 (2020; Zbl 1446.68149) Full Text: DOI arXiv OpenURL
Cohen, David A.; Cooper, Martin C.; Kaznatcheev, Artem; Wallace, Mark Steepest ascent can be exponential in bounded treewidth problems. (English) Zbl 07204101 Oper. Res. Lett. 48, No. 3, 217-224 (2020). MSC: 68-XX 03-XX PDF BibTeX XML Cite \textit{D. A. Cohen} et al., Oper. Res. Lett. 48, No. 3, 217--224 (2020; Zbl 07204101) Full Text: DOI arXiv Link OpenURL
Botler, Fábio; Sambinelli, Maycon; Coelho, Rafael S.; Lee, Orlando Gallai’s path decomposition conjecture for graphs with treewidth at most 3. (English) Zbl 07202759 J. Graph Theory 93, No. 3, 328-349 (2020). MSC: 05Cxx PDF BibTeX XML Cite \textit{F. Botler} et al., J. Graph Theory 93, No. 3, 328--349 (2020; Zbl 07202759) Full Text: DOI arXiv OpenURL
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian Parameterized orientable deletion. (English) Zbl 1441.68186 Algorithmica 82, No. 7, 1909-1938 (2020). MSC: 68R10 05C20 68Q17 68Q27 68W25 68W40 PDF BibTeX XML Cite \textit{T. Hanaka} et al., Algorithmica 82, No. 7, 1909--1938 (2020; Zbl 1441.68186) Full Text: DOI arXiv Link OpenURL
Dhanalakshmi, S.; Sadagopan, N. On strictly chordality-\(k\) graphs. (English) Zbl 1439.05050 Discrete Appl. Math. 280, 93-112 (2020). MSC: 05C05 05C38 PDF BibTeX XML Cite \textit{S. Dhanalakshmi} and \textit{N. Sadagopan}, Discrete Appl. Math. 280, 93--112 (2020; Zbl 1439.05050) Full Text: DOI arXiv OpenURL
Aidun, Ivan; Dean, Frances; Morrison, Ralph; Yu, Teresa; Yuan, Julie Treewidth and gonality of glued grid graphs. (English) Zbl 1439.05164 Discrete Appl. Math. 279, 1-11 (2020). MSC: 05C62 PDF BibTeX XML Cite \textit{I. Aidun} et al., Discrete Appl. Math. 279, 1--11 (2020; Zbl 1439.05164) Full Text: DOI arXiv OpenURL
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Parameterized (approximate) defective coloring. (English) Zbl 1433.68178 SIAM J. Discrete Math. 34, No. 2, 1084-1106 (2020). MSC: 68Q27 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 34, No. 2, 1084--1106 (2020; Zbl 1433.68178) Full Text: DOI OpenURL
Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke Recognizing hyperelliptic graphs in polynomial time. (English) Zbl 1436.05105 Theor. Comput. Sci. 815, 121-146 (2020). MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{J. M. Bodewes} et al., Theor. Comput. Sci. 815, 121--146 (2020; Zbl 1436.05105) Full Text: DOI OpenURL
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian Using decomposition-parameters for QBF: mind the prefix! (English) Zbl 1435.68123 J. Comput. Syst. Sci. 110, 1-21 (2020). MSC: 68Q27 68R07 68T20 PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 110, 1--21 (2020; Zbl 1435.68123) Full Text: DOI Link OpenURL
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. (English) Zbl 1435.68122 Theor. Comput. Sci. 814, 135-152 (2020). MSC: 68Q27 05C83 05C85 68Q17 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., Theor. Comput. Sci. 814, 135--152 (2020; Zbl 1435.68122) Full Text: DOI arXiv Link OpenURL
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M. Hitting minors on bounded treewidth graphs. III. Lower bounds. (English) Zbl 1435.68121 J. Comput. Syst. Sci. 109, 56-77 (2020). MSC: 68Q27 05C83 05C85 68Q17 90C39 PDF BibTeX XML Cite \textit{J. Baste} et al., J. Comput. Syst. Sci. 109, 56--77 (2020; Zbl 1435.68121) Full Text: DOI arXiv Link OpenURL
Baudru, Nicolas; Fratani, Séverine On exteriority notions in book embeddings and treewidth. (English) Zbl 1434.68345 Discrete Math. 343, No. 4, Article ID 111703, 18 p. (2020). MSC: 68R10 05C10 05C12 PDF BibTeX XML Cite \textit{N. Baudru} and \textit{S. Fratani}, Discrete Math. 343, No. 4, Article ID 111703, 18 p. (2020; Zbl 1434.68345) Full Text: DOI Link OpenURL
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 PDF BibTeX XML Cite \textit{J. Lee} and \textit{D. Skipper}, Discrete Appl. Math. 275, 79--94 (2020; Zbl 1433.90086) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{R. Gómez} and \textit{Y. Wakabayashi}, J. Comb. Optim. 39, No. 2, 437--456 (2020; Zbl 1434.90209) Full Text: DOI OpenURL
Li, Bi; Zhang, Xin Tree-coloring problems of bounded treewidth graphs. (English) Zbl 1434.05055 J. Comb. Optim. 39, No. 1, 156-169 (2020). MSC: 05C15 05C10 68R10 05C85 PDF BibTeX XML Cite \textit{B. Li} and \textit{X. Zhang}, J. Comb. Optim. 39, No. 1, 156--169 (2020; Zbl 1434.05055) Full Text: DOI OpenURL
Bentz, Cédric; Le Bodic, Pierre Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. (English) Zbl 1436.68221 Theor. Comput. Sci. 809, 239-249 (2020). MSC: 68R10 68Q17 68Q25 90C35 90C60 PDF BibTeX XML Cite \textit{C. Bentz} and \textit{P. Le Bodic}, Theor. Comput. Sci. 809, 239--249 (2020; Zbl 1436.68221) Full Text: DOI OpenURL
Kawarabayashi, Ken-ichi; Kobayashi, Yusuke Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor. (English) Zbl 1430.05123 J. Comb. Theory, Ser. B 141, 165-180 (2020). MSC: 05C83 05C35 05C12 05C85 PDF BibTeX XML Cite \textit{K.-i. Kawarabayashi} and \textit{Y. Kobayashi}, J. Comb. Theory, Ser. B 141, 165--180 (2020; Zbl 1430.05123) Full Text: DOI OpenURL
Seweryn, Michał T. Improved bound for the dimension of posets of treewidth two. (English) Zbl 1477.06009 Discrete Math. 343, No. 1, Article ID 111605, 9 p. (2020). MSC: 06A07 06A06 05C12 PDF BibTeX XML Cite \textit{M. T. Seweryn}, Discrete Math. 343, No. 1, Article ID 111605, 9 p. (2020; Zbl 1477.06009) Full Text: DOI arXiv OpenURL
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E. Bisection of bounded treewidth graphs by convolutions. (English) Zbl 07525479 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 42, 11 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 42, 11 p. (2019; Zbl 07525479) Full Text: DOI OpenURL
Botler, F.; Fernandes, C. G.; Gutiérrez, J. On Tuza’s conjecture for triangulations and graphs with small treewidth. (English) Zbl 07515178 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 171-183 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{F. Botler} et al., Electron. Notes Theor. Comput. Sci. 346, 171--183 (2019; Zbl 07515178) Full Text: DOI OpenURL
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 07378590 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 4, 13 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{K. Bringmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 4, 13 p. (2019; Zbl 07378590) Full Text: DOI OpenURL