{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:19:59Z","timestamp":1743081599113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_4","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"49-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorics and Algorithms for\u00a0Quasi-chain Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5515-9145","authenticated-orcid":false,"given":"Bogdan","family":"Alecu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5026-3210","authenticated-orcid":false,"given":"Aistis","family":"Atminas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2464-7389","authenticated-orcid":false,"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"Dmitriy","family":"Malyshev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/jgt.20355","volume":"60","author":"P Allen","year":"2009","unstructured":"Allen, P.: Forbidden induced bipartite graphs. J. Graph Theory 60, 219\u2013241 (2009)","journal-title":"J. Graph Theory"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.disc.2014.09.008","volume":"338","author":"A Atminas","year":"2015","unstructured":"Atminas, A., Collins, A., Lozin, V., Zamaraev, V.: Implicit representations and factorial properties of graphs. Discrete Math. 338, 164\u2013179 (2015)","journal-title":"Discrete Math."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/jctb.2000.1952","volume":"79","author":"J Balogh","year":"2000","unstructured":"Balogh, J., Bollob\u00e1s, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Combin. Theory Ser. B 79, 131\u2013156 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65, 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s00039-012-0171-x","volume":"22","author":"D Conlon","year":"2012","unstructured":"Conlon, D., Fox, J.: Bounds for graph regularity and removal lemmas. Geom. Funct. Anal. 22, 1191\u20131256 (2012)","journal-title":"Geom. Funct. Anal."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36, 231\u2013236 (1990)","journal-title":"Inform. Process. Lett."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P Goldberg","year":"1995","unstructured":"Goldberg, P., Golumbic, M., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2, 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"P Hammer","year":"1990","unstructured":"Hammer, P., Peled, U.N., Sun, X.: Difference graphs. Discrete Appl. Math. 28, 35\u201344 (1990)","journal-title":"Discrete Appl. Math."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van \u2019t Hof, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562, 252\u2013269 (2015)","DOI":"10.1016\/j.tcs.2014.10.002"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 8, 438\u2013448 (1987)","journal-title":"J. Algorithms"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5, 596\u2013603 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR12","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17333-2","volume-title":"Patterns in Permutations and Words","author":"S Kitaev","year":"2011","unstructured":"Kitaev, S.: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17333-2"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/jgt.20528","volume":"67","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.: Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory 67, 235\u2013249 (2011)","journal-title":"J. Graph Theory"},{"key":"4_CR14","first-page":"345","volume":"84","author":"V Lozin","year":"2007","unstructured":"Lozin, V., Rudolf, G.: Minimal universal bipartite graphs. Ars Combin. 84, 345\u2013356 (2007)","journal-title":"Ars Combin."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0129054108005772","volume":"19","author":"V Lozin","year":"2008","unstructured":"Lozin, V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. Int. J. Found. Comput. Sci. 19, 477\u2013494 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"V Lozin","year":"2002","unstructured":"Lozin, V.: On maximum induced matchings in bipartite graphs. Inform. Process. Lett. 81, 7\u201311 (2002)","journal-title":"Inform. Process. Lett."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1090\/S0002-9947-2013-05820-5","volume":"366","author":"M Malliaris","year":"2014","unstructured":"Malliaris, M., Shelah, S.: Regularity lemmas for stable graphs. Trans. Am. Math. Soc. 366, 1551\u20131585 (2014)","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller, H., Brandst\u00e4dt, A.: The NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. Theoret. Comput. Sci. 53, 257\u2013265 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00383169","volume":"7","author":"H M\u00fcller","year":"1990","unstructured":"M\u00fcller, H.: Alternating cycle-free matchings. Order 7, 11\u201321 (1990)","journal-title":"Order"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291\u2013298 (1996)","journal-title":"Discrete Math."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131, 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0012-365X(01)00094-2","volume":"244","author":"M Petkov\u0161ek","year":"2002","unstructured":"Petkov\u0161ek, M.: Letter graphs and well-quasi-order by induced subgraphs. Discrete Math. 244, 375\u2013388 (2002)","journal-title":"Discrete Math."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Spinrad, J. P.: Efficient graph representations. Fields Institute Monographs, 19. American Mathematical Society, Providence, RI (2003)","DOI":"10.1090\/fim\/019"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Zverovich, I.E.: Satgraphs and independent domination. Part 1. Theor. Comput. Sci. 352, 47\u201356 (2006)","DOI":"10.1016\/j.tcs.2005.08.038"}],"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-030-79987-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:10:36Z","timestamp":1625008236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","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":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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)"}},{"value":"The workshop was held virtually.","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)"}}]}}