{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T01:40:02Z","timestamp":1748914802392,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T00:00:00Z","timestamp":1462492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T00:00:00Z","timestamp":1462492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0820138"],"award-info":[{"award-number":["CCF-0820138"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1135722"],"award-info":[{"award-number":["CNS-1135722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10878-016-0024-x","type":"journal-article","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T18:25:36Z","timestamp":1462559136000},"page":"1057-1089","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient reassembling of graphs, part 1: the linear case"],"prefix":"10.1007","volume":"33","author":[{"given":"Assaf","family":"Kfoury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saber","family":"Mirzaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,6]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Arora S, Frieze A, Kaplan H (1996) A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: IEEE Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp 21\u201330","DOI":"10.1109\/SFCS.1996.548460"},{"issue":"(part A)","key":"24_CR2","first-page":"19","volume":"93","author":"K Assaf","year":"2014","unstructured":"Assaf K (2014) The syntax and semantics of a domain-specific language for flow-network design. Sci Comput Progr 93((part A)):19\u201338","journal-title":"Sci Comput Progr"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bestavros A, Kfoury A (2011) A domain-specific language for incremental and modular design of large-scale verifiably-safe flow networks. In: Proceeding of IFIP Working Conference on Domain-Specific Languages (DSL 2011), EPTCS volume 66, pp 24\u201347","DOI":"10.4204\/EPTCS.66.2"},{"key":"24_CR4","unstructured":"Bronner D, Ries B (2006) An introduction to treewidth. Technical Report ROSE-REPORT-2006-004, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne"},{"issue":"1\u20133","key":"24_CR5","first-page":"209","volume":"58","author":"M Burkhard","year":"1988","unstructured":"Burkhard M, Ivan Hal S (1988) Min cut is NP-complete for edge weighted trees. Theor Comput Sci 58(1\u20133):209\u2013229","journal-title":"Theor Comput Sci"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Charikar M, Hajiaghayi MT, Karloff H, Rao S (2006) $${\\ell }^2_2$$ Spreading metrics for vertex ordering problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1018\u20131027. Society for Industrial and Applied Mathematics","DOI":"10.1145\/1109557.1109670"},{"key":"24_CR7","volume-title":"Graph theory","author":"R Deistel","year":"2012","unstructured":"Deistel R (2012) Graph theory. Springer, Berlin"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"R Garey Michael","year":"1976","unstructured":"Garey Michael R, Johnson David S, Larry Stockmeyer (1976) Some simplied NP-complete graph problems. Theor Comput Sci 1:237\u2013267","journal-title":"Theor Comput Sci"},{"key":"24_CR9","first-page":"177","volume":"105","author":"P Jordi","year":"2011","unstructured":"Jordi P (2011) Addenda to the survey of layout problems. Bull EATCS 105:177\u2013201","journal-title":"Bull EATCS"},{"key":"24_CR10","unstructured":"Kfoury A (2011) The denotational, operational, and static semantics of a domain-specific language for the design of flow networks. In: Proceedings of SBLP 2011: Brazilian Symposium on Programming Languages"},{"key":"24_CR11","unstructured":"Kfoury A, Mirzaei S (2013) A different approach to the design and analysis of network algorithms. Technical Report BUCS-TR-2012-019, CS Dept, Boston University"},{"key":"24_CR12","unstructured":"Kfoury A, Mirzaei S (2015) Efficient reassembling of graphs, part 1: the linear case. arXiv:1509.06434"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"S Makedon Fillia","year":"1985","unstructured":"Makedon Fillia S, Papadimitriou Christos H, Hal SI (1985) Topological bandwidth. SIAM J Algebraic Discret Methods 6(3):418\u2013444","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"24_CR14","unstructured":"Odlyzko AM (1995) Asymptotic enumeration methods. In: Graham RL, Grotschel M, Lovast L (eds) Handbook of combinatorics, vol 2, pp 1063\u20131229. Cambridge, MA, MIT Press"},{"key":"24_CR15","unstructured":"Rao S, Richa AW (1998) New approximation techniques for some ordering problems. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete algorithms, pp 211\u2013218. Philadelphia, PA, Society for Industrial and Applied Mathematics"},{"key":"24_CR16","unstructured":"Soule N, Bestavros A, Kfoury A, Lapets A (2011) Safe compositional equation-based modeling of constrained flow networks. In: Proceedings of 4th Int\u2019l Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, Z\u00fcrich"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Thilikos DM, Serna MJ, Bodlaender HL (2001) A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In: Meyer F, Auf\u00a0der H (eds), Algorithms, ESA 2001. LNCS 2161, pp 380\u2013390. Springer, Berlin","DOI":"10.1007\/3-540-44676-1_32"},{"issue":"6","key":"24_CR18","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"L Tom","year":"1999","unstructured":"Tom L, Satish R (1999) Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J ACM (JACM) 46(6):787\u2013832","journal-title":"J ACM (JACM)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0024-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0024-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0024-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0024-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T01:23:57Z","timestamp":1748913837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0024-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0024-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,5,6]]},"assertion":[{"value":"6 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}