{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:30:17Z","timestamp":1742941817187,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"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-06678-8_30","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"412-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9860-2928","authenticated-orcid":false,"given":"Felicia","family":"Lucke","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0016-4024","authenticated-orcid":false,"given":"Felix","family":"Mann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"30_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms and Applications, pp. 461\u2013509. Prentice Hall, New Jersey (1993)"},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"Bentz, C., Costa, M.C., de Werra, D., Picouleau, C., Ries, B.: Minimum d-transversals of maximum-weight stable sets in trees. Electron. Notes Discrete Math. 38, 129\u2013134 (2011). https:\/\/doi.org\/10.1016\/j.endm.2011.09.022. The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011","DOI":"10.1016\/j.endm.2011.09.022"},{"key":"30_CR3","doi-asserted-by":"publisher","unstructured":"Cerioli, M.R., Lima, P.T.: Intersection of longest paths in graph classes. Discrete Appl. Math. 281, 96\u2013105 (2020). https:\/\/doi.org\/10.1016\/j.dam.2019.03.022. lAGOS 2017: IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M., Marseille, France (2017)","DOI":"10.1016\/j.dam.2019.03.022"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, p. 37. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53622-3"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2018.06.023","volume":"746","author":"\u00d6Y Diner","year":"2018","unstructured":"Diner, \u00d6.Y., Paulusma, D., Picouleau, C., Ries, B.: Contraction and deletion blockers for perfect graphs and H-free graphs. Theoret. Comput. Sci. 746, 49\u201372 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.06.023","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2021.03.028","volume":"877","author":"E Galby","year":"2021","unstructured":"Galby, E., Mann, F., Ries, B.: Blocking total dominating sets via edge contractions. Theoret. Comput. Sci. 877, 18\u201335 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.03.028","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.dam.2021.09.009","volume":"305","author":"E Galby","year":"2021","unstructured":"Galby, E., Mann, F., Ries, B.: Reducing the domination number of (p3+kp2)-free graphs via one edge contraction. Discrete Appl. Math. 305, 205\u2013210 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.09.009","journal-title":"Discrete Appl. Math."},{"key":"30_CR8","unstructured":"Galby, E., Lima, P.T., Mann, F., Ries, B.: Using edge contractions to reduce the semitotal domination number (2021). 10.48550\/ARXIV.2107.03755. https:\/\/arxiv.org\/abs\/2107.03755"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972). https:\/\/doi.org\/10.1137\/0201013","journal-title":"SIAM J. Comput."},{"issue":"9","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/12.312117","volume":"43","author":"D Paik","year":"1994","unstructured":"Paik, D., Reddy, S., Sahni, S.: Deleting vertices to bound path length. IEEE Trans. Comput. 43(9), 1091\u20131096 (1994). https:\/\/doi.org\/10.1109\/12.312117","journal-title":"IEEE Trans. Comput."},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-45587-7_4","volume-title":"Combinatorial Optimization","author":"D Paulusma","year":"2016","unstructured":"Paulusma, D., Picouleau, C., Ries, B.: Reducing the clique and chromatic number via edge contractions and vertex deletions. In: Cerulli, R., Fujishige, S., Mahjoub, A.R. (eds.) ISCO 2016. LNCS, vol. 9849, pp. 38\u201349. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45587-7_4"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Picouleau, C., Paulusma, D., Ries, B.: Reducing the chromatic number by vertex or edge deletions. Electron. Notes Discrete Math. 62, 243\u2013248 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.10.042. lAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization","DOI":"10.1016\/j.endm.2017.10.042"},{"issue":"2","key":"30_CR13","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae 15(2), 307\u2013309 (1974)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"13","key":"30_CR14","doi-asserted-by":"publisher","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R Zenklusen","year":"2009","unstructured":"Zenklusen, R., Ries, B., Picouleau, C., de Werra, D., Costa, M.C., Bentz, C.: Blockers and transversals. Discrete Math. 309(13), 4306\u20134314 (2009). https:\/\/doi.org\/10.1016\/j.disc.2009.01.006","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:34Z","timestamp":1653779254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_30","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":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"10","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)"}}]}}