{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:34:44Z","timestamp":1760441684902,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2017-0-00905"],"award-info":[{"award-number":["2017-0-00905"]}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"crossref","award":["P1-0297","J1-8130"],"award-info":[{"award-number":["P1-0297","J1-8130"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"crossref","award":["J1-8155","J1-9109"],"award-info":[{"award-number":["J1-8155","J1-9109"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"crossref","award":["J1-1693"],"award-info":[{"award-number":["J1-1693"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["2019-0-01906"],"award-info":[{"award-number":["2019-0-01906"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00453-021-00863-2","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T14:02:53Z","timestamp":1628863373000},"page":"3491-3513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Maximizing Dominance in the Plane and its Applications"],"prefix":"10.1007","volume":"83","author":[{"given":"Jongmin","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Cabello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,13]]},"reference":[{"key":"863_CR1","doi-asserted-by":"crossref","unstructured":"Alrifai, M., Skoutas, D., Risse, T.: Selecting skyline services for QoS-based web service composition. In: Proceedings of the 19th International Conference on World Wide Web (WWW 2010), pp. 11\u201320. ACM (2010)","DOI":"10.1145\/1772690.1772693"},{"issue":"2","key":"863_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, Mikkel: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorith. 1(2), 243\u2013264 (2005)","journal-title":"ACM Trans. Algorith."},{"issue":"3","key":"863_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"Kellogg S Booth","year":"1976","unstructured":"Booth, Kellogg S., Lueker, George S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"863_CR4","unstructured":"Bringmann, K., Cabello, S., Emmerich, M.T.M.: Maximum volume subset selection for anchored boxes. In: Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), volume\u00a077 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 22:1\u201322:15. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2017)"},{"key":"863_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO 2014), pp. 589\u2013596. ACM (2014)","DOI":"10.1145\/2576768.2598276"},{"issue":"4","key":"863_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discret. Comput. Geom. 16(4), 361\u2013368 (1996)","journal-title":"Discret. Comput. Geom."},{"key":"863_CR7","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Golin, M.J., Lam, T.W., Nogneng, D.: Scheduling with gaps: new models and algorithms. In: Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), volume 9079 of Lecture Notes in Computer Science (LNCS), pp. 114\u2013126. Springer (2015)","DOI":"10.1007\/978-3-319-18173-8_8"},{"key":"863_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2016.11.001","volume":"118","author":"P Damaschke","year":"2017","unstructured":"Damaschke, P.: Refined algorithms for hitting many intervals. Inf. Process. Lett. 118, 117\u2013122 (2017)","journal-title":"Inf. Process. Lett."},{"key":"863_CR9","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"863_CR10","doi-asserted-by":"crossref","unstructured":"Ertem, Z., Lykhovyd, E., Wang, Y., Butenko, S.: The maximum independent union of cliques problem: complexity and exact approaches. J. Glob. Optim., Published online (2018)","DOI":"10.1007\/s10898-018-0694-2"},{"issue":"4","key":"863_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/net.3230170407","volume":"17","author":"F Gavril","year":"1987","unstructured":"Gavril, F.: Algorithms for maximum k-colorings and k-coverings of transitive graphs. Networks 17(4), 465\u2013470 (1987)","journal-title":"Networks"},{"key":"863_CR12","first-page":"45","volume":"31","author":"K Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P., Woeginger, G.: The disjoint cliques problem. RAIRO Recherhe Op\u00e9rationnelle 31, 45\u201366 (1997)","journal-title":"RAIRO Recherhe Op\u00e9rationnelle"},{"key":"863_CR13","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Seidel, R.: Output-size sensitive algorithms for finding maximal vectors. In: Proceedings of the First Annual Symposium on Computational Geometry (SoCG 1985), pp. 89\u201396. ACM (1985)","DOI":"10.1145\/323233.323246"},{"issue":"3","key":"863_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.: Hypervolume subset selection in two dimensions: formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016)","journal-title":"Evol. Comput."},{"key":"863_CR15","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: the $$k$$ most representative skyline operator. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), pp. 86\u201395. IEEE Computer Society (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"issue":"3","key":"863_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"863_CR17","doi-asserted-by":"crossref","unstructured":"Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: Proceedings of the 25th International Conference on Data Engineering (ICDE 2009), pp. 892\u2013903. IEEE Computer Society (2009)","DOI":"10.1109\/ICDE.2009.84"},{"issue":"2","key":"863_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Inf. Process. Lett. 24(2), 133\u2013137 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"863_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Long Yuan","year":"2016","unstructured":"Long Yuan, L., Qin, X.L., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00863-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00863-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00863-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T12:04:07Z","timestamp":1635336247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00863-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["863"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00863-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"assertion":[{"value":"30 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}