{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:11:40Z","timestamp":1766178700164,"version":"3.48.0"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"vor","delay-in-days":297,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101222524"],"award-info":[{"award-number":["101222524"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015595","name":"Ethereum Foundation","doi-asserted-by":"publisher","award":["FY24-1793"],"award-info":[{"award-number":["FY24-1793"]}],"id":[{"id":"10.13039\/501100015595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.10.305","type":"journal-article","created":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:19:08Z","timestamp":1764058748000},"page":"247-254","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity"],"prefix":"10.1016","volume":"273","author":[{"given":"Giovanna Kobus","family":"Conrado","sequence":"first","affiliation":[]},{"given":"Amir Kafshdar","family":"Goharshady","sequence":"additional","affiliation":[]},{"given":"Harshit Jitendra","family":"Motwani","sequence":"additional","affiliation":[]},{"given":"Sergei","family":"Novozhilov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.10.305_bib1","first-page":"31","article-title":"Historical development of topological indices, in: Topological indices and related descriptors in QSAR and QSPR","author":"Balaban","year":"2000","journal-title":"CRC Press"},{"key":"10.1016\/j.procs.2025.10.305_bib2","first-page":"573","article-title":"Information theoretic indices of neighborhood complexity and their applications, in: Topological indices and related descriptors in QSAR and QSPR","author":"Basak","year":"2000","journal-title":"CRC Press"},{"key":"10.1016\/j.procs.2025.10.305_bib3","unstructured":"for Biotechnology Information, N.C.,. Pubchem database. https:\/\/pubchem.ncbi.nlm.nih.gov."},{"key":"10.1016\/j.procs.2025.10.305_bib4","first-page":"105","article-title":"Dynamic programming on graphs with bounded treewidth","author":"Bodlaender","year":"1988","journal-title":"in: ICALP"},{"key":"10.1016\/j.procs.2025.10.305_bib5","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta cybernetica"},{"year":"2018","series-title":"Chemical graph theory: introduction and fundamentals","author":"Bonchev","key":"10.1016\/j.procs.2025.10.305_bib6"},{"key":"10.1016\/j.procs.2025.10.305_bib7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.amc.2017.02.021","article-title":"Network entropies based on independent sets and matchings","volume":"307","author":"Cao","year":"2017","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.procs.2025.10.305_bib8","series-title":"Faster treewidth-based approximations for Wiener index, in: 22nd International Symposium on Experimental Algorithms (SEA 2024)","first-page":"6","author":"Conrado","year":"2024"},{"key":"10.1016\/j.procs.2025.10.305_bib9","doi-asserted-by":"crossref","unstructured":"Conrado, G.K., Goharshady, A.K., Motwani, H.J., Novozhilov, S., 2025. Combinatorial parameterized algorithms for chemical descriptors based on molecular graph sparsity. arXiv:2303.13279.","DOI":"10.1016\/j.procs.2025.10.305"},{"key":"10.1016\/j.procs.2025.10.305_bib10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","article-title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","volume":"108","author":"Courcelle","year":"2001","journal-title":"Discrete applied mathematics"},{"year":"2015","series-title":"Parameterized algorithms","author":"Cygan","key":"10.1016\/j.procs.2025.10.305_bib11"},{"key":"10.1016\/j.procs.2025.10.305_bib12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-319-56850-8_2","article-title":"The use of topological indices in QSAR and QSPR modeling","author":"Dearden","year":"2017","journal-title":"Advances in QSAR Modeling: Applications in Pharmaceutical, Chemical, Food, Agricultural and Environmental Sciences"},{"key":"10.1016\/j.procs.2025.10.305_bib13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1006\/jagm.1999.1071","article-title":"On Markov chains for independent sets","volume":"35","author":"Dyer","year":"2000","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.procs.2025.10.305_bib14","doi-asserted-by":"crossref","first-page":"1784","DOI":"10.1016\/j.drudis.2018.06.016","article-title":"Neural network and deep-learning algorithms used in QSAR studies: merits and drawbacks","volume":"23","author":"Ghasemi","year":"2018","journal-title":"Drug discovery today"},{"key":"10.1016\/j.procs.2025.10.305_bib15","first-page":"2332","article-title":"Topological index","volume":"44","author":"Hosoya","year":"1971","journal-title":"a newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bulletin of the Chemical Society of Japan"},{"key":"10.1016\/j.procs.2025.10.305_bib16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01010403","article-title":"Two-dimensional monomer-dimer systems are computationally intractable","volume":"48","author":"Jerrum","year":"1987","journal-title":"Journal of Statistical Physics"},{"key":"10.1016\/j.procs.2025.10.305_bib17","doi-asserted-by":"crossref","first-page":"D1373","DOI":"10.1093\/nar\/gkac956","article-title":"Pubchem 2023 update","volume":"51","author":"Kim","year":"2023","journal-title":"Nucleic Acids Research"},{"year":"2012","series-title":"Handbook of computational chemistry. volume 3","author":"Leszczynski","key":"10.1016\/j.procs.2025.10.305_bib18"},{"key":"10.1016\/j.procs.2025.10.305_bib19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF00551410","article-title":"The structures of molecular topological spaces","volume":"55","author":"Merrifield","year":"1980","journal-title":"Theoretica chimica acta"},{"key":"10.1016\/j.procs.2025.10.305_bib20","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1517\/17460441.2010.492827","article-title":"Advances in computational methods to predict the biological activity of compounds","volume":"5","author":"Nantasenamat","year":"2010","journal-title":"Expert opinion on drug discovery"},{"key":"10.1016\/j.procs.2025.10.305_bib21","first-page":"113","article-title":"The Zagreb indices 30 years after","volume":"76","author":"Nikoli\u0107","year":"2003","journal-title":"Croatica chemica acta"},{"key":"10.1016\/j.procs.2025.10.305_bib22","first-page":"105","article-title":"The Wiener index: Development and applications","volume":"68","author":"Nikoli\u0107","year":"1995","journal-title":"Croatica Chemica Acta"},{"key":"10.1016\/j.procs.2025.10.305_bib23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S1093-3263(01)00098-5","article-title":"The connectivity index 25 years after","volume":"20","author":"Randi\u0107","year":"2001","journal-title":"Journal of Molecular Graphics and Modelling"},{"key":"10.1016\/j.procs.2025.10.305_bib24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors","volume":"35","author":"Robertson","year":"1983","journal-title":"i. excluding a forest. J. Comb. Theory B"},{"key":"10.1016\/j.procs.2025.10.305_bib25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors","volume":"36","author":"Robertson","year":"1984","journal-title":"iii. planar tree-width. Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.procs.2025.10.305_bib26","unstructured":"van Rooij, J.M.M., Bodlaender, H.L., van Leeuwen, E.J., Rossmanith, P., Vatshelle, M., 2018. Fast dynamic programming on graph decompositions. CoRR abs\/1806.01667."},{"year":"2008","series-title":"Handbook of molecular descriptors","author":"Todeschini","key":"10.1016\/j.procs.2025.10.305_bib27"},{"year":"2018","series-title":"Chemical graph theory","author":"Trinajstic","key":"10.1016\/j.procs.2025.10.305_bib28"},{"key":"10.1016\/j.procs.2025.10.305_bib29","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.procs.2025.10.305_bib30","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.amc.2018.03.017","article-title":"Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth","volume":"332","author":"Wan","year":"2018","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.procs.2025.10.305_bib31","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2174\/1386207003331454","article-title":"Molecular descriptors in chemoinformatics, computational combinatorial chemistry, and virtual screening","volume":"3","author":"Xue","year":"2000","journal-title":"Combinatorial chemistry & high throughput screening"},{"key":"10.1016\/j.procs.2025.10.305_bib32","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.chemolab.2015.06.016","article-title":"Chemometrics tools in QSAR\/QSPR studies: A historical perspective","volume":"149","author":"Yousefinejad","year":"2015","journal-title":"Chemometrics and Intelligent Laboratory Systems"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503652X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503652X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:01:50Z","timestamp":1766156510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187705092503652X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":32,"alternative-id":["S187705092503652X"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.305","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.305","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}