{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:54:21Z","timestamp":1776437661315,"version":"3.51.2"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T00:00:00Z","timestamp":1772150400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.02.042","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:14:56Z","timestamp":1773256496000},"page":"160-171","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Simultaneous separation in bounded degree trees"],"prefix":"10.1016","volume":"387","author":[{"given":"Sagi","family":"Snir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7550-6506","authenticated-orcid":false,"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.042_b1","series-title":"27th Annual Symposium on Foundations of Computer Science","first-page":"410","article-title":"Meanders, Ramsey theory and lower bounds for branching programs","author":"Alon","year":"1986"},{"issue":"2","key":"10.1016\/j.dam.2026.02.042_b2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/15M1041754","article-title":"On the maximum quartet distance between phylogenetic trees","volume":"30","author":"Alon","year":"2016","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.02.042_b3","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/130941043","article-title":"On the compatibility of quartet trees","volume":"28","author":"Alon","year":"2014","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/j.dam.2026.02.042_b4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1093\/sysbio\/syu087","article-title":"Weighted quartets phylogenetics","volume":"64","author":"Avni","year":"2015","journal-title":"Syst. Biol."},{"issue":"3","key":"10.1016\/j.dam.2026.02.042_b5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","article-title":"Reconstructing the shape of a tree from observed dissimilarity data","volume":"7","author":"Bandelt","year":"1986","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.dam.2026.02.042_b6","series-title":"Mathematics in the Archaeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"key":"10.1016\/j.dam.2026.02.042_b7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01908078","article-title":"Obtaining common pruned trees","volume":"2","author":"Finden","year":"1985","journal-title":"J. Classification"},{"key":"10.1016\/j.dam.2026.02.042_b8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/j.dam.2026.02.042_b9","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."},{"key":"10.1016\/j.dam.2026.02.042_b10","first-page":"185","article-title":"Sur les assemblages de lignes","author":"Jordan","year":"1869","journal-title":"J. Die Reine Angew. Math."},{"key":"10.1016\/j.dam.2026.02.042_b11","first-page":"217","article-title":"On agreement subtrees of two binary trees","volume":"88","author":"Kubicka","year":"1992","journal-title":"Congr. Numer."},{"issue":"2","key":"10.1016\/j.dam.2026.02.042_b12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2026.02.042_b13","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.dam.2020.07.007","article-title":"On the extremal maximum agreement subtree problem","volume":"285","author":"Markin","year":"2020","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.02.042_b14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/j.dam.2026.02.042_b15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","article-title":"Comparison of phylogenetic trees","volume":"53","author":"Robinson","year":"1981","journal-title":"Math. Biosci."},{"key":"10.1016\/j.dam.2026.02.042_b16","series-title":"Phylogenetics","author":"Semple","year":"2003"},{"issue":"6","key":"10.1016\/j.dam.2026.02.042_b17","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1137\/11086964X","article-title":"Reconstructing approximate phylogenetic trees from quartet samples","volume":"41","author":"Snir","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2026.02.042_b18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02618470","article-title":"The complexity of reconstructing trees from qualitative characters and subtrees","volume":"9","author":"Steel","year":"1992","journal-title":"J. Classification"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:07:56Z","timestamp":1776434876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":18,"alternative-id":["S0166218X26001228"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.042","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Simultaneous separation in bounded degree trees","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.042","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 B.V.","name":"copyright","label":"Copyright"}]}}