{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:40:31Z","timestamp":1743007231651,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_16","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"190-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasimonotone Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(98)00310-0","volume":"201","author":"KP Bogart","year":"1999","unstructured":"Bogart, K.P., West, D.B.: A short proof that \u2018proper = unit\u2019. Discret. Math. 201(1), 21\u201323 (1999)","journal-title":"Discret. Math."},{"key":"16_CR2","volume-title":"Graphclasses: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graphclasses: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"16_CR3","first-page":"273","volume":"67","author":"A Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria 67, 273\u2013281 (2003)","journal-title":"Ars Combinatoria"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Graham, R., Holmes, S.P.: Statistical problems involving permutations with restricted positions. In: State of the Art in Probability and Statistics. Lecture Notes-Monograph Series, vol. 36, pp. 195\u2013222. Institute of Mathematical Statistics (2001)","DOI":"10.1214\/lnms\/1215090070"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2822322","volume":"64","author":"M Dyer","year":"2017","unstructured":"Dyer, M., Jerrum, M., M\u00fcller, H.: On the switch Markov chain for perfect matchings. J. ACM 64(2), 12 (2017)","journal-title":"J. ACM"},{"key":"16_CR6","unstructured":"Dyer, M., M\u00fcller, H.: Counting perfect matchings and the switch chain. CoRR abs\/1705.05790 (2017)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dyer, M., M\u00fcller, H.: Quasimonotone graphs. CoRR abs\/1801.06494 (2018)","DOI":"10.1007\/978-3-030-00256-5_16"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.4153\/CMB-1967-046-4","volume":"10","author":"RK Guy","year":"1967","unstructured":"Guy, R.K., Harary, F.: On the M\u00f6bius ladders. Can. Math. Bull. 10, 493\u2013496 (1967)","journal-title":"Can. Math. Bull."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46, 313\u2013327 (2004)","journal-title":"J. Graph Theory"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(01)00064-4","volume":"244","author":"M Hladnik","year":"2002","unstructured":"Hladnik, M., Maru\u0161i\u010d, D., Pisanski, T.: Cyclic Haar graphs. Discret. Mat. 244(1), 137\u2013152 (2002)","journal-title":"Discret. Mat."},{"key":"16_CR11","unstructured":"K\u00f6hler, E.: Graphs without asteroidal triples. Ph.D. thesis, TU Berlin (1999)"},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16(5), 854\u2013879 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-006-1225-y","volume":"47","author":"SD Nikolopoulos","year":"2007","unstructured":"Nikolopoulos, S.D., Palios, L.: Detecting holes and antiholes in graphs. Algorithmica 47(2), 119\u2013138 (2007)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discret. Appl. Math. 18(3), 279\u2013292 (1987)","journal-title":"Discret. Appl. Math."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:25Z","timestamp":1710336325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_16","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)"}}]}}