{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:36:25Z","timestamp":1783150585972,"version":"3.54.6"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031159138","type":"print"},{"value":"9783031159145","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_24","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"328-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Fully Diverse Sets of\u00a0Geometric Objects and\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8208-3468","authenticated-orcid":false,"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995). https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-36763-2_48","volume-title":"Graph Drawing","author":"B Bach","year":"2013","unstructured":"Bach, B., Spritzer, A., Lutton, E., Fekete, J.-D.: Interactive random graph generation with evolutionary algorithms. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 541\u2013552. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_48"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Baste, J., et al.: Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), pp. 1119\u20131125 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/156","DOI":"10.24963\/ijcai.2020\/156"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"GD Battista","year":"1996","unstructured":"Battista, G.D., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996). https:\/\/doi.org\/10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-37623-2_26","volume-title":"Graph Drawing","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Marks, J., Ryall, K., Whitesides, S.: Graph multidrawing: finding nice drawings without defining nice. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 347\u2013355. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_26"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00373-006-0647-2","volume":"22","author":"N Bonichon","year":"2006","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Poulalhon, D., Schaeffer, G.: Planar graphs, via well-orderly maps and trees. Graphs Combin. 22(2), 185\u2013202 (2006). https:\/\/doi.org\/10.1007\/s00373-006-0647-2","journal-title":"Graphs Combin."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-37623-2_5","volume-title":"Graph Drawing","author":"S Bridgeman","year":"1998","unstructured":"Bridgeman, S., Tamassia, R.: Difference metrics for interactive orthogonal graph drawing algorithms. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 57\u201371. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_5"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1137\/0406027","volume":"6","author":"J Cai","year":"1993","unstructured":"Cai, J.: Counting embeddings of planar graphs using DFS trees. SIAM J. Discret. Math. 6(3), 335\u2013352 (1993). https:\/\/doi.org\/10.1137\/0406027","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1089\/big.2016.0054","volume":"5","author":"M Drosou","year":"2017","unstructured":"Drosou, M., Jagadish, H.V., Pitoura, E., Stoyanovich, J.: Diversity in big data: a review. Big Data 5(2), 73\u201384 (2017). https:\/\/doi.org\/10.1089\/big.2016.0054","journal-title":"Big Data"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"24_CR11","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: Proceedings of 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 372\u2013377 (2005)"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1934352","volume":"54","author":"MO Hill","year":"1973","unstructured":"Hill, M.O.: Diversity and evenness: a unifying notation and its consequences. Ecology 54(2), 427\u2013432 (1973). https:\/\/doi.org\/10.2307\/1934352","journal-title":"Ecology"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.comgeo.2019.07.005","volume":"84","author":"C Huemer","year":"2019","unstructured":"Huemer, C., Pilz, A., Silveira, R.I.: A new lower bound on the maximum number of plane graphs using production matrices. Comput. Geom. 84, 36\u201349 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.07.005","journal-title":"Comput. Geom."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Ingmar, L., de la Banda, M.G., Stuckey, P.J., Tack, G.: Modelling diversity of solutions. In: Proceedings of 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 1528\u20131535 (2020)","DOI":"10.1609\/aaai.v34i02.5512"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-030-83508-8_46","volume-title":"Algorithms and Data Structures","author":"M van Kreveld","year":"2021","unstructured":"van Kreveld, M., Speckmann, B., Urhausen, J.: Diverse partitions of colored points. In: Lubiw, A., Salavatipour, M. (eds.) WADS 2021. LNCS, vol. 12808, pp. 641\u2013654. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_46"},{"issue":"2\u20133","key":"24_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"A Kulesza","year":"2012","unstructured":"Kulesza, A., Taskar, B.: Determinantal point processes for machine learning. Found. Trends Mach. Learn. 5(2\u20133), 123\u2013286 (2012). https:\/\/doi.org\/10.1561\/2200000044","journal-title":"Found. Trends Mach. Learn."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.knosys.2017.02.009","volume":"123","author":"M Kunaver","year":"2017","unstructured":"Kunaver, M., Pozrl, T.: Diversity in recommender systems - a survey. Knowl. Based Syst. 123, 154\u2013162 (2017). https:\/\/doi.org\/10.1016\/j.knosys.2017.02.009","journal-title":"Knowl. Based Syst."},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"583","DOI":"10.2307\/1969046","volume":"49","author":"R Otter","year":"1948","unstructured":"Otter, R.: The number of trees. Ann. Math. 49(3), 583\u2013599 (1948)","journal-title":"Ann. Math."},{"issue":"1","key":"24_CR19","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62(1), 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"issue":"1\u20133","key":"24_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0012-365X(93)90316-L","volume":"122","author":"MFM Stallmann","year":"1993","unstructured":"Stallmann, M.F.M.: On counting planar embeddings. Discret. Math. 122(1\u20133), 385\u2013392 (1993). https:\/\/doi.org\/10.1016\/0012-365X(93)90316-L","journal-title":"Discret. Math."},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00442-010-1812-0","volume":"164","author":"H Tuomisto","year":"2010","unstructured":"Tuomisto, H.: A consistent terminology for quantifying species diversity? Yes, it does exist. Oecologia 164(4), 853\u2013860 (2010). https:\/\/doi.org\/10.1007\/s00442-010-1812-0","journal-title":"Oecologia"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-15844-5_71","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"T Ulrich","year":"2010","unstructured":"Ulrich, T., Bader, J., Thiele, L.: Defining and optimizing indicator-based diversity measures in multiobjective search. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 707\u2013717. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_71"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/3-540-45110-2_21","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"M Wineberg","year":"2003","unstructured":"Wineberg, M., Oppacher, F.: The underlying similarity of diversity measures used in evolutionary computation. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1493\u20131504. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45110-2_21"}],"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-15914-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:19:15Z","timestamp":1664536755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"3","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":"12","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)"}}]}}