{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:02:09Z","timestamp":1762210929273,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_11","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"125-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Small Pivot-Minors"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0535-9640","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Dross","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3614-4199","authenticated-orcid":false,"given":"Jisu","family":"Jeong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1838-7744","authenticated-orcid":false,"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1820-1962","authenticated-orcid":false,"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6889-7286","authenticated-orcid":false,"given":"Sang-il","family":"Oum","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jctb.1994.1008","volume":"60","author":"A Bouchet","year":"1994","unstructured":"Bouchet, A.: Circle graph obstructions. J. Comb. Theory, Ser. B 60(1), 107\u2013144 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0024-3795(91)90020-W","volume":"146","author":"A Bouchet","year":"1991","unstructured":"Bouchet, A., Duchamp, A.: Representability of $$\\Delta $$-matroids over GF(2). Linear Algebra Appl. 146, 67\u201378 (1991)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"11_CR3","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)","journal-title":"J. Graph Theory"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart, L.: Complement reducible graphs. Discrete Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B Courcelle","year":"2007","unstructured":"Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97(1), 91\u2013126 (2007)","journal-title":"J. Comb. Theory, Ser. B"},{"doi-asserted-by":"publisher","unstructured":"Dabrowski, K.K.: Computing small pivot-minors [computer software]. Durham University (2018). https:\/\/doi.org\/10.15128\/r1t722h881p","key":"11_CR6","DOI":"10.15128\/r1t722h881p"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-68705-6_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-width and well-quasi-ordering of triangle-free graph classes. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 220\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_17"},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1093\/comjnl\/bxv096","volume":"59","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Paulusma, D.: Clique-width of graph classes defined by two forbidden induced subgraphs. Comput. J. 59(5), 650\u2013666 (2016)","journal-title":"Comput. J."},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"MR Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13(3), 266\u2013282 (1995)","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Geelen, J., Gerards, B., Whittle, G.: Towards a structure theory for matrices and matroids. In: Proceedings of ICM 2006, vol. III, no. 827\u2013842 (2006)","key":"11_CR11","DOI":"10.4171\/022-3\/41"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20363","volume":"61","author":"J Geelen","year":"2009","unstructured":"Geelen, J., Oum, S.: Circle graph obstructions under pivoting. J. Graph Theory 61(1), 1\u201311 (2009)","journal-title":"J. Graph Theory"},{"doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K.-i., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of STOC 2011, pp. 479\u2013488 (2011)","key":"11_CR13","DOI":"10.1145\/1993636.1993700"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s00224-016-9685-1","volume":"60","author":"F Gurski","year":"2017","unstructured":"Gurski, F.: The behavior of clique-width under graph operations and graph transformations. Theory Comput. Syst. 60(2), 346\u2013376 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"12","key":"11_CR15","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747\u20132761 (2009)","journal-title":"Discrete Appl. Math."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.dam.2013.01.007","volume":"168","author":"O Kwon","year":"2014","unstructured":"Kwon, O., Oum, S.: Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discrete Appl. Math. 168, 108\u2013118 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"17","key":"11_CR17","doi-asserted-by":"publisher","first-page":"3540","DOI":"10.1016\/j.dam.2009.02.015","volume":"157","author":"B L\u00e9v\u00eaque","year":"2009","unstructured":"L\u00e9v\u00eaque, B., Lin, D.Y., Maffray, F., Trotignon, N.: Detecting induced subgraphs. Discrete Appl. Math. 157(17), 3540\u20133551 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.jctb.2012.04.005","volume":"102","author":"B L\u00e9v\u00eaque","year":"2012","unstructured":"L\u00e9v\u00eaque, B., Maffray, F., Trotignon, N.: On graphs with no induced subdivision of $$K_4$$. J. Comb. Theory Ser. B 102(4), 924\u2013947 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"11_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial $$k$$-trees. Discrete Math. 108(1\u20133), 343\u2013364 (1992)","journal-title":"Discrete Math."},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28(1), 53\u201354 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S Oum","year":"2005","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79\u2013100 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1137\/050629616","volume":"22","author":"S Oum","year":"2008","unstructured":"Oum, S.: Rank-width and well-quasi-ordering. SIAM J. Discrete Math. 22(2), 666\u2013682 (2008)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/jgt.20353","volume":"60","author":"S Oum","year":"2009","unstructured":"Oum, S.: Excluding a bipartite circle graph from line graphs. J. Graph Theory 60(3), 183\u2013203 (2009)","journal-title":"J. Graph Theory"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2016.08.006","volume":"231","author":"S Oum","year":"2017","unstructured":"Oum, S.: Rank-width: algorithmic and structural results. Discrete Appl. Math. 231, 15\u201324 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"unstructured":"Oxley, J.G.: Matroid Theory. Oxford Graduate Texts in Mathematics, vol. 21, Second edn. Oxford University Press, Oxford (2011)","key":"11_CR27"},{"issue":"1","key":"11_CR28","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)","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"crossref","unstructured":"van\u2019t Hof, P., Kami\u0144ski, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discrete Appl. Math. 160(6), 799\u2013809 (2012)","key":"11_CR29","DOI":"10.1016\/j.dam.2010.05.005"}],"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-030-00256-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:50Z","timestamp":1710336290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","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":"Cottbus","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"45% - 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":"4","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":"11,5","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)"}}]}}