{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:13Z","timestamp":1725643573404},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_62","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T20:12:30Z","timestamp":1323979950000},"page":"383-388","source":"Crossref","is-referenced-by-count":0,"title":["From Edge Decomposition Formulae to Composition Algorithms"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"P\u00f6nitz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","volume-title":"A polynomial-time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth","author":"Artur Andrzejak","year":"1995","unstructured":"Artur Andrzejak (1995) A polynomial-time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth.\n                  http:\/\/citeseer.nj.nec.com\/andrzejak95polynomialtime.html"},{"key":"62_CR2","unstructured":"[Bod97] Hans Bodlaender (1995) Treewidth: Algorithmic techniques and results. Proceedings 22nd Intern. Symposium on Math. Foundations of Computer Science, MFCS\u201997, Lecture Notes in Computer Science, volume 12\/95"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1090\/S0002-9947-1987-0869224-1","volume":"299","author":"Seiya Negami","year":"1987","unstructured":"Seiya Negami (1987) Polynomial invariants of graphs. Transactions of the American Mathematical Society, 299: 601-622","journal-title":"Transactions of the American Mathematical Society"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0378-4754(99)00052-X","volume":"49","author":"Andr\u00e8 P\u00f6nitz","year":"1999","unstructured":"Andre Ponitz (1999) Computing invariants in graphs of small bandwidth. Mathematics in Computers and Simulation, 49: 179-191","journal-title":"Mathematics in Computers and Simulation"}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T03:16:20Z","timestamp":1555902980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_62","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}