{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T07:38:09Z","timestamp":1768462689455,"version":"3.49.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031433795","type":"print"},{"value":"9783031433801","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_22","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"305-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on\u00a0Functionality and\u00a0Symmetric Difference \u2013 Two Intriguing Graph Parameters"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Folwarczn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Opler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"\u0160\u00e1mal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tung Anh","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Alecu, B., Atminas, A., Lozin, V.V.: Graph functionality. J. Comb. Theory Ser. B 147, 139\u2013158 (2021). https:\/\/doi.org\/10.1016\/j.jctb.2020.11.002","DOI":"10.1016\/j.jctb.2020.11.002"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Haussler, D., Welzl, E.: Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension. In: Soule, D. (ed.) Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, 8\u201310 June 1987, pp. 331\u2013340. ACM (1987)","DOI":"10.1145\/41958.41994"},{"issue":"2","key":"22_CR3","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. Discret. Math. 338(2), 164\u2013179 (2015). https:\/\/doi.org\/10.1016\/j.disc.2014.09.008","journal-title":"Discret. Math."},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Balogh, J., Bollob\u00e1s, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Comb. Theory Ser. B 79(2), 131\u2013156 (2000). https:\/\/doi.org\/10.1006\/jctb.2000.1952, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S009589560091952X","DOI":"10.1006\/jctb.2000.1952"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Dallard, C., Lozin, V., Milani\u010d, M., \u0160torgel, K., Zamaraev, V.: Functionality of box intersection graphs (2023). https:\/\/doi.org\/10.48550\/ARXIV.2301.09493","DOI":"10.48550\/ARXIV.2301.09493"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Hatami, H., Hatami, P.: The implicit graph conjecture is false. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31\u20133 November 2022, pp. 1134\u20131137. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00109"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(96)00137-0","volume":"77","author":"E Kranakis","year":"1997","unstructured":"Kranakis, E., Krizanc, D., Ruf, B., Urrutia, J., Woeginger, G.: The VC-dimension of set systems defined by graphs. Discret. Appl. Math. 77(3), 237\u2013257 (1997). https:\/\/doi.org\/10.1016\/S0166-218X(96)00137-0","journal-title":"Discret. Appl. Math."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Ne\u0161et\u0159il, J.: Invitation to Discrete Mathematics, 2 ed. Oxford University Press, Oxford (2009)","DOI":"10.1093\/oso\/9780198570431.001.0001"}],"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-031-43380-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T11:57:44Z","timestamp":1703246264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","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":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}