{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:04:59Z","timestamp":1762211099225,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_5","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["End-Vertices of AT-free Bigraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1435-8508","authenticated-orcid":false,"given":"Jan","family":"Gorzny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"5_CR1","unstructured":"Beisegel, J.: On the end-vertex problem of graph searches. Discret. Math. Theor. Comput. Sci. 21(1) (2019). http:\/\/dmtcs.episciences.org\/5572"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.3390\/a3020100","volume":"3","author":"A Berry","year":"2010","unstructured":"Berry, A., Blair, J.R.S., Bordat, J.-P., Simonet, G.: Graph extremities defined by search algorithms. Algorithms 3(2), 100\u2013124 (2010)","journal-title":"Algorithms"},{"key":"5_CR3","unstructured":"Berry, A., Bordat, J.-P.: Local LexBFS properties in an arbitrary graph. In: Proceedings of Journ\u00e9es Informatiques Messines (JIM) (2000)"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2008)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Spinard, J.P., Bang Le, V.: Graph Classes: A Survey, vol. 3. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Cao, Y., Wang, Z., Rong, G., Wang, J.: Graph searches and their end vertices. In: Lu, P., Zhang, G. (eds.) 30th International Symposium on Algorithms and Computation, (ISAAC), LIPIcs, vol. 149, pp. 1:1\u20131:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2019.1","DOI":"10.4230\/LIPIcs.ISAAC.2019.1"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-46632-0_17","volume-title":"Algorithms and Computation","author":"J-M Chang","year":"1999","unstructured":"Chang, J.-M., Ho, C.-W., Ko, M.-T.: LexBFS-ordering in asteroidal triple-free graphs. ISAAC 1999. LNCS, vol. 1741, pp. 163\u2013172. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_17"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Charbit, P., Habib, M., Mamcarz, A.: Influence of the tie-break rule on the end-vertex problem (2014)","DOI":"10.46298\/dmtcs.2081"},{"key":"5_CR9","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":"2\u20133","key":"5_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(00)00281-X","volume":"113","author":"DG Corneil","year":"2001","unstructured":"Corneil, D.G., Dragan, F.F., Habib, M., Paul, C.: Diameter determination on restricted graph families. Discret. Appl. Math. 113(2\u20133), 143\u2013166 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.dam.2009.10.001","volume":"158","author":"DG Corneil","year":"2010","unstructured":"Corneil, D.G., K\u00f6hler, E., Lanlignel, J.-M.: On end-vertices of lexicographic breadth first searches. Discret. Appl. Math. 158(5), 434\u2013443 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"DG Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.M.: A unified view of graph searching. SIAM J. Discret. Math. 22(4), 1259\u20131276 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"5_CR13","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":"5_CR14","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."},{"key":"5_CR15","unstructured":"Dragan, F.F., Nicolai, F.: LexBFS orderings of distance hereditary graphs. UD, Fachbereich Mathematik (1995)"},{"key":"5_CR16","unstructured":"Gorzny, J.: On end vertices of search algorithms. Master\u2019s thesis, University of Victoria, Victoria, BC, Canada (2015)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2017.02.027","volume":"225","author":"J Gorzny","year":"2017","unstructured":"Gorzny, J., Huang, J.: End-vertices of LBFS of (AT-free) bigraphs. Discret. Appl. Math. 225, 87\u201394 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"5_CR18","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(4), 313\u2013327 (2004)","journal-title":"J. Graph Theory"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B Jamison","year":"1988","unstructured":"Jamison, B., Olariu, S.: On the semi-perfect elimination. Adv. Appl. Math. 9(3), 364\u2013376 (1988)","journal-title":"Adv. Appl. Math."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-18173-8_22","volume-title":"Algorithms and Complexity","author":"D Kratsch","year":"2015","unstructured":"Kratsch, D., Liedloff, M., Meister, D.: End-vertices of graph search algorithms. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 300\u2013312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_22"},{"issue":"1","key":"5_CR21","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":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"2820","DOI":"10.1137\/17M1120920","volume":"32","author":"GB Mertzios","year":"2018","unstructured":"Mertzios, G.B., Nichterlein, A., Niedermeier, R.: A linear-time algorithm for maximum-cardinality matching on cocomparability graphs. SIAM J. Discret. Math. 32(4), 2820\u20132835 (2018). https:\/\/doi.org\/10.1137\/17M1120920","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"J Donald Rose","year":"1976","unstructured":"Donald Rose, J., Endre Tarjan, R., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"5_CR24","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T04:45:08Z","timestamp":1668055508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}