{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:02:45Z","timestamp":1780495365890,"version":"3.54.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:00:00Z","timestamp":1775174400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Dutch Research Council","doi-asserted-by":"publisher","award":["OCENW.M.21.306"],"award-info":[{"award-number":["OCENW.M.21.306"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Dutch Research Council","doi-asserted-by":"publisher","award":["OCENW.KLEIN.125"],"award-info":[{"award-number":["OCENW.KLEIN.125"]}],"id":[{"id":"10.13039\/501100003246","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,9]]},"DOI":"10.1016\/j.jcss.2026.103802","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T15:22:03Z","timestamp":1774970523000},"page":"103802","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exact and heuristic computation of the scanwidth of directed acyclic graphs"],"prefix":"10.1016","volume":"160","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6162-9668","authenticated-orcid":false,"given":"Niels","family":"Holtgrefe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leo","family":"van Iersel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103802_br0010","series-title":"Graph Theory","author":"Diestel","year":"2017"},{"key":"10.1016\/j.jcss.2026.103802_br0020","series-title":"46th International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2020)","first-page":"519","article-title":"Scanning phylogenetic networks is NP-hard","author":"Berry","year":"2020"},{"issue":"9","key":"10.1016\/j.jcss.2026.103802_br0030","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pcbi.1008380","article-title":"On the inference of complex phylogenetic networks by Markov chain Monte-Carlo","volume":"17","author":"Rabier","year":"2021","journal-title":"PLoS Comput. Biol."},{"issue":"4","key":"10.1016\/j.jcss.2026.103802_br0040","first-page":"2","article-title":"Embedding phylogenetic trees in networks of low treewidth","volume":"25","author":"van Iersel","year":"2023","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"11","key":"10.1016\/j.jcss.2026.103802_br0050","doi-asserted-by":"crossref","first-page":"2993","DOI":"10.1007\/s00453-017-0366-5","article-title":"On unrooted and root-uncertain variants of several well-known phylogenetic network problems","volume":"80","author":"van Iersel","year":"2017","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103802_br0060","doi-asserted-by":"crossref","DOI":"10.1186\/s13015-022-00216-w","article-title":"Treewidth-based algorithms for the small parsimony problem on networks","volume":"17","author":"Scornavacca","year":"2022","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"10.1016\/j.jcss.2026.103802_br0070","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1186\/s13015-023-00233-3","article-title":"Constructing phylogenetic networks via cherry picking and machine learning","volume":"18","author":"Bernardini","year":"2023","journal-title":"Algorithms Mol. Biol."},{"issue":"7","key":"10.1016\/j.jcss.2026.103802_br0080","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1007\/s00453-022-00946-8","article-title":"New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees","volume":"84","author":"Borst","year":"2022","journal-title":"Algorithmica"},{"issue":"12","key":"10.1016\/j.jcss.2026.103802_br0090","doi-asserted-by":"crossref","first-page":"i124","DOI":"10.1093\/bioinformatics\/btq202","article-title":"Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters","volume":"26","author":"van Iersel","year":"2010","journal-title":"Bioinformatics"},{"issue":"12","key":"10.1016\/j.jcss.2026.103802_br0100","doi-asserted-by":"crossref","first-page":"256","DOI":"10.3390\/a12120256","article-title":"Parameterized algorithms in bioinformatics: an overview","volume":"12","author":"Bulteau","year":"2019","journal-title":"Algorithms"},{"key":"10.1016\/j.jcss.2026.103802_br0110","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.dam.2023.07.023","article-title":"Edge-treewidth: algorithmic and combinatorial properties","volume":"341","author":"Magne","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.jcss.2026.103802_br0120","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.jcss.2008.10.003","article-title":"Derivation of algorithms for cutwidth and related graph layout parameters","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2026.103802_br0130","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","article-title":"A survey of graph layout problems","volume":"34","author":"D\u00edaz","year":"2002","journal-title":"ACM Comput. Surv."},{"issue":"105","key":"10.1016\/j.jcss.2026.103802_br0140","article-title":"Addenda to the survey of layout problems","volume":"3","author":"Petit","year":"2013","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2026.103802_br0150","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","article-title":"A note on exact algorithms for vertex ordering problems on graphs","volume":"50","author":"Bodlaender","year":"2011","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2026.103802_br0160","series-title":"Computing the scanwidth of directed acyclic graphs","author":"Holtgrefe","year":"2023"},{"issue":"6","key":"10.1016\/j.jcss.2026.103802_br0170","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","article-title":"Tree-depth, subgraph coloring and homomorphism bounds","volume":"27","author":"Ne\u0161et\u0159il","year":"2006","journal-title":"Eur. J. Comb."},{"issue":"6","key":"10.1016\/j.jcss.2026.103802_br0180","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Algorithm 447: efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jcss.2026.103802_br0190","series-title":"Algorithms, haplotypes and phylogenetic networks","author":"van Iersel","year":"2009"},{"issue":"4","key":"10.1016\/j.jcss.2026.103802_br0200","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TCBB.2009.22","article-title":"Constructing level-2 phylogenetic networks from triplets","volume":"6","author":"van Iersel","year":"2009","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"3","key":"10.1016\/j.jcss.2026.103802_br0210","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0216034","article-title":"Expected computation time for hamiltonian path problem","volume":"16","author":"Gurevich","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jcss.2026.103802_br0220","doi-asserted-by":"crossref","DOI":"10.1145\/2390176.2390188","article-title":"On exact algorithms for treewidth","volume":"9","author":"Bodlaender","year":"2012","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.jcss.2026.103802_br0230","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.jcss.2026.103802_br0240","series-title":"International Colloquium on Automata, Languages, and Programming (ICALP 1991)","first-page":"751","article-title":"Ordering problems approximated: single-processor scheduling and interval graph completion","author":"Ravi","year":"1991"},{"key":"10.1016\/j.jcss.2026.103802_br0250","series-title":"45th Annual ACM Symposium on Theory of Computing (STOC 2013)","first-page":"765","article-title":"Max flows in O(nm) time, or better","author":"Orlin","year":"2013"},{"key":"10.1016\/j.jcss.2026.103802_br0260","series-title":"23rd International Workshop on Algorithms in Bioinformatics (WABI 2023)","first-page":"7:1","article-title":"Making a network orchard by adding leaves","author":"van Iersel","year":"2023"},{"key":"10.1016\/j.jcss.2026.103802_br0270","author":"Agarwal"},{"issue":"2","key":"10.1016\/j.jcss.2026.103802_br0280","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1093\/molbev\/msx307","article-title":"Bayesian inference of species networks from multilocus sequence data","volume":"35","author":"Zhang","year":"2017","journal-title":"Mol. Biol. Evol."},{"issue":"06","key":"10.1016\/j.jcss.2026.103802_br0290","doi-asserted-by":"crossref","DOI":"10.1142\/S0219720021400126","article-title":"Comparing the topology of phylogenetic network generators","volume":"19","author":"Janssen","year":"2021","journal-title":"J. Bioinform. Comput. Biol."},{"key":"10.1016\/j.jcss.2026.103802_br0300","author":"Tamaki"},{"key":"10.1016\/j.jcss.2026.103802_br0310","author":"Tamaki"},{"issue":"6","key":"10.1016\/j.jcss.2026.103802_br0320","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":"8","key":"10.1016\/j.jcss.2026.103802_br0330","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","article-title":"Computing the minimum number of hybridization events for a consistent evolutionary history","volume":"155","author":"Bordewich","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103802_br0340","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1613\/jair.4030","article-title":"Inapproximability of treewidth and related problems","volume":"49","author":"Wu","year":"2014","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.jcss.2026.103802_br0350","series-title":"IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021)","first-page":"184","article-title":"A single-exponential time 2-approximation algorithm for treewidth","author":"Korhonen","year":"2022"},{"issue":"6","key":"10.1016\/j.jcss.2026.103802_br0360","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00285-022-01746-y","article-title":"Classes of explicit phylogenetic networks and their biological and mathematical significance","volume":"84","author":"Kong","year":"2022","journal-title":"J. Math. Biol."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:01:53Z","timestamp":1780491713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":36,"alternative-id":["S0022000026000486"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103802","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exact and heuristic computation of the scanwidth of directed acyclic graphs","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.103802","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"103802"}}