{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:21:07Z","timestamp":1743124867724,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_26","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"356-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Contracting Bipartite Graphs into\u00a0Small Cycles"],"prefix":"10.1007","author":[{"given":"R.","family":"Krithika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roohani","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0218195909002940","volume":"19","author":"M Andersson","year":"2009","unstructured":"Andersson, M., Gudmundsson, J., Levcopoulos, C.: Restricted mesh simplification using edge contractions. Int. J. Comput. Geom. Appl. 19(3), 247\u2013265 (2009). https:\/\/doi.org\/10.1142\/S0218195909002940","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00453-013-9748-5","volume":"69","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Golovach, P.A., Heggernes, P., van\u00a0\u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3), 501\u2013521 (2013). https:\/\/doi.org\/10.1007\/s00453-013-9748-5","journal-title":"Algorithmica"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/18M1169382","volume":"33","author":"A Bernstein","year":"2019","unstructured":"Bernstein, A., D\u00e4ubel, K., Disser, Y., Klimm, M., M\u00fctze, T., Smolny, F.: Distance-preserving graph contractions. SIAM J. Discrete Math. 33(3), 1607\u20131636 (2019). https:\/\/doi.org\/10.1137\/18M1169382","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR4","unstructured":"Blum, D.J.: Circularity of graphs. Ph.D. thesis, Virginia Polytechnic Institute and State University (1982)"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jgt.3190110111","volume":"11","author":"AE Brouwer","year":"1987","unstructured":"Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. J. Graph Theory 11(1), 71\u201379 (1987). https:\/\/doi.org\/10.1002\/jgt.3190110111","journal-title":"J. Graph Theory"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.comgeo.2003.07.001","volume":"27","author":"S Cheng","year":"2004","unstructured":"Cheng, S., Dey, T.K., Poon, S.: Hierarchy of surface models and irreducible triangulations. Comput. Geom. 27(2), 135\u2013150 (2004). https:\/\/doi.org\/10.1016\/j.comgeo.2003.07.001","journal-title":"Comput. Geom."},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TCAD.2004.823353","volume":"23","author":"J Cong","year":"2004","unstructured":"Cong, J., Lim, S.K.: Edge separability-based circuit clustering with application to multilevel circuit partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(3), 346\u2013357 (2004). https:\/\/doi.org\/10.1109\/TCAD.2004.823353","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2017.06.013","volume":"127","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Paulusma, D.: Contracting bipartite graphs to paths and cycles. Inf. Process. Lett. 127, 37\u201342 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2017.06.013","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"26_CR9","first-page":"223","volume":"15","author":"J Fiala","year":"2013","unstructured":"Fiala, J., Kaminski, M., Paulusma, D.: A note on contracting claw-free graphs. Discrete Math. Theor. Comput. Sci. 15(2), 223\u2013232 (2013)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"26_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, New York (1979)"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Hammack, R.H.: Cyclicity of graphs. J. Graph Theory 32(2), 160\u2013170 (1999). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199910)32:2<160::AID-JGT6>3.0.CO;2-U","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<160::AID-JGT6>3.0.CO;2-U"},{"key":"26_CR12","first-page":"89","volume":"63","author":"RH Hammack","year":"2002","unstructured":"Hammack, R.H.: A note on the complexity of computing cyclicity. Ars Comb. 63, 89\u201395 (2002)","journal-title":"Ars Comb."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-45294-X_3","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"D Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: On clustering using random walks. In: Hariharan, R., Vinay, V., Mukund, M. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 18\u201341. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45294-X_3"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Appl, Math. 164, 444\u2013449 (2014). https:\/\/doi.org\/10.1016\/j.dam.2013.02.025","DOI":"10.1016\/j.dam.2013.02.025"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(81)90022-4","volume":"34","author":"C Hoede","year":"1981","unstructured":"Hoede, C., Veldman, H.J.: Contraction theorems in Hamiltonian graph theory. Discrete Math. 34(1), 61\u201367 (1981). https:\/\/doi.org\/10.1016\/0012-365X(81)90022-4","journal-title":"Discrete Math."},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"van \u2019t Hof, P., Kaminski, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Appl. Math. 160(6), 799\u2013809 (2012). https:\/\/doi.org\/10.1016\/j.dam.2010.05.005","DOI":"10.1016\/j.dam.2010.05.005"},{"issue":"45","key":"26_CR17","doi-asserted-by":"publisher","first-page":"6340","DOI":"10.1016\/j.tcs.2011.07.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Kaminski, M., Paulusma, D., Thilikos, D.M.: Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. 412(45), 6340\u20136350 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.07.005","journal-title":"Theor. Comput. Sci."},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-15775-2_11","volume-title":"Algorithms \u2013 ESA 2010","author":"M Kami\u0144ski","year":"2010","unstructured":"Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Contractions of planar graphs in\u00a0polynomial\u00a0time. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 122\u2013133. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_11"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998). https:\/\/doi.org\/10.1137\/S1064827595287997","journal-title":"SIAM J. Sci. Comput."},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Kern, W., Paulusma, D.: Contracting to a longest path in H-free graphs. In: Cao, Y., Cheng, S., Li, M. (eds.) 31st International Symposium on Algorithms and Computation, ISAAC 2020, 14\u201318 December 2020, Hong Kong, China (Virtual Conference). LIPIcs, vol. 181, pp. 22:1\u201322:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2020.22","DOI":"10.4230\/LIPIcs.ISAAC.2020.22"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/net.20214","volume":"51","author":"A Levin","year":"2008","unstructured":"Levin, A., Paulusma, D., Woeginger, G.J.: The computational complexity of graph contractions I: polynomially solvable and NP-complete cases. Networks 51(3), 178\u2013189 (2008). https:\/\/doi.org\/10.1002\/net.20214","journal-title":"Networks"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jctb.2014.09.002","volume":"111","author":"B Martin","year":"2015","unstructured":"Martin, B., Paulusma, D.: The computational complexity of disconnected cut and $$2K_2$$-partition. J. Comb. Theory Ser. B 111, 17\u201337 (2015). https:\/\/doi.org\/10.1016\/j.jctb.2014.09.002","journal-title":"J. Comb. Theory Ser. B"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2020.04.005","volume":"113","author":"B Martin","year":"2020","unstructured":"Martin, B., Paulusma, D., van Leeuwen, E.J.: Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. 113, 60\u201375 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2020.04.005","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XIII. The Disjoint Paths Problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","journal-title":"J. Comb. Theory Ser. B"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1\u20133 May 1978, San Diego, California, USA. pp. 216\u2013226. ACM (1978). https:\/\/doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:18:56Z","timestamp":1664536736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"12","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)"}}]}}