{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:51:30Z","timestamp":1743141090112,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030608835"},{"type":"electronic","value":"9783030608842"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60884-2_33","type":"book-chapter","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:04:50Z","timestamp":1602025490000},"page":"437-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas"],"prefix":"10.1007","author":[{"given":"Marco A.","family":"L\u00f3pez-Medina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"De Ita-Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Winkler, P., Brifhtwell, G.: Counting linear extensions. Order, 8(e), 225\u2013242 (1991)","key":"33_CR1","DOI":"10.1007\/BF00383444"},{"unstructured":"L\u00f3pez-Medina, M.A., Marcial-Romero, J.R., De Ita Luna, G., Montes-Venegas, H.A., Alejo, R.: A linear time algorithm for solving #2SAT on cactus formulas. CoRR, ams\/1702.08581 (2017)","key":"33_CR2"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-92198-3_8","volume-title":"Pattern Recognition","author":"MA L\u00f3pez","year":"2018","unstructured":"L\u00f3pez, M.A., Marcial-Romero, J.R., De Ita, G., Moyao, Y.: A linear time algorithm for computing #2SAT for outerplanar 2-CNF formulas. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-L\u00f3pez, J.A., Sarkar, S. (eds.) MCPR 2018. LNCS, vol. 10880, pp. 72\u201381. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-92198-3_8"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-79723-4_19","volume-title":"Parameterized and Exact Computation","author":"M Wahlstr\u00f6m","year":"2008","unstructured":"Wahlstr\u00f6m, M.: A tighter bound for counting max-weight solutions to 2SAT instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202\u2013213. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79723-4_19"},{"unstructured":"Schoenmakers, L.A.M.: A new algorithm for the recognition of series parallel graphs. CWI (Centre for Mathematics and Computer Science) (1995)","key":"33_CR5"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98, 41\u201355 (1992)","journal-title":"Inf. Comput."},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29(3), 623\u2013641 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/b16132","volume-title":"Handbook of Graph Theory","author":"JL Gross","year":"2013","unstructured":"Gross, J.L., Yellen, J., Zhang, P.: Handbook of Graph Theory. Chapman & Hall\/CRC, New York (2013)"},{"key":"33_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32278-5","volume-title":"Graphs, Networks and Algorithms.","author":"J Dieter","year":"2013","unstructured":"Dieter, J.: Graphs, Networks and Algorithms., 4th edn. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32278-5","edition":"4"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.06.010","volume":"60","author":"A Jakoby","year":"2006","unstructured":"Jakoby, A., Li\u015bkiewicz, M., Reischuk, R.: Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2), 85\u2013114 (2006)","journal-title":"J. Algorithms"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188\u2013202. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24605-3_15"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-27060-9_16","volume-title":"Advances in Artificial Intelligence and Soft Computing","author":"JR Marcial-Romero","year":"2015","unstructured":"Marcial-Romero, J.R., De Ita Luna, G., Hern\u00e1ndez, J.A., Valdovinos, R.M.: A parametric polynomial deterministic algorithm for #2SAT. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 202\u2013213. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27060-9_16"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60884-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:23:27Z","timestamp":1602026607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60884-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030608835","9783030608842"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60884-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"186","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}