{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:18:33Z","timestamp":1743005913061,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_27","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"331-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Treedepth Bounds in Linear Colorings"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Kun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael P.","family":"O\u2019Brien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blair D.","family":"Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: Rankings of graphs. SIAM J. Discrete Math. 11(1), 168\u2013181 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR2","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity. Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"key":"27_CR3","unstructured":"Demaine, E.,D., et al.: Structural sparsity of complex networks: random graph models and linear algorithms. CoRR, abs\/1406.2587 (2015)"},{"issue":"5","key":"27_CR4","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/2499483","volume":"60","author":"Z Dvo\u0159\u00e1k","year":"2013","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Thomas, R.: Testing first-order properties for subclasses of sparse graphs. JACM 60(5), 36:1\u201336:24 (2013)","journal-title":"JACM"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/3051095","volume":"64","author":"M Grohe","year":"2017","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. J. ACM (JACM) 64(3), 17 (2017)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Kun, J., O\u2019Brien, M.P., Sullivan, B.D.: Treedepth bounds in linear colorings. CoRR, abs\/1802.09665, May 2018","DOI":"10.1007\/978-3-030-00256-5_27"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkeikerker","year":"1962","unstructured":"Lekkeikerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundam. Math. 51(1), 45\u201364 (1962)","journal-title":"Fundam. Math."},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J Ne\u0161et\u0165il","year":"2008","unstructured":"Ne\u0161et\u0165il, J., de Mendez, P.O.: Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3), 760\u2013776 (2008)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.ejc.2006.07.014","volume":"29","author":"J Ne\u0161et\u0165il","year":"2008","unstructured":"Ne\u0161et\u0165il, J., de Mendez, P.O.: Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3), 777\u2013791 (2008)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.ejc.2007.11.019","volume":"29","author":"J Ne\u0161et\u0165il","year":"2008","unstructured":"Ne\u0161et\u0165il, J., de Mendez, P.O.: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. Eur. J. Comb. 29(4), 1012\u20131024 (2008). Homomorphisms: structure and highlights","journal-title":"Eur. J. Comb."},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"O\u2019Brien, M.P., Hobbs, C.G., Jasnick, K., Reidl, F., Rodrigues, N.G., Sullivan, B.D.: CONCUSS, v2.0., June 2016. https:\/\/doi.org\/10.5281\/zenodo.30281","DOI":"10.5281\/zenodo.30281"},{"key":"27_CR13","unstructured":"O\u2019Brien, M.P., Sullivan, B.D.: An experimental evaluation of a bounded expansion algorithmic pipeline. CoRR, abs\/1712.06690, December 2017"},{"key":"27_CR14","unstructured":"Reidl, F.: Structural sparseness and complex networks. Dr. Aachen, Techn. Hochsch., Aachen, 2015. Aachen, Techn. Hochsch., Dissertation (2015)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"AA Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal node ranking of trees in linear time. Inf. Process. Lett. 33(2), 91\u201396 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"18","key":"27_CR17","doi-asserted-by":"publisher","first-page":"5562","DOI":"10.1016\/j.disc.2008.03.024","volume":"309","author":"X Zhu","year":"2009","unstructured":"Zhu, X.: Colouring graphs with bounded generalized colouring number. Discrete Math. 309(18), 5562\u20135568 (2009)","journal-title":"Discrete 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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:26:04Z","timestamp":1710336364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_27","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)"}}]}}