{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:42:08Z","timestamp":1759992128475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"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-58150-3_40","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"496-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity"],"prefix":"10.1007","author":[{"given":"Mateus Rodrigues","family":"Alves","sequence":"first","affiliation":[]},{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"additional","affiliation":[]},{"given":"Janio Carlos Nascimento","family":"Silva","sequence":"additional","affiliation":[]},{"given":"U\u00e9verton","family":"dos Santos Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"40_CR1","unstructured":"Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pp. 24\u201331 (1999)"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00224-007-1346-y","volume":"41","author":"L Cai","year":"2007","unstructured":"Cai, L., Fellows, M., Juedes, D., Rosamond, F.: The complexity of polynomial-time approximation. Theory Comput. Syst. 41(3), 459\u2013477 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"40_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.3233\/FI-2015-1159","volume":"136","author":"N Creignou","year":"2015","unstructured":"Creignou, N., Vollmer, H.: Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting. Fundam. Inform. 136(4), 297\u2013316 (2015)","journal-title":"Fundam. Inform."},{"key":"40_CR4","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15","DOI":"10.1007\/978-3-319-21275-3_15"},{"key":"40_CR5","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (2012)"},{"issue":"1","key":"40_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"40_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.jctb.2011.02.008","volume":"101","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction obstructions for treewidth. J. Comb. Theor. Ser. B 101(5), 302\u2013314 (2011)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"40_CR8","unstructured":"Gross, J.L., Tucker, T.W.: Topological Graph Theory. Courier Corporation (2001)"},{"issue":"3","key":"40_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-012-9627-5","volume":"64","author":"QP Gu","year":"2012","unstructured":"Gu, Q.P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64(3), 416\u2013453 (2012)","journal-title":"Algorithmica"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ic.2017.11.002","volume":"257","author":"I Kanj","year":"2017","unstructured":"Kanj, I., Thilikos, D.M., Xia, G.: On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257, 139\u2013156 (2017)","journal-title":"Inf. Comput."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Khanna, S., Motwani, R.: Towards a syntactic characterization of PTAS. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 329\u2013337 (1996)","DOI":"10.1145\/237814.237979"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00037-009-0265-5","volume":"18","author":"N Limaye","year":"2009","unstructured":"Limaye, N., Mahajan, M., Sarma, J.M.: Upper bounds for monotone planar circuit value and variants. Comput. Complex. 18(3), 377 (2009)","journal-title":"Comput. Complex."},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jcss.2012.09.001","volume":"79","author":"D Marx","year":"2013","unstructured":"Marx, D.: Completely inapproximable monotone and antimonotone parameterized problems. J. Comput. Syst. Sci. 79(1), 144\u2013151 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"40_CR14","series-title":"McGraw-Hill Computer Science Series","volume-title":"Problem-solving methods in artificial intelligence","author":"NJ Nilsson","year":"1971","unstructured":"Nilsson, N.J.: Problem-solving methods in artificial intelligence. McGraw-Hill Computer Science Series. McGraw-Hill, New York (1971)"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theor. Ser. B 62(2), 323\u2013348 (1994)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"40_CR16","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. J. Comb. Theor. Seri. B 36(1), 49\u201364 (1984)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Savage, J.E.: Planar circuit complexity and the performance of VLSI algorithms+. In: VLSI Systems and Computations, pp. 61\u201368. Springer, Heidelberg (1981)","DOI":"10.1007\/978-3-642-68402-9_8"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.dam.2017.07.029","volume":"232","author":"US Souza","year":"2017","unstructured":"Souza, U.S., Protti, F.: Tractability, hardness, and kernelization lower bound for and\/or graph solution. Discrete Appl. Math. 232, 125\u2013133 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"40_CR19","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1016\/j.jcss.2013.04.001","volume":"79","author":"US Souza","year":"2013","unstructured":"Souza, U.S., Protti, F., da Silva, M.D.: Revisiting the complexity of and\/or graph solution. J. Comput. Syst. Sci. 79(7), 1156\u20131163 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"40_CR20","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). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_15"},{"issue":"1","key":"40_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BF01277954","volume":"5","author":"G Tur\u00e1n","year":"1995","unstructured":"Tur\u00e1n, G.: On the complexity of planar boolean circuits. Comput. Complex. 5(1), 24\u201342 (1995)","journal-title":"Comput. Complex."},{"issue":"12","key":"40_CR22","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1162\/neco.2006.18.12.2994","volume":"18","author":"K Uchizawa","year":"2006","unstructured":"Uchizawa, K., Douglas, R., Maass, W.: On the computational power of threshold circuits with sparse activity. Neural Comput. 18(12), 2994\u20133008 (2006)","journal-title":"Neural Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:41:49Z","timestamp":1619242909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_40","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":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}