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
Baste, Julien; Fellows, Michael R.; Jaffke, Lars; Masařík, Tomáš; de Oliveira Oliveira, Mateus; Philip, Geevarghese; Rosamond, Frances A. Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. (English) Zbl 07482897 Artif. Intell. 303, Article ID 103644, 15 p. (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{J. Baste} et al., Artif. Intell. 303, Article ID 103644, 15 p. (2022; Zbl 07482897) Full Text: DOI arXiv 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
Carmeli, Nofar; Kenig, Batya; Kimelfeld, Benny; Kröll, Markus Efficiently enumerating minimal triangulations. (English) Zbl 1472.05070 Discrete Appl. Math. 303, 216-236 (2021). MSC: 05C30 05C70 68R10 68Q25 PDF BibTeX XML Cite \textit{N. Carmeli} et al., Discrete Appl. Math. 303, 216--236 (2021; Zbl 1472.05070) Full Text: DOI OpenURL
Sethuraman, G.; Murugan, V. Decomposition of complete graphs into arbitrary trees. (English) Zbl 1472.05128 Graphs Comb. 37, No. 4, 1191-1203 (2021). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C70 05C38 05C05 PDF BibTeX XML Cite \textit{G. Sethuraman} and \textit{V. Murugan}, Graphs Comb. 37, No. 4, 1191--1203 (2021; Zbl 1472.05128) Full Text: DOI OpenURL
Bressan, Marco Faster algorithms for counting subgraphs in sparse graphs. (English) Zbl 07374884 Algorithmica 83, No. 8, 2578-2605 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M. Bressan}, Algorithmica 83, No. 8, 2578--2605 (2021; Zbl 07374884) Full Text: DOI arXiv OpenURL
Feng, Jieru; Gao, Yuping; Wu, Jianliang The edge colorings of \(K_5\)-minor free graphs. (English) Zbl 07340586 Discrete Math. 344, No. 6, Article ID 112360, 7 p. (2021). MSC: 68Rxx 68Qxx PDF BibTeX XML Cite \textit{J. Feng} et al., Discrete Math. 344, No. 6, Article ID 112360, 7 p. (2021; Zbl 07340586) Full Text: DOI arXiv OpenURL
Diestel, Reinhard; Oum, Sang-il Tangle-tree duality in abstract separation systems. (English) Zbl 1471.05087 Adv. Math. 377, Article ID 107470, 25 p. (2021). MSC: 05C70 05C42 05C40 05C83 05C05 PDF BibTeX XML Cite \textit{R. Diestel} and \textit{S.-i. Oum}, Adv. Math. 377, Article ID 107470, 25 p. (2021; Zbl 1471.05087) Full Text: DOI arXiv OpenURL
Bichler, Manuel; Morak, Michael; Woltran, Stefan lpopt: a rule optimization tool for answer set programming. (English) Zbl 07350034 Fundam. Inform. 177, No. 3-4, 275-296 (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{M. Bichler} et al., Fundam. Inform. 177, No. 3--4, 275--296 (2020; Zbl 07350034) Full Text: DOI arXiv OpenURL
Eppstein, David; Havvaei, Elham Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1452.68135 Algorithmica 82, No. 8, 2337-2359 (2020). MSC: 68R10 03B70 05C05 05C76 05C85 68Q27 92D15 PDF BibTeX XML Cite \textit{D. Eppstein} and \textit{E. Havvaei}, Algorithmica 82, No. 8, 2337--2359 (2020; Zbl 1452.68135) Full Text: DOI Link OpenURL
Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami A faster tree-decomposition based algorithm for counting linear extensions. (English) Zbl 1452.68265 Algorithmica 82, No. 8, 2156-2173 (2020). MSC: 68W05 05C05 06A07 68W40 PDF BibTeX XML Cite \textit{K. Kangas} et al., Algorithmica 82, No. 8, 2156--2173 (2020; Zbl 1452.68265) Full Text: DOI OpenURL
Clinch, Katie; Kitson, Derek \(\ell^1\) and \(\ell^\infty\) plane. (English) Zbl 1441.05071 Electron. J. Comb. 27, No. 2, Research Paper P2.49, 21 p. (2020). MSC: 05C15 05C75 52A21 52C25 PDF BibTeX XML Cite \textit{K. Clinch} and \textit{D. Kitson}, Electron. J. Comb. 27, No. 2, Research Paper P2.49, 21 p. (2020; Zbl 1441.05071) Full Text: DOI OpenURL
Krause, Philipp Klaus; Larisch, Lukas; Salfelder, Felix The tree-width of C. (English) Zbl 1437.05046 Discrete Appl. Math. 278, 136-152 (2020). MSC: 05C05 05C70 68R10 68N20 PDF BibTeX XML Cite \textit{P. K. Krause} et al., Discrete Appl. Math. 278, 136--152 (2020; Zbl 1437.05046) Full Text: DOI OpenURL
Ducoffe, Guillaume; Legay, Sylvain; Nisse, Nicolas On the complexity of computing treebreadth. (English) Zbl 1433.68168 Algorithmica 82, No. 6, 1574-1600 (2020). MSC: 68Q25 05C70 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., Algorithmica 82, No. 6, 1574--1600 (2020; Zbl 1433.68168) Full Text: DOI Link OpenURL
Erde, Joshua Directed path-decompositions. (English) Zbl 1432.05079 SIAM J. Discrete Math. 34, No. 1, 415-430 (2020). MSC: 05C70 05C38 05C20 05C83 PDF BibTeX XML Cite \textit{J. Erde}, SIAM J. Discrete Math. 34, No. 1, 415--430 (2020; Zbl 1432.05079) Full Text: DOI arXiv 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
Saurabh, Saket; Zehavi, Meirav Parameterized complexity of multi-node hubs. (English) Zbl 07378594 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 8, 14 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{S. Saurabh} and \textit{M. Zehavi}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 8, 14 p. (2019; Zbl 07378594) Full Text: DOI OpenURL
Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami A faster tree-decomposition based algorithm for counting linear extensions. (English) Zbl 07378591 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 5, 13 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{K. Kangas} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 5, 13 p. (2019; Zbl 07378591) Full Text: DOI OpenURL
Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Balanced judicious bipartition is fixed-parameter tractable. (English) Zbl 1425.05129 SIAM J. Discrete Math. 33, No. 4, 1878-1911 (2019). MSC: 05C70 05C35 68Q25 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., SIAM J. Discrete Math. 33, No. 4, 1878--1911 (2019; Zbl 1425.05129) Full Text: DOI arXiv OpenURL
Erde, Joshua; Weißauer, Daniel A short derivation of the structure theorem for graphs with excluded topological minors. (English) Zbl 1419.05199 SIAM J. Discrete Math. 33, No. 3, 1654-1661 (2019). MSC: 05C83 05C75 05C10 PDF BibTeX XML Cite \textit{J. Erde} and \textit{D. Weißauer}, SIAM J. Discrete Math. 33, No. 3, 1654--1661 (2019; Zbl 1419.05199) Full Text: DOI arXiv OpenURL
Carmesin, Johannes All graphs have tree-decompositions displaying their topological ends. (English) Zbl 1438.05179 Combinatorica 39, No. 3, 545-596 (2019). MSC: 05C63 05B35 PDF BibTeX XML Cite \textit{J. Carmesin}, Combinatorica 39, No. 3, 545--596 (2019; Zbl 1438.05179) Full Text: DOI arXiv Link OpenURL
Bryant, David; Scornavacca, Celine An \(O(n \log n)\) time algorithm for computing the path-length distance between trees. (English) Zbl 1429.68325 Algorithmica 81, No. 9, 3692-3706 (2019). MSC: 68W05 05C05 05C12 68Q25 92D15 PDF BibTeX XML Cite \textit{D. Bryant} and \textit{C. Scornavacca}, Algorithmica 81, No. 9, 3692--3706 (2019; Zbl 1429.68325) Full Text: DOI arXiv OpenURL
Schleimer, Saul; de Mesmay, Arnaud; Purcell, Jessica; Sedgwick, Eric On the tree-width of knot diagrams. (English) Zbl 1432.57017 J. Comput. Geom. 10, No. 1, 164-180 (2019). MSC: 57K10 PDF BibTeX XML Cite \textit{S. Schleimer} et al., J. Comput. Geom. 10, No. 1, 164--180 (2019; Zbl 1432.57017) Full Text: DOI arXiv OpenURL
Barrera-Cruz, Fidel; Felsner, Stefan; Mészáros, Tamás; Micek, Piotr; Smith, Heather; Taylor, Libby; Trotter, William T. Separating tree-chromatic number from path-chromatic number. (English) Zbl 1415.05113 J. Comb. Theory, Ser. B 138, 206-218 (2019). MSC: 05C55 05D10 05C15 PDF BibTeX XML Cite \textit{F. Barrera-Cruz} et al., J. Comb. Theory, Ser. B 138, 206--218 (2019; Zbl 1415.05113) Full Text: DOI arXiv OpenURL
Tamaki, Hisao Positive-instance driven dynamic programming for treewidth. (English) Zbl 1426.90250 J. Comb. Optim. 37, No. 4, 1283-1311 (2019). MSC: 90C39 91B06 PDF BibTeX XML Cite \textit{H. Tamaki}, J. Comb. Optim. 37, No. 4, 1283--1311 (2019; Zbl 1426.90250) Full Text: DOI arXiv Link OpenURL
Carmesin, Johannes; Lehner, Florian; Möller, Rögnvaldur G. On tree-decompositions of one-ended graphs. (English) Zbl 1482.20002 Math. Nachr. 292, No. 3, 524-539 (2019). MSC: 20B27 05C05 05C40 05C63 PDF BibTeX XML Cite \textit{J. Carmesin} et al., Math. Nachr. 292, No. 3, 524--539 (2019; Zbl 1482.20002) Full Text: DOI arXiv OpenURL
Diestel, Reinhard; Hundertmark, Fabian; Lemanczyk, Sahar Profiles of separations: in graphs, matroids, and beyond. (English) Zbl 1438.05040 Combinatorica 39, No. 1, 37-75 (2019). Reviewer: Utkir A. Rozikov (Tashkent) MSC: 05C05 05C70 05C40 05C83 05B35 06A07 52B40 PDF BibTeX XML Cite \textit{R. Diestel} et al., Combinatorica 39, No. 1, 37--75 (2019; Zbl 1438.05040) Full Text: DOI arXiv OpenURL
Weißauer, Daniel On the block number of graphs. (English) Zbl 1405.05091 SIAM J. Discrete Math. 33, No. 1, 346-357 (2019). MSC: 05C40 05C83 PDF BibTeX XML Cite \textit{D. Weißauer}, SIAM J. Discrete Math. 33, No. 1, 346--357 (2019; Zbl 1405.05091) Full Text: DOI arXiv OpenURL
Gaspers, Serge; Gudmundsson, Joachim; Jones, Mitchell; Mestre, Julián; Rümmele, Stefan Turbocharging treewidth heuristics. (English) Zbl 1411.68144 Algorithmica 81, No. 2, 439-475 (2019). MSC: 68T20 05C05 05C85 68Q17 68Q25 68R10 PDF BibTeX XML Cite \textit{S. Gaspers} et al., Algorithmica 81, No. 2, 439--475 (2019; Zbl 1411.68144) Full Text: DOI Link OpenURL
Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Balanced judicious bipartition is fixed-parameter tractable. (English) Zbl 07278112 Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 40, 15 p. (2018). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 40, 15 p. (2018; Zbl 07278112) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 32, No. 4, 3003--3004 (2018; Zbl 1440.05167) Full Text: DOI OpenURL
Rajaati, M.; Hooshmandasl, Mohammad Reza; Dinneen, Michael J.; Shakiba, Ali On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. (English) Zbl 1401.05225 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 2, 25 p. (2018). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{M. Rajaati} et al., Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 2, 25 p. (2018; Zbl 1401.05225) Full Text: arXiv Link OpenURL
Fernandes, Cristina G.; Schmidt, Tina Janne; Taraz, Anusch On minimum bisection and related cut problems in trees and tree-like graphs. (English) Zbl 1401.05067 J. Graph Theory 89, No. 2, 214-245 (2018). MSC: 05C05 05C85 90C27 PDF BibTeX XML Cite \textit{C. G. Fernandes} et al., J. Graph Theory 89, No. 2, 214--245 (2018; Zbl 1401.05067) Full Text: DOI arXiv OpenURL
Büsing, Christina; Comis, Martin Multi-budgeted matching problems. (English) Zbl 1397.90323 Networks 72, No. 1, 25-41 (2018). MSC: 90C27 90C39 PDF BibTeX XML Cite \textit{C. Büsing} and \textit{M. Comis}, Networks 72, No. 1, 25--41 (2018; Zbl 1397.90323) Full Text: DOI OpenURL
Diestel, Reinhard; Müller, Malte Connected tree-width. (English) Zbl 1399.05207 Combinatorica 38, No. 2, 381-398 (2018). Reviewer: Hang Lau (Montréal) MSC: 05C83 05C40 05C05 05C12 05C38 PDF BibTeX XML Cite \textit{R. Diestel} and \textit{M. Müller}, Combinatorica 38, No. 2, 381--398 (2018; Zbl 1399.05207) Full Text: DOI arXiv OpenURL
Mahajan, Meena; Saurabh, Nitin Some complete and intermediate polynomials in algebraic complexity theory. (English) Zbl 1393.68079 Theory Comput. Syst. 62, No. 3, 622-652 (2018). MSC: 68Q25 13P25 68Q15 68Q17 PDF BibTeX XML Cite \textit{M. Mahajan} and \textit{N. Saurabh}, Theory Comput. Syst. 62, No. 3, 622--652 (2018; Zbl 1393.68079) Full Text: DOI arXiv OpenURL
Botler, F.; Mota, G. O.; Oshiro, M. T. I.; Wakabayashi, Y. Decomposing highly connected graphs into paths of length five. (English) Zbl 1387.05189 Discrete Appl. Math. 245, 128-138 (2018). MSC: 05C70 05C40 05C12 PDF BibTeX XML Cite \textit{F. Botler} et al., Discrete Appl. Math. 245, 128--138 (2018; Zbl 1387.05189) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{B. Li} et al., Discrete Appl. Math. 245, 109--127 (2018; Zbl 1387.05205) Full Text: DOI Link OpenURL
Erde, Joshua A unified treatment of linked and lean tree-decompositions. (English) Zbl 1384.05132 J. Comb. Theory, Ser. B 130, 114-143 (2018). MSC: 05C70 05C05 PDF BibTeX XML Cite \textit{J. Erde}, J. Comb. Theory, Ser. B 130, 114--143 (2018; Zbl 1384.05132) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{V. Dujmović} et al., SIAM J. Discrete Math. 32, No. 2, 839--863 (2018; Zbl 1383.05257) Full Text: DOI arXiv OpenURL
Diestel, Reinhard Tree sets. (English) Zbl 1412.06002 Order 35, No. 1, 171-192 (2018). Reviewer: Ioan Tomescu (Bucureşti) MSC: 06A07 05B35 05C05 PDF BibTeX XML Cite \textit{R. Diestel}, Order 35, No. 1, 171--192 (2018; Zbl 1412.06002) Full Text: DOI arXiv OpenURL
Yolov, Nikola Minor-matching hypertree width. (English) Zbl 1403.05041 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 219-233 (2018). MSC: 05C12 05C65 05C05 PDF BibTeX XML Cite \textit{N. Yolov}, in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 219--233 (2018; Zbl 1403.05041) Full Text: arXiv Link OpenURL
Bowler, Nathan; Carmesin, Johannes An excluded minors method for infinite matroids. (English) Zbl 1375.05253 J. Comb. Theory, Ser. B 128, 104-113 (2018). MSC: 05C83 05B35 52B40 PDF BibTeX XML Cite \textit{N. Bowler} and \textit{J. Carmesin}, J. Comb. Theory, Ser. B 128, 104--113 (2018; Zbl 1375.05253) Full Text: DOI arXiv Link OpenURL
Bowler, Nathan; Carmesin, Johannes; Postle, Luke Reconstruction of infinite matroids from their 3-connected minors. (English) Zbl 1371.05042 Eur. J. Comb. 67, 126-144 (2018). MSC: 05B35 52B40 05C40 05C83 PDF BibTeX XML Cite \textit{N. Bowler} et al., Eur. J. Comb. 67, 126--144 (2018; Zbl 1371.05042) Full Text: DOI arXiv Link OpenURL
Maniu, Silviu; Cheng, Reynold; Senellart, Pierre An indexing framework for queries on probabilistic graphs. (English) Zbl 1474.68113 ACM Trans. Database Syst. 42, No. 2, Article No. 13, 34 p. (2017). MSC: 68P15 68P05 68R10 PDF BibTeX XML Cite \textit{S. Maniu} et al., ACM Trans. Database Syst. 42, No. 2, Article No. 13, 34 p. (2017; Zbl 1474.68113) Full Text: DOI OpenURL
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Merker, Martin; Thomassé, Stéphan A proof of the Barát-Thomassen conjecture. (English) Zbl 1398.05158 J. Comb. Theory, Ser. B 124, 39-55 (2017). MSC: 05C70 05C05 05C40 PDF BibTeX XML Cite \textit{J. Bensmail} et al., J. Comb. Theory, Ser. B 124, 39--55 (2017; Zbl 1398.05158) Full Text: DOI arXiv OpenURL
Bojańczyk, Mikołaj; Pilipczuk, Michał Optimizing tree decompositions in MSO. (English) Zbl 1402.68140 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 15, 13 p. (2017). MSC: 68R10 03B15 03D05 68Q45 PDF BibTeX XML Cite \textit{M. Bojańczyk} and \textit{M. Pilipczuk}, LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 15, 13 p. (2017; Zbl 1402.68140) Full Text: DOI OpenURL
Gaspers, Serge; Gudmundsson, Joachim; Jones, Mitchell; Mestre, Julián; Rümmele, Stefan Turbocharging treewidth heuristics. (English) Zbl 1398.68490 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 13, 13 p. (2017). MSC: 68T20 68Q17 68Q25 PDF BibTeX XML Cite \textit{S. Gaspers} et al., LIPIcs -- Leibniz Int. Proc. Inform. 63, Article 13, 13 p. (2017; Zbl 1398.68490) Full Text: DOI OpenURL
Jégou, Philippe; Terrioux, Cyril Combining restarts, nogoods and bag-connected decompositions for solving csps. (English) Zbl 1384.90113 Constraints 22, No. 2, 191-229 (2017). MSC: 90C35 PDF BibTeX XML Cite \textit{P. Jégou} and \textit{C. Terrioux}, Constraints 22, No. 2, 191--229 (2017; Zbl 1384.90113) Full Text: DOI Link OpenURL
Mills, K. Alex; Chandrasekaran, R.; Mittal, Neeraj Lexico-minimum replica placement in multitrees. (English) Zbl 1474.68066 Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10628, 122-137 (2017). MSC: 68P05 68Q25 90C29 90C35 PDF BibTeX XML Cite \textit{K. A. Mills} et al., Lect. Notes Comput. Sci. 10628, 122--137 (2017; Zbl 1474.68066) Full Text: DOI arXiv OpenURL
Heuer, Karl Excluding a full grid minor. (English) Zbl 1377.05127 Abh. Math. Semin. Univ. Hamb. 87, No. 2, 265-274 (2017). MSC: 05C63 05C83 05C05 05C70 PDF BibTeX XML Cite \textit{K. Heuer}, Abh. Math. Semin. Univ. Hamb. 87, No. 2, 265--274 (2017; Zbl 1377.05127) Full Text: DOI arXiv OpenURL
Fürer, Martin; Yu, Huiwen Space saving by dynamic algebraization based on tree-depth. (English) Zbl 1379.68379 Theory Comput. Syst. 61, No. 2, 283-304 (2017). MSC: 68W40 68R10 90C39 PDF BibTeX XML Cite \textit{M. Fürer} and \textit{H. Yu}, Theory Comput. Syst. 61, No. 2, 283--304 (2017; Zbl 1379.68379) Full Text: DOI OpenURL
Tu, Jianhua; Wu, Lidong; Yuan, Jing; Cui, Lei On the vertex cover \(P_3\) problem parameterized by treewidth. (English) Zbl 1381.90076 J. Comb. Optim. 34, No. 2, 414-425 (2017). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Tu} et al., J. Comb. Optim. 34, No. 2, 414--425 (2017; Zbl 1381.90076) Full Text: DOI OpenURL
Erde, Joshua Refining a tree-decomposition which distinguishes tangles. (English) Zbl 1366.05104 SIAM J. Discrete Math. 31, No. 3, 1529-1551 (2017). MSC: 05C83 PDF BibTeX XML Cite \textit{J. Erde}, SIAM J. Discrete Math. 31, No. 3, 1529--1551 (2017; Zbl 1366.05104) Full Text: DOI arXiv OpenURL
Madani, Ramtin; Sojoudi, Somayeh; Fazelnia, Ghazal; Lavaei, Javad Finding low-rank solutions of sparse linear matrix inequalities using convex optimization. (English) Zbl 1365.90185 SIAM J. Optim. 27, No. 2, 725-758 (2017). MSC: 90C20 90C22 90C25 90C26 90C30 90C35 90C90 52A41 PDF BibTeX XML Cite \textit{R. Madani} et al., SIAM J. Optim. 27, No. 2, 725--758 (2017; Zbl 1365.90185) Full Text: DOI OpenURL
van Wersch, Rim; Kelk, Steven ToTo: an open database for computation, storage and retrieval of tree decompositions. (English) Zbl 1358.05002 Discrete Appl. Math. 217, Part 3, 389-393 (2017). MSC: 05-04 05C85 05C05 PDF BibTeX XML Cite \textit{R. van Wersch} and \textit{S. Kelk}, Discrete Appl. Math. 217, Part 3, 389--393 (2017; Zbl 1358.05002) Full Text: DOI OpenURL
Hidalgo, Marta R.; Joan-Arinyo, Robert A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. (English) Zbl 1356.68160 J. Symb. Comput. 79, Part 2, 232-248 (2017). MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{M. R. Hidalgo} and \textit{R. Joan-Arinyo}, J. Symb. Comput. 79, Part 2, 232--248 (2017; Zbl 1356.68160) Full Text: DOI Link OpenURL
Carmesin, Johannes; Gollin, J. Pascal Canonical tree-decompositions of a graph that display its \(k\)-blocks. (English) Zbl 1350.05133 J. Comb. Theory, Ser. B 122, 1-20 (2017). MSC: 05C70 05C40 PDF BibTeX XML Cite \textit{J. Carmesin} and \textit{J. P. Gollin}, J. Comb. Theory, Ser. B 122, 1--20 (2017; Zbl 1350.05133) Full Text: DOI arXiv OpenURL
Bojańczyk, Mikołaj; Pilipczuk, Michał Definability equals recognizability for graphs of bounded treewidth. (English) Zbl 1394.03062 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 407-416 (2016). MSC: 03D05 03B15 05C75 PDF BibTeX XML Cite \textit{M. Bojańczyk} and \textit{M. Pilipczuk}, in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 407--416 (2016; Zbl 1394.03062) Full Text: DOI arXiv OpenURL
Pilipczuk, Michał; Wrochna, Marcin On space efficiency of algorithms working on structural decompositions of graphs. (English) Zbl 1388.68133 Ollinger, Nicolas (ed.) et al., 33rd symposium on theoretical aspects of computer science, STACS 2016, Orléans, France, February 17–20, 2016. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-001-9). LIPIcs – Leibniz International Proceedings in Informatics 47, Article 57, 15 p. (2016). MSC: 68Q25 68M11 68Q15 68R10 PDF BibTeX XML Cite \textit{M. Pilipczuk} and \textit{M. Wrochna}, LIPIcs -- Leibniz Int. Proc. Inform. 47, Article 57, 15 p. (2016; Zbl 1388.68133) Full Text: DOI arXiv OpenURL
Bliem, Bernhard; Charwat, Günther; Hecher, Markus; Woltran, Stefan D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy. (English) Zbl 1374.68490 Fundam. Inform. 147, No. 1, 27-61 (2016). MSC: 68T20 90C39 PDF BibTeX XML Cite \textit{B. Bliem} et al., Fundam. Inform. 147, No. 1, 27--61 (2016; Zbl 1374.68490) Full Text: DOI OpenURL
Elberfeld, Michael Context-free graph properties via definable decompositions. (English) Zbl 1370.03049 Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 17, 16 p. (2016). MSC: 03C13 03B15 03D05 PDF BibTeX XML Cite \textit{M. Elberfeld}, LIPIcs -- Leibniz Int. Proc. Inform. 62, Article 17, 16~p. (2016; Zbl 1370.03049) Full Text: DOI OpenURL
Li, Peng; Wang, Jianxin; Ding, Changsong Energy-efficient data gathering scheme based on compressive sensing in wireless sensor networks. (Chinese. English summary) Zbl 1374.68029 Acta Autom. Sin. 42, No. 11, 1648-1656 (2016). MSC: 68M10 PDF BibTeX XML Cite \textit{P. Li} et al., Acta Autom. Sin. 42, No. 11, 1648--1656 (2016; Zbl 1374.68029) Full Text: DOI OpenURL
Besharati, Nazli; Ebrahimi, J. B.; Azadi, A. Independence number of generalized Petersen graphs. (English) Zbl 1413.05280 Ars Comb. 124, 239-255 (2016). MSC: 05C69 05C12 PDF BibTeX XML Cite \textit{N. Besharati} et al., Ars Comb. 124, 239--255 (2016; Zbl 1413.05280) Full Text: arXiv OpenURL
Benkoczi, Robert; Dahal, Ram; Gaur, Daya Ram Exact algorithms for weighted coloring in special classes of tree and cactus graphs. (English) Zbl 1478.68215 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 347-358 (2016). MSC: 68R10 05C15 05C85 68Q25 68W40 90C35 90C39 PDF BibTeX XML Cite \textit{R. Benkoczi} et al., Lect. Notes Comput. Sci. 9843, 347--358 (2016; Zbl 1478.68215) Full Text: DOI OpenURL
Lu, Wei; Zhang, Shujuan Tree decomposition method combined with separator in constraint satisfaction problems. (Chinese. English summary) Zbl 1349.68221 J. Jilin Univ., Sci. 54, No. 2, 291-296 (2016). MSC: 68T20 PDF BibTeX XML Cite \textit{W. Lu} and \textit{S. Zhang}, J. Jilin Univ., Sci. 54, No. 2, 291--296 (2016; Zbl 1349.68221) Full Text: DOI OpenURL
Hamann, Matthias; Weißauer, Daniel Bounding connected tree-width. (English) Zbl 1341.05025 SIAM J. Discrete Math. 30, No. 3, 1391-1400 (2016). MSC: 05C05 05C40 05C12 05C83 PDF BibTeX XML Cite \textit{M. Hamann} and \textit{D. Weißauer}, SIAM J. Discrete Math. 30, No. 3, 1391--1400 (2016; Zbl 1341.05025) Full Text: DOI arXiv OpenURL
Cao, Yixin; Marx, Dániel Chordal editing is fixed-parameter tractable. (English) Zbl 1344.68095 Algorithmica 75, No. 1, 118-137 (2016). MSC: 68Q25 05C85 PDF BibTeX XML Cite \textit{Y. Cao} and \textit{D. Marx}, Algorithmica 75, No. 1, 118--137 (2016; Zbl 1344.68095) Full Text: DOI arXiv Link OpenURL
Grohe, Martin; Schweitzer, Pascal Computing with tangles. (English) Zbl 1345.05101 SIAM J. Discrete Math. 30, No. 2, 1213-1247 (2016). MSC: 05C85 05C40 05C69 05C83 68P05 PDF BibTeX XML Cite \textit{M. Grohe} and \textit{P. Schweitzer}, SIAM J. Discrete Math. 30, No. 2, 1213--1247 (2016; Zbl 1345.05101) Full Text: DOI OpenURL
Roayaei, Mehdy; Razzazi, Mohammadreza An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification. (English) Zbl 1357.68088 Inf. Process. Lett. 116, No. 9, 590-594 (2016). MSC: 68Q25 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{M. Roayaei} and \textit{M. Razzazi}, Inf. Process. Lett. 116, No. 9, 590--594 (2016; Zbl 1357.68088) Full Text: DOI OpenURL
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F. Canonical tree-decompositions of finite graphs. II. Essential parts. (English) Zbl 1332.05134 J. Comb. Theory, Ser. B 118, 268-283 (2016). MSC: 05C83 05C05 05C70 PDF BibTeX XML Cite \textit{J. Carmesin} et al., J. Comb. Theory, Ser. B 118, 268--283 (2016; Zbl 1332.05134) Full Text: DOI arXiv OpenURL
Seymour, Paul Tree-chromatic number. (English) Zbl 1327.05125 J. Comb. Theory, Ser. B 116, 229-237 (2016). MSC: 05C15 05C05 05C70 PDF BibTeX XML Cite \textit{P. Seymour}, J. Comb. Theory, Ser. B 116, 229--237 (2016; Zbl 1327.05125) Full Text: DOI OpenURL
Aigner-Horev, Elad; Diestel, Reinhard; Postle, Luke The structure of 2-separations of infinite matroids. (English) Zbl 1327.05050 J. Comb. Theory, Ser. B 116, 25-56 (2016). MSC: 05B35 PDF BibTeX XML Cite \textit{E. Aigner-Horev} et al., J. Comb. Theory, Ser. B 116, 25--56 (2016; Zbl 1327.05050) Full Text: DOI arXiv OpenURL
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F. Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (English) Zbl 1327.05269 J. Comb. Theory, Ser. B 116, 1-24 (2016). MSC: 05C70 05C05 05C40 PDF BibTeX XML Cite \textit{J. Carmesin} et al., J. Comb. Theory, Ser. B 116, 1--24 (2016; Zbl 1327.05269) Full Text: DOI arXiv OpenURL
Wei-Kleiner, Fang Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs. (English) Zbl 1343.68072 J. Comput. Syst. Sci. 82, No. 1, Part A, 23-44 (2016). MSC: 68P15 05C85 PDF BibTeX XML Cite \textit{F. Wei-Kleiner}, J. Comput. Syst. Sci. 82, No. 1, Part A, 23--44 (2016; Zbl 1343.68072) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{B. Li} et al., Electron. Notes Discrete Math. 50, 21--27 (2015; Zbl 1347.05158) Full Text: DOI Link OpenURL
Fernandes, Cristina G.; Schmidt, Tina Janne; Taraz, Anusch On minimum bisection and related partition problems in graphs with bounded tree width. (English) Zbl 1346.05229 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 481-488, electronic only (2015). MSC: 05C70 05C12 PDF BibTeX XML Cite \textit{C. G. Fernandes} et al., Electron. Notes Discrete Math. 49, 481--488 (2015; Zbl 1346.05229) Full Text: DOI OpenURL
Zhang, Huirong; Cao, Jianwen Preconditioning algorithm for symmetric diagonally dominant linear systems. (Chinese. English summary) Zbl 1349.65113 J. Numer. Methods Comput. Appl. 36, No. 4, 310-322 (2015). MSC: 65F08 65F50 05C05 PDF BibTeX XML Cite \textit{H. Zhang} and \textit{J. Cao}, J. Numer. Methods Comput. Appl. 36, No. 4, 310--322 (2015; Zbl 1349.65113) OpenURL
Khodakarami, Farnoosh; Didehvar, Farzad; Mohades, Ali A fixed-parameter algorithm for guarding 1.5D terrains. (English) Zbl 1328.68262 Theor. Comput. Sci. 595, 130-142 (2015). MSC: 68U05 68Q17 PDF BibTeX XML Cite \textit{F. Khodakarami} et al., Theor. Comput. Sci. 595, 130--142 (2015; Zbl 1328.68262) Full Text: DOI OpenURL
Brettell, Nick; Semple, Charles An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid. (English) Zbl 1310.05041 Ann. Comb. 19, No. 1, 29-78 (2015). MSC: 05B35 05C05 05C40 PDF BibTeX XML Cite \textit{N. Brettell} and \textit{C. Semple}, Ann. Comb. 19, No. 1, 29--78 (2015; Zbl 1310.05041) Full Text: DOI OpenURL
Seymour, Paul Criticality for multicommodity flows. (English) Zbl 1303.05078 J. Comb. Theory, Ser. B 110, 136-179 (2015). MSC: 05C21 05C05 05C70 05C85 90B10 PDF BibTeX XML Cite \textit{P. Seymour}, J. Comb. Theory, Ser. B 110, 136--179 (2015; Zbl 1303.05078) Full Text: DOI OpenURL
Cao, Yixin; Marx, Dániel Chordal editing is fixed-parameter tractable. (English) Zbl 1359.05119 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 214-225 (2014). MSC: 05C85 68Q25 PDF BibTeX XML Cite \textit{Y. Cao} and \textit{D. Marx}, LIPIcs -- Leibniz Int. Proc. Inform. 25, 214--225 (2014; Zbl 1359.05119) Full Text: DOI OpenURL
Althaus, Ernst; Blumenstock, Markus; Disterhoft, Alexej; Hildebrandt, Andreas; Krupp, Markus Algorithms for the maximum weight connected \(k\)-induced subgraph problem. (English) Zbl 1431.90159 Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 268-282 (2014). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{E. Althaus} et al., Lect. Notes Comput. Sci. 8881, 268--282 (2014; Zbl 1431.90159) Full Text: DOI OpenURL
Bonato, Anthony; Clarke, Nancy E.; Finbow, Stephen; Fitzpatrick, Shannon; Messinger, Margaret-Ellen A note on bounds for the cop number using tree decompositions. (English) Zbl 1317.05119 Contrib. Discrete Math. 9, No. 2, 50-56 (2014). MSC: 05C57 PDF BibTeX XML Cite \textit{A. Bonato} et al., Contrib. Discrete Math. 9, No. 2, 50--56 (2014; Zbl 1317.05119) Full Text: arXiv OpenURL
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket Minimum bisection is fixed parameter tractable. (English) Zbl 1315.05134 Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 323-332 (2014). MSC: 05C85 05C70 05C22 68Q25 PDF BibTeX XML Cite \textit{M. Cygan} et al., in: Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, New York, NY, USA, May 31 -- June 3, 2014. New York, NY: Association for Computing Machinery (ACM). 323--332 (2014; Zbl 1315.05134) Full Text: DOI arXiv Link OpenURL
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F. \(k\)-blocks: a connectivity invariant for graphs. (English) Zbl 1309.05170 SIAM J. Discrete Math. 28, No. 4, 1876-1891 (2014). MSC: 05C83 05C85 05C40 05C12 PDF BibTeX XML Cite \textit{J. Carmesin} et al., SIAM J. Discrete Math. 28, No. 4, 1876--1891 (2014; Zbl 1309.05170) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{J. L. Gross}, Ars Math. Contemp. 7, No. 2, 379--403 (2014; Zbl 1306.05162) Full Text: DOI OpenURL
Dragan, Feodor F.; Köhler, Ekkehard An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs. (English) Zbl 1303.05186 Algorithmica 69, No. 4, 884-905 (2014). MSC: 05C85 68W25 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{E. Köhler}, Algorithmica 69, No. 4, 884--905 (2014; Zbl 1303.05186) Full Text: DOI OpenURL
Kriege, Nils; Mutzel, Petra Finding maximum common biconnected subgraphs in series-parallel graphs. (English) Zbl 1426.68129 Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 505-516 (2014). MSC: 68Q25 05C05 05C40 05C85 PDF BibTeX XML Cite \textit{N. Kriege} and \textit{P. Mutzel}, Lect. Notes Comput. Sci. 8635, 505--516 (2014; Zbl 1426.68129) Full Text: DOI OpenURL
Carmesin, Johannes; Diestel, Reinhard; Hundertmark, Fabian; Stein, Maya Connectivity and tree structure in finite graphs. (English) Zbl 1324.05104 Combinatorica 34, No. 1, 11-45 (2014). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C40 05C05 05C83 PDF BibTeX XML Cite \textit{J. Carmesin} et al., Combinatorica 34, No. 1, 11--45 (2014; Zbl 1324.05104) Full Text: DOI arXiv Link OpenURL
Dragan, Feodor F.; Abu-Ata, Muad Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. (English) Zbl 1417.68159 Theor. Comput. Sci. 547, 1-17 (2014). MSC: 68R10 05C85 68W25 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{M. Abu-Ata}, Theor. Comput. Sci. 547, 1--17 (2014; Zbl 1417.68159) Full Text: DOI OpenURL
Fürer, Martin; Yu, Huiwen Space saving by dynamic algebraization. (English) Zbl 1408.68073 Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. 9th international computer science symposium in Russia, CSR 2014, Moscow, Russia, June 7–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8476, 375-388 (2014). MSC: 68Q25 05C31 05C70 05C85 90C39 PDF BibTeX XML Cite \textit{M. Fürer} and \textit{H. Yu}, Lect. Notes Comput. Sci. 8476, 375--388 (2014; Zbl 1408.68073) Full Text: DOI arXiv Link OpenURL
Tran, Van Du T.; Chassignet, Philippe; Steyaert, Jean-Marc On permuted super-secondary structures of transmembrane \(\beta\)-barrel proteins. (English) Zbl 1422.92108 Theor. Comput. Sci. 540-541, 133-142 (2014). MSC: 92D20 PDF BibTeX XML Cite \textit{V. D. T. Tran} et al., Theor. Comput. Sci. 540--541, 133--142 (2014; Zbl 1422.92108) Full Text: DOI Link OpenURL
Bhattacharya, Binay; Shi, Qiaosheng Improved algorithms to network \(p\)-center location problems. (English) Zbl 1281.65028 Comput. Geom. 47, No. 2, Part C, 307-315 (2014). MSC: 65D18 PDF BibTeX XML Cite \textit{B. Bhattacharya} and \textit{Q. Shi}, Comput. Geom. 47, No. 2, Part C, 307--315 (2014; Zbl 1281.65028) Full Text: DOI OpenURL
Fazekas, Szilárd Zsolt; Ito, Hiro; Okuno, Yasushi; Seki, Shinnosuke; Taneishi, Kei On computational complexity of graph inference from counting. (English) Zbl 1333.68141 Nat. Comput. 12, No. 4, 589-603 (2013). MSC: 68Q25 92E10 PDF BibTeX XML Cite \textit{S. Z. Fazekas} et al., Nat. Comput. 12, No. 4, 589--603 (2013; Zbl 1333.68141) Full Text: DOI OpenURL
Katoh, Naoki; Tanigawa, Shin-Ichi Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries. (English) Zbl 1268.05160 SIAM J. Discrete Math. 27, No. 1, 155-185 (2013). MSC: 05C70 05C05 52C25 90C25 PDF BibTeX XML Cite \textit{N. Katoh} and \textit{S.-I. Tanigawa}, SIAM J. Discrete Math. 27, No. 1, 155--185 (2013; Zbl 1268.05160) Full Text: DOI arXiv OpenURL
Fontaine, Mathieu; Loudni, Samir; Boizumault, Patrice Exploiting tree decomposition for guiding neighborhoods exploration for VNS. (English) Zbl 1267.68211 RAIRO, Oper. Res. 47, No. 2, 91-123 (2013). MSC: 68T20 PDF BibTeX XML Cite \textit{M. Fontaine} et al., RAIRO, Oper. Res. 47, No. 2, 91--123 (2013; Zbl 1267.68211) Full Text: DOI Link OpenURL
Oxley, James; Semple, Charles Constructing a 3-tree for a 3-connected matroid. (English) Zbl 1256.05046 Adv. Appl. Math. 50, No. 1, 176-200 (2013). MSC: 05B35 05C05 05C70 PDF BibTeX XML Cite \textit{J. Oxley} and \textit{C. Semple}, Adv. Appl. Math. 50, No. 1, 176--200 (2013; Zbl 1256.05046) Full Text: DOI OpenURL
Bykova, V. V. FPT-algorithms on graphs of limited treewidth. (Russian. English summary) Zbl 1478.68221 Prikl. Diskretn. Mat. 2012, No. 2(16), 65-78 (2012). MSC: 68R10 05C85 90C39 PDF BibTeX XML Cite \textit{V. V. Bykova}, Prikl. Diskretn. Mat. 2012, No. 2(16), 65--78 (2012; Zbl 1478.68221) Full Text: MNR OpenURL
Loudni, Samir; Fontaine, Mathieu; Boizumault, Patrice Exploiting separators for guiding VNS. (English) Zbl 1268.68152 Sifaleras, Angelo (ed.) et al., Selected papers of the 28th EURO mini conference (MEC XXVIII) on variable neighborhood search, Herceg Novi, Mentenegro, October 4–7, 2012. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 39, 265-272 (2012). MSC: 68T20 PDF BibTeX XML Cite \textit{S. Loudni} et al., Electron. Notes Discrete Math. 39, 265--272 (2012; Zbl 1268.68152) Full Text: DOI HAL OpenURL