{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T14:01:30Z","timestamp":1784815290435,"version":"3.55.0"},"reference-count":71,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["0013103"],"award-info":[{"award-number":["0013103"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["I0-0035"],"award-info":[{"award-number":["I0-0035"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J1-70035"],"award-info":[{"award-number":["J1-70035"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J1-60012"],"award-info":[{"award-number":["J1-60012"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J1-70046"],"award-info":[{"award-number":["J1-70046"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["N1-0370"],"award-info":[{"award-number":["N1-0370"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["P1-0383"],"award-info":[{"award-number":["P1-0383"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001114","name":"Endocrine Society of Australia","doi-asserted-by":"publisher","award":["2024 [52"],"award-info":[{"award-number":["2024 [52"]}],"id":[{"id":"10.13039\/501100001114","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2021\/41\/N\/ST6\/01507"],"award-info":[{"award-number":["2021\/41\/N\/ST6\/01507"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2024\/54\/E\/ST6\/00094"],"award-info":[{"award-number":["2024\/54\/E\/ST6\/00094"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100031896","name":"Univerza na Primorskem","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100031896","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011958","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["2098-00012B"],"award-info":[{"award-number":["2098-00012B"]}],"id":[{"id":"10.13039\/501100011958","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jcss.2026.103819","type":"journal-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:13:16Z","timestamp":1780585996000},"page":"103819","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tree decompositions meet induced matchings: beyond Max Weight Independent Set"],"prefix":"10.1016","volume":"161","author":[{"given":"Paloma T.","family":"de Lima","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Mur\u0161i\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karolina","family":"Okrasa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1772-7404","authenticated-orcid":false,"given":"Kenny","family":"\u0160torgel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jcss.2026.103819_br0010","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1002\/jgt.23104","article-title":"Tree independence number I. (Even hole, diamond, pyramid)-free graphs","volume":"106","author":"Abrishami","year":"2024","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.jcss.2026.103819_br0020","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1137\/24M1659960","article-title":"Excluding a clique or a biclique in graphs of bounded induced matching treewidth","volume":"39","author":"Abrishami","year":"2025","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10.1016\/j.jcss.2026.103819_br0030","first-page":"1","article-title":"Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth","volume":"2022","author":"Abrishami","year":"2022","journal-title":"Adv. Comb."},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0040","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1137\/20M1383732","article-title":"Induced subgraphs of bounded treewidth and the container method","volume":"53","author":"Abrishami","year":"2024","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0050","series-title":"Width functions for hypertree decompositions","author":"Adler","year":"2006"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0060","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/ijoc.2017.0764","article-title":"Integer programming formulations and benders decomposition for the maximum induced matching problem","volume":"30","author":"Ahat","year":"2018","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"10.1016\/j.jcss.2026.103819_br0070","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1515\/dma.2007.030","article-title":"An upper bound for the number of maximal independent sets in a graph","volume":"17","author":"Alekseev","year":"2007","journal-title":"Discrete Math. Appl."},{"key":"10.1016\/j.jcss.2026.103819_br0080","author":"Alon"},{"issue":"2","key":"10.1016\/j.jcss.2026.103819_br0090","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"10.1016\/j.jcss.2026.103819_br0100","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1017\/S1446788700025696","article-title":"Powers of chordal graphs","volume":"35","author":"Balakrishnan","year":"1983","journal-title":"J. Aust. Math. Soc. Ser. A"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0110","first-page":"18","article-title":"Defective coloring on classes of perfect graphs","volume":"24","author":"Belmonte","year":"2022","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0120","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/s10878-014-9753-x","article-title":"The k-separator problem: polyhedra, complexity and approximation results","volume":"29","author":"Ben-Ameur","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.jcss.2026.103819_br0130","series-title":"15th International Symposium on Parameterized and Exact Computation","article-title":"Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth","volume":"vol. 180","author":"Bergougnoux","year":"2020"},{"key":"10.1016\/j.jcss.2026.103819_br0140","series-title":"52nd International Colloquium on Automata, Languages, and Programming","article-title":"Mim-width is paraNP-complete","volume":"vol. 334","author":"Bergougnoux","year":"2025"},{"key":"10.1016\/j.jcss.2026.103819_br0150","series-title":"Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms","first-page":"3282","article-title":"A logic-based algorithmic meta-theorem for mim-width","author":"Bergougnoux","year":"2023"},{"key":"10.1016\/j.jcss.2026.103819_br0160","series-title":"Graph-Theoretic Concepts in Computer Science - 49th International Workshop, Revised Selected Papers","first-page":"72","article-title":"New width parameters for independent set: one-sided-mim-width and neighbor-depth","volume":"vol. 14093","author":"Bergougnoux","year":"2023"},{"key":"10.1016\/j.jcss.2026.103819_br0170","author":"Bergougnoux"},{"key":"10.1016\/j.jcss.2026.103819_br0180","series-title":"Nonserial Dynamic Programming","author":"Bertele","year":"1972"},{"issue":"6","key":"10.1016\/j.jcss.2026.103819_br0190","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0200","article-title":"Treewidth is NP-complete on cubic graphs","volume":"32","author":"Bodlaender","year":"2025","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.jcss.2026.103819_br0210","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/130947374","article-title":"A ckn 5-approximation algorithm for treewidth","volume":"45","author":"Bodlaender","year":"2016","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0220","series-title":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"2043","article-title":"Finding sparse induced subgraphs on graphs of bounded induced matching treewidth","author":"Bodlaender","year":"2026"},{"key":"10.1016\/j.jcss.2026.103819_br0230","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.jctb.2024.03.003","article-title":"Sparse graphs with bounded induced cycle packing number have logarithmic treewidth","volume":"167","author":"Bonamy","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"5&6","key":"10.1016\/j.jcss.2026.103819_br0240","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0250","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","article-title":"Treewidth and minimum fill-in: grouping the minimal separators","volume":"31","author":"Bouchitt\u00e9","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0260","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104163","article-title":"Comparing width parameters on graph classes","volume":"127","author":"Brettell","year":"2025","journal-title":"Eur. J. Comb."},{"issue":"2-3, Ser. B","key":"10.1016\/j.jcss.2026.103819_br0270","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10107-005-0649-5","article-title":"Independent packings in structured graphs","volume":"105","author":"Cameron","year":"2006","journal-title":"Math. Program."},{"key":"10.1016\/j.jcss.2026.103819_br0280","series-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"4444","article-title":"Tree independence number IV. Even-hole-free graphs","author":"Chudnovsky","year":"2025"},{"key":"10.1016\/j.jcss.2026.103819_br0290","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.jctb.2025.08.003","article-title":"Tree independence number II. Three-path-configurations","volume":"176","author":"Chudnovsky","year":"2026","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcss.2026.103819_br0300","author":"Chudnovsky"},{"key":"10.1016\/j.jcss.2026.103819_br0310","series-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms","first-page":"5291","article-title":"Sparse induced subgraphs in P6-free graphs","author":"Chudnovsky","year":"2024"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0320","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0330","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0340","doi-asserted-by":"crossref","DOI":"10.1145\/3767730","article-title":"Computing tree decompositions with small independence number","volume":"22","author":"Dallard","year":"2025","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jcss.2026.103819_br0350","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.jctb.2024.03.005","article-title":"Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure","volume":"167","author":"Dallard","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.jcss.2026.103819_br0360","doi-asserted-by":"crossref","first-page":"2618","DOI":"10.1137\/20M1352119","article-title":"Treewidth versus clique number. I. Graph classes with a forbidden structure","volume":"35","author":"Dallard","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jcss.2026.103819_br0370","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.jctb.2023.10.006","article-title":"Treewidth versus clique number. II. Tree-independence number","volume":"164","author":"Dallard","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcss.2026.103819_br0380","series-title":"Topics on Perfect Graphs","first-page":"67","article-title":"Classical perfect graphs: an introduction with emphasis on triangulated and interval graphs","volume":"vol. 88","author":"Duchet","year":"1984"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0390","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10878-012-9594-4","article-title":"Distance-d independent set problems for bipartite and chordal graphs","volume":"27","author":"Eto","year":"2014","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0400","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/140964801","article-title":"Large induced subgraphs via triangulations and CMSO","volume":"44","author":"Fomin","year":"2015","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0410","author":"Gartland"},{"key":"10.1016\/j.jcss.2026.103819_br0420","series-title":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event","first-page":"330","article-title":"Finding large induced sparse subgraphs in C>t-free graphs in quasipolynomial time","author":"Gartland","year":"2021"},{"key":"10.1016\/j.jcss.2026.103819_br0430","series-title":"Model Theoretic Methods in Finite Combinatorics - AMS-ASL Joint Special Session","first-page":"181","article-title":"Methods for algorithmic meta theorems","volume":"vol. 558","author":"Grohe","year":"2009"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0440","doi-asserted-by":"crossref","DOI":"10.1145\/3414473","article-title":"Polynomial-time algorithm for maximum weight independent set on P6-free graphs","volume":"18","author":"Grzesik","year":"2022","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0450","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01917434","article-title":"S-functions for graphs","volume":"8","author":"Halin","year":"1976","journal-title":"J. Geom."},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0460","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/net.20318","article-title":"Improper coloring of unit disk graphs","volume":"54","author":"Havet","year":"2009","journal-title":"Networks"},{"key":"10.1016\/j.jcss.2026.103819_br0470","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1802","article-title":"A near-optimal planarization algorithm","author":"Jansen","year":"2014"},{"key":"10.1016\/j.jcss.2026.103819_br0480","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2017.09.006","article-title":"A width parameter useful for chordal and co-comparability graphs","volume":"704","author":"Kang","year":"2017","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103819_br0490","article-title":"A single-exponential time 2-approximation algorithm for treewidth","author":"Korhonen","year":"2026","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0500","series-title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","first-page":"528","article-title":"An improved parameterized algorithm for treewidth","author":"Korhonen","year":"2023"},{"issue":"1\u20132, Ser. A","key":"10.1016\/j.jcss.2026.103819_br0510","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-018-1255-7","article-title":"Partitioning a graph into small pieces with applications to path transversal","volume":"177","author":"Lee","year":"2019","journal-title":"Math. Program."},{"key":"10.1016\/j.jcss.2026.103819_br0520","series-title":"32nd Annual European Symposium on Algorithms","article-title":"Tree decompositions meet induced matchings: beyond max weight independent set","volume":"vol. 308","author":"Lima","year":"2024"},{"key":"10.1016\/j.jcss.2026.103819_br0530","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"570","article-title":"Independent set in P5-free graphs in polynomial time","author":"Lokshantov","year":"2014"},{"key":"10.1016\/j.jcss.2026.103819_br0540","author":"Lokshtanov"},{"issue":"6","key":"10.1016\/j.jcss.2026.103819_br0550","doi-asserted-by":"crossref","DOI":"10.1145\/2535926","article-title":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries","volume":"60","author":"Marx","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2026.103819_br0560","series-title":"Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Revised Selcted Papers","first-page":"172","article-title":"Parameterized algorithms for even cycle transversal","volume":"vol. 7551","author":"Misra","year":"2012"},{"key":"10.1016\/j.jcss.2026.103819_br0570","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.113825","article-title":"On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs","volume":"955","author":"Munaro","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103819_br0580","article-title":"Sparsity - Graphs, Structures, and Algorithms","volume":"vol. 28","author":"Ne\u0161et\u0159il","year":"2012"},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0590","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.disc.2005.12.008","article-title":"Minimal separators in P4-sparse graphs","volume":"306","author":"Nikolopoulos","year":"2006","journal-title":"Discrete Math."},{"issue":"13","key":"10.1016\/j.jcss.2026.103819_br0600","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1016\/j.dam.2011.04.023","article-title":"The complexity of dissociation set problems in graphs","volume":"159","author":"Orlovich","year":"2011","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.jcss.2026.103819_br0610","doi-asserted-by":"crossref","first-page":"2453","DOI":"10.1137\/22M1468864","article-title":"Feedback vertex set and even cycle transversal for H-free graphs: finding large block graphs","volume":"36","author":"Paesani","year":"2022","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0620","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s10878-020-00611-2","article-title":"Maximum weight induced matching in some subclasses of bipartite graphs","volume":"40","author":"Panda","year":"2020","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.jcss.2026.103819_br0630","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.dam.2016.05.019","article-title":"A tight lower bound for vertex planarization on graphs of bounded treewidth","volume":"231","author":"Pilipczuk","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103819_br0640","first-page":"307","article-title":"A note on stable sets and colorings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carol."},{"key":"10.1016\/j.jcss.2026.103819_br0650","first-page":"264","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey","year":"1929","journal-title":"Proc. Lond. Math. Soc. (2)"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0660","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. Planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.jcss.2026.103819_br0670","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors. XIII. The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"10.1016\/j.jcss.2026.103819_br0680","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.jcss.2026.103819_br0690","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103819_br0700","series-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"219","article-title":"Minor-matching hypertree width","author":"Yolov","year":"2018"},{"key":"10.1016\/j.jcss.2026.103819_br0710","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.dam.2016.11.007","article-title":"Approximate association via dissociation","volume":"219","author":"You","year":"2017","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000656?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000656?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:14:05Z","timestamp":1784812445000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":71,"alternative-id":["S0022000026000656"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103819","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tree decompositions meet induced matchings: beyond Max Weight Independent Set","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103819","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"103819"}}