{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:28:00Z","timestamp":1743049680496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_18","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"248-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0$$(P_k, P_\\ell )$$-Arrowing"],"prefix":"10.1007","author":[{"given":"Zohair Raza","family":"Hassan","sequence":"first","affiliation":[]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[]},{"given":"Stanis\u0142aw","family":"Radziszowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","volume":"165\u2013166","author":"D Achlioptas","year":"1997","unstructured":"Achlioptas, D.: The complexity of $$G$$-free colorability. Discrete Math. 165\u2013166, 21\u201330 (1997)","journal-title":"Discrete Math."},{"key":"18_CR2","unstructured":"Antunes Filho, I.T.F.: Characterizing Boolean Satisfiability Variants. Ph.D. thesis, Massachusetts Institute of Technology (2019)"},{"key":"18_CR3","unstructured":"Berman, P., Karpinski, M., Scott, A.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT. ECCC (2003)"},{"key":"18_CR4","unstructured":"Bikov, A.: Computation and Bounding of Folkman Numbers. Ph.D. thesis, Sofia University \"St. Kliment Ohridski\" (2018)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-72905-8_5","volume":"5","author":"SA Burr","year":"1990","unstructured":"Burr, S.A.: On the computational complexity of Ramsey-type problems. Math. Ramsey Theory, Algorithms Comb. 5, 46\u201352 (1990)","journal-title":"Math. Ramsey Theory, Algorithms Comb."},{"issue":"1","key":"18_CR6","first-page":"167","volume":"1","author":"SA Burr","year":"1976","unstructured":"Burr, S.A., Erd\u0151s, P., Lov\u00e1sz, L.: On graphs of Ramsey type. Ars Combin. 1(1), 167\u2013190 (1976)","journal-title":"Ars Combin."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(85)90057-3","volume":"54","author":"SA Burr","year":"1985","unstructured":"Burr, S.A., Ne\u0161et\u0159il, J., R\u00f6dl, V.: On the use of senders in generalized Ramsey theory for graphs. Discrete Math. 54(1), 1\u201313 (1985)","journal-title":"Discrete Math."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR9","unstructured":"Gerencs\u00e9r, L., Gy\u00e1rf\u00e1s, A.: On Ramsey-type problems. Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math 10, 167\u2013170 (1967)"},{"key":"18_CR10","unstructured":"Hassan, Z., Hemaspaandra, E., Radziszowski, S.: The complexity of $$(P_k, P_\\ell )$$-arrowing. CoRR abs\/2307.10510 (2023). https:\/\/arxiv.org\/abs\/2307.10510"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hell, P., Nes\u0306etr\u0306il, J.: On the complexity of $$H$$-coloring. J. Comb. Theory, Ser. B 48, 92\u2013110 (1990)","DOI":"10.1016\/0095-8956(90)90132-J"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"689","DOI":"10.7151\/dmgt.1827","volume":"35","author":"J Hook","year":"2015","unstructured":"Hook, J.: Critical graphs for $$R(P_{n},\\, P_{m}$$) and the star-critical Ramsey number for paths. Discuss. Math. Graph Theory 35(4), 689\u2013701 (2015)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1\u20132","key":"18_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/malq.19670130104","volume":"13","author":"MR Krom","year":"1967","unstructured":"Krom, M.R.: The decision problem for a class of first-order formulas in which all disjunctions are binary. Math. Logic Q. 13(1\u20132), 15\u201320 (1967)","journal-title":"Math. Logic Q."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Le, H.O., Le, V.B.: Complexity of the cluster vertex deletion problem on H-free graphs. In: MFCS 2022, vol. 241, pp. 68:1\u201368:10 (2022)","DOI":"10.1684\/dm.2022.476"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: IEEE SWAT, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"18_CR16","unstructured":"Radziszowski, S.: Small Ramsey Numbers. Electron. J. Comb. DS1, 1\u2013116 (2021). https:\/\/www.combinatorics.org\/"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Rosta, V.: Ramsey theory applications. Electron. J. Comb. DS13, 1\u201343 (2004). https:\/\/www.combinatorics.org\/","DOI":"10.37236\/34"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/BFb0016284","volume-title":"Mathematical Foundations of Computer Science 1986","author":"V Rutenburg","year":"1986","unstructured":"Rutenburg, V.: Complexity of generalized graph coloring. In: Gruska, J., Rovan, B., Wiedermann, J. (eds.) MFCS 1986. LNCS, vol. 233, pp. 573\u2013581. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/BFb0016284"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1006\/jcss.2000.1729","volume":"62","author":"M Schaefer","year":"2001","unstructured":"Schaefer, M.: Graph Ramsey theory and the polynomial hierarchy. J. Comput. Syst. Sci. 62, 290\u2013322 (2001)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:37:12Z","timestamp":1699911432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","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":"30","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":"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)"}}]}}