{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:40:06Z","timestamp":1751258406787,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_19","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"216-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models"],"prefix":"10.1007","author":[{"given":"Shinya","family":"Shiroshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoaki","family":"Ogasawara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidefumi","family":"Hiraishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"1\u20133","key":"19_CR1","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. Discret. Math. 190(1\u20133), 39\u201354 (1998)","journal-title":"Discret. Math."},{"key":"19_CR2","unstructured":"Balaji, N., Datta, S., Ganesan, V.: Counting Euler tours in undirected bounded treewidth graphs. In: Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, pp. 246\u2013260 (2015)"},{"key":"19_CR3","unstructured":"Brightwell, G.R., Winkler, P.: Counting Eulerian circuits is #P-complete. In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, pp. 259\u2013262 (2005)"},{"key":"19_CR4","unstructured":"Cai, J.-Y., Fu, Z., Shao, S.: A complexity trichotomy for the six-vertex model. arXiv:1704.01657 [cs.CC] (2017)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Fu, Z., Xia, M.: Complexity classification of the six-vertex model. arXiv:1702.02863 [cs.CC] (2017)","DOI":"10.1016\/j.ic.2018.01.003"},{"key":"19_CR6","unstructured":"Chebolu, P., Cryan, M., Martin, R.: Exact counting of Euler tours for graphs of bounded treewidth. arXiv:1310.0185 [cs.DM] (2013)"},{"key":"19_CR7","unstructured":"Creed, P.J.: Counting and sampling problems on Eulerian graphs. Ph.D. thesis, The University of Edinburgh (2010)"},{"key":"19_CR8","first-page":"128","volume":"8","author":"L Euler","year":"1741","unstructured":"Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientiarum Petropolitanae 8, 128\u2013140 (1741)","journal-title":"Commentarii Academiae Scientiarum Petropolitanae"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00453-010-9463-4","volume":"63","author":"Q Ge","year":"2012","unstructured":"Ge, Q., Stefankovic, D.: The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica 63(3), 588\u2013601 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00037-015-0118-3","volume":"25","author":"S Huang","year":"2016","unstructured":"Huang, S., Pinyan, L.: A dichotomy for real weighted Holant problems. Comput. Complex. 25(1), 255\u2013304 (2016)","journal-title":"Comput. Complex."},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1103\/PhysRev.162.162","volume":"162","author":"EH Lieb","year":"1967","unstructured":"Lieb, E.H.: Residual entropy of square ice. Phys. Rev. 162(1), 162\u2013172 (1967)","journal-title":"Phys. Rev."},{"key":"19_CR13","unstructured":"Mihail, M., Winkler, P.: On the number of Eularian orientations of a graph. In: Proceedings of the Third Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, pp. 138\u2013145 (1992)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1090\/S0002-9904-1963-11031-9","volume":"69","author":"H Minc","year":"1963","unstructured":"Minc, H.: Upper bounds for permanents of (0,1)-matrices. Bull. Am. Math. Soc. 69, 789\u2013791 (1963)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1017\/S0963548398003551","volume":"7","author":"SD Noble","year":"1998","unstructured":"Noble, S.D.: Evaluating the tutte polynomial for graphs of bounded tree-width. Comb. Probab. Comput. 7(3), 307\u2013321 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"12","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1021\/ja01315a102","volume":"57","author":"L Pauling","year":"1935","unstructured":"Pauling, L.: The structure and entropy of ice and of other crystals with some randomness of atomic arrangement. J. Am. Chem. Soc. 57(12), 2680\u20132684 (1935)","journal-title":"J. Am. Chem. Soc."},{"key":"19_CR17","unstructured":"Sas\u00e1k, R.: Comparing 17 graph parameters. Master\u2019s thesis, The University of Bergen (2010). http:\/\/bora.uib.no\/handle\/1956\/4329"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF02579193","volume":"3","author":"A Schrijver","year":"1983","unstructured":"Schrijver, A.: Bounds on the number of Eulerian orientations. Combinatorica 3(3), 375\u2013380 (1983)","journal-title":"Combinatorica"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Proceedings of the 6th International Symposium on Algorithms and Computation, pp. 224\u2013233 (1995)","DOI":"10.1007\/BFb0015427"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"PD Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the Ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-40996-3_17","volume-title":"Algorithms and Computation","author":"DM Thilikos","year":"2000","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Constructive linear time algorithms for small cutwidth and carving-width. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 192\u2013203. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_17"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Holographic algorithms (Extended Abstract). In: Proceedings of the 45th Symposium on Foundations of Computer Science, pp. 306\u2013315 (2004)","DOI":"10.1109\/FOCS.2004.34"},{"key":"19_CR23","first-page":"117","volume":"35","author":"BL van der Waerden","year":"1926","unstructured":"van der Waerden, B.L.: Aufgabe 45. Jber. Deutsch. Math.-Verein. 35, 117 (1926)","journal-title":"Jber. Deutsch. Math.-Verein."},{"key":"19_CR24","unstructured":"Welsh, D.J.A.: The computational complexity of some classical problems from statistical physics. In: Disorder in Physical Systems, vol. 307, pp. 307\u2013321. Oxford University Press (1990). http:\/\/www.statslab.cam.ac.uk\/~grg\/books\/jmh.html"},{"key":"19_CR25","volume-title":"Complexity: Knots, Colourings and Counting","author":"DJA Welsh","year":"1995","unstructured":"Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. Cambridge University Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:23:02Z","timestamp":1751257382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}