{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:38Z","timestamp":1725537458586},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_56","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:16:36Z","timestamp":1252952196000},"page":"623-634","source":"Crossref","is-referenced-by-count":1,"title":["Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"56_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0166-218X(00)00190-6","volume":"104","author":"R. Arratia","year":"2000","unstructured":"Arratia, R., Bollob\u00e1s, B., Coppersmith, D., Sorkin, G.B.: Euler circuits and DNA sequencing by hybridization. Discrete Appl. Math.\u00a0104(1-3), 63\u201396 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"56_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.jctb.2004.03.003","volume":"92","author":"R. Arratia","year":"2004","unstructured":"Arratia, R., Bollob\u00e1s, B., Sorkin, G.B.: The interlace polynomial of a graph. J. Comb. Theory Ser. B\u00a092(2), 199\u2013233 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"56_CR3","unstructured":"Martin, P.: Enum\u00e9rations Eul\u00e9riennes dans le multigraphes et invariants de Tutte\u2013Grothendieck. PhD thesis, Grenoble, France (1977)"},{"key":"56_CR4","first-page":"397","volume":"17","author":"M. Las Vergnas","year":"1983","unstructured":"Las Vergnas, M.: Le polyn\u00f4me de martin d\u2019un graphe eulerian. Ann. Discrete Math.\u00a017, 397\u2013411 (1983)","journal-title":"Ann. Discrete Math."},{"key":"56_CR5","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"451","volume-title":"Algebraic Methods in Graph Theory","author":"M. Las Vergnas","year":"1981","unstructured":"Las Vergnas, M.: Eulerian circuits of 4-valent graphs imbedded in surfaces. In: Algebraic Methods in Graph Theory, Szeged, Hungary, 1978. Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a025, pp. 451\u2013477. North-Holland, Amsterdam (1981)"},{"issue":"3","key":"56_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0095-8956(88)90079-2","volume":"45","author":"M. Las Vergnas","year":"1988","unstructured":"Las Vergnas, M.: On the evaluation at (3,3) of the Tutte polynomial of a graph. J. Comb. Theory Ser. B\u00a045(3), 367\u2013372 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"56_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0095-8956(88)90083-4","volume":"44","author":"F. Jaeger","year":"1988","unstructured":"Jaeger, F.: On Tutte polynomials and cycles of plane graphs. J. Comb. Theory Ser. B\u00a044(2), 127\u2013146 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"56_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1006\/jctb.1998.1853","volume":"74","author":"J.A. Ellis-Monaghan","year":"1998","unstructured":"Ellis-Monaghan, J.A.: New results for the Martin polynomial. J. Comb. Theory Ser. B\u00a074(2), 326\u2013352 (1998)","journal-title":"J. Comb. Theory Ser. B"},{"key":"56_CR9","unstructured":"Ellis-Monaghan, J.A.: Martin polynomial miscellanea. In: Proceedings of the 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, pp. 19\u201331 (1999)"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jctb.2001.2102","volume":"85","author":"B. Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B.: Evaluations of the circuit partition polynomial. J. Comb. Theory Ser. B\u00a085(2), 261\u2013268 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"56_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0195-6698(87)80027-6","volume":"8","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Isotropic systems. Eur. J. Comb.\u00a08(3), 231\u2013244 (1987)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"56_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0095-8956(88)90055-X","volume":"45","author":"A. Bouchet","year":"1988","unstructured":"Bouchet, A.: Graphic presentations of isotropic systems. J. Comb. Theory Ser. B\u00a045(1), 58\u201376 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01787630","volume":"7","author":"A. Bouchet","year":"1991","unstructured":"Bouchet, A.: Tutte Martin polynomials and orienting vectors of isotropic systems. Graphs Combin.\u00a07, 235\u2013252 (1991)","journal-title":"Graphs Combin."},{"key":"56_CR14","unstructured":"B\u00e9nard, D., Bouchet, A., Duchamp, A.: On the Martin and Tutte polynomials. Technical report, D\u00e9partement d\u2019Infornmatique, Universit\u00e9 du Maine, Le Mans, France (1997)"},{"issue":"6","key":"56_CR15","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1017\/S0963548307008723","volume":"16","author":"J.A. Ellis-Monaghan","year":"2007","unstructured":"Ellis-Monaghan, J.A., Sarmiento, I.: Distance hereditary graphs and the interlace polynomial. Comb. Probab. Comput.\u00a016(6), 947\u2013973 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.laa.2003.06.010","volume":"377","author":"M. Aigner","year":"2004","unstructured":"Aigner, M., van der Holst, H.: Interlace polynomials. Linear Algebra and its Applications\u00a0377, 11\u201330 (2004)","journal-title":"Linear Algebra and its Applications"},{"key":"56_CR17","unstructured":"Danielsen, L.E., Parker, M.G.: Interlace polynomials: Enumeration, unimodality, and connections to codes (2008) preprint, arXiv:0804.2576v1"},{"issue":"1-3","key":"56_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2004.07.028","volume":"302","author":"A. Bouchet","year":"2005","unstructured":"Bouchet, A.: Graph polynomials derived from Tutte\u2013Martin polynomials. Discrete Mathematics\u00a0302(1-3), 32\u201338 (2005)","journal-title":"Discrete Mathematics"},{"key":"56_CR19","unstructured":"Ellis-Monaghan, J.A., Sarmiento, I.: Isotropic systems and the interlace polynomial (2006) preprint, arXiv:math\/0606641v2"},{"key":"56_CR20","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: A multivariate interlace polynomial and its computation for graphs of bounded clique-width. The Electronic Journal of Combinatorics\u00a015(1) (2008)","DOI":"10.37236\/793"},{"issue":"4","key":"56_CR21","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00493-004-0035-6","volume":"24","author":"R. Arratia","year":"2004","unstructured":"Arratia, R., Bollob\u00e1s, B., Sorkin, G.B.: A two-variable interlace polynomial. Combinatorica\u00a024(4), 567\u2013584 (2004)","journal-title":"Combinatorica"},{"key":"56_CR22","doi-asserted-by":"crossref","unstructured":"Traldi, L.: Weighted interlace polynomials (2008) preprint, arXiv:0808.1888v1","DOI":"10.1017\/S0963548309990381"},{"key":"56_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11779360_31","volume-title":"Coding and Cryptography","author":"C. Riera","year":"2006","unstructured":"Riera, C., Parker, M.G.: One and two-variable interlace polynomials: A spectral interpretation. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 397\u2013411. Springer, Heidelberg (2006)"},{"key":"56_CR24","unstructured":"Bl\u00e4ser, M., Hoffmann, C.: On the complexity of the interlace polynomial. In: Albers, S., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Dagstuhl, Germany, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany, pp. 97\u2013108 (2008)"},{"issue":"1","key":"56_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., il Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by seese. J. Comb. Theory, Ser. B\u00a097(1), 91\u2013126 (2007)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1-3","key":"56_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"56_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics\u00a0108(1-2), 23\u201352 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"56_CR28","unstructured":"Bl\u00e4ser, M., Hoffmann, C.: Fast computation of interlace polynomials on graphs of bounded treewidth (2009) preprint, arXiv:0902.1693"},{"issue":"1-3","key":"56_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0012-365X(98)00113-7","volume":"190","author":"A. Andrzejak","year":"1998","unstructured":"Andrzejak, A.: An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Mathematics\u00a0190(1-3), 39\u201354 (1998)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"56_CR30","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1017\/S0963548398003551","volume":"7","author":"S.D. Noble","year":"1998","unstructured":"Noble, S.D.: Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, Probability & Computing\u00a07(3), 307\u2013321 (1998)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"3","key":"56_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J.\u00a051(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"6","key":"56_CR32","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth. Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. Computations and Approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T05:14:37Z","timestamp":1590124477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}