{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:42:26Z","timestamp":1742942546046,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_2","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterising AT-free Graphs with BFS"],"prefix":"10.1007","author":[{"given":"Jesse","family":"Beisegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Beisegel, J.: Characterising AT-free graphs with BFS. arXiv preprint (2018)","DOI":"10.1007\/978-3-030-00256-5_2"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"H Broersma","year":"1999","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discret. Math. 12(2), 276\u2013287 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-29516-9_7","volume-title":"Combinatorial Algorithms","author":"JM Chang","year":"2016","unstructured":"Chang, J.M., Kloks, T., Wang, H.-L.: Gray codes for AT-free orders via antimatroids. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 77\u201387. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_7"},{"key":"2_CR4","unstructured":"Chang, J.M., Kloks, T., Wang, H.-L.: Convex geometries on AT-free graphs and an application to generating the AT-free orders. arXiv preprint arXiv:1706.06336 (2017)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-76796-1_3","volume-title":"Research Trends in Combinatorial Optimization","author":"V Chv\u00e1tal","year":"2009","unstructured":"Chv\u00e1tal, V.: Antimatroids, betweenness, convexity. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 57\u201364. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_3"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","volume":"138","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discret. Appl. Math. 138(3), 371\u2013379 (2004)","journal-title":"Discret. Appl. Math."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30559-0_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: Lexicographic breadth first search \u2013 a survey. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_1"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discret. Math. 10(3), 399\u2013430 (1997)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"DG Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28(4), 1284\u20131297 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"DG Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discret. Math. 23(4), 1905\u20131953 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/jgt.21795","volume":"78","author":"DG Corneil","year":"2015","unstructured":"Corneil, D.G., Stacho, J.: Vertex ordering characterizations of graphs of bounded asteroidal number. J. Graph Theory 78(1), 61\u201379 (2015)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00149365","volume":"19","author":"PH Edelman","year":"1985","unstructured":"Edelman, P.H., Jamison, R.E.: The theory of convex geometries. Geometriae Dedicata 19(3), 247\u2013270 (1985)","journal-title":"Geometriae Dedicata"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00208-6","volume":"121","author":"H Hempel","year":"2002","unstructured":"Hempel, H., Kratsch, D.: On claw-free asteroidal triple-free graphs. Discret. Appl. Math. 121(1), 155\u2013180 (2002)","journal-title":"Discret. Appl. Math."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-24971-1_2","volume-title":"Gems of Combinatorial Optimization and Graph Algorithms","author":"E K\u00f6hler","year":"2015","unstructured":"K\u00f6hler, E.: Linear structure of graphs and the knotting graph. In: Schulz, A., Skutella, M., Stiller, S., Wagner, D. (eds.) Gems of Combinatorial Optimization and Graph Algorithms, pp. 13\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24971-1_2"},{"key":"2_CR15","volume-title":"Graphs Without Asteroidal Triples","author":"EG K\u00f6hler","year":"1999","unstructured":"K\u00f6hler, E.G.: Graphs Without Asteroidal Triples. Cuvillier, G\u00f6ttingen (1999)"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/S0097539704441435","volume":"36","author":"D Kratsch","year":"2006","unstructured":"Kratsch, D., Spinrad, J.: Between $$ \\cal{O}(nm) $$ and $$ \\cal{O}(n^{\\alpha }) $$. SIAM J. Comput. 36(2), 310\u2013325 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51(1), 45\u201364 (1962)","journal-title":"Fundamenta Mathematicae"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.dam.2004.10.001","volume":"146","author":"D Meister","year":"2005","unstructured":"Meister, D.: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discret. Appl. Math. 146(3), 193\u2013218 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:02Z","timestamp":1710336242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_2","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)"}}]}}