{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:27:26Z","timestamp":1743154046652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_24","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"325-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Dominance in the Plane and Its Applications"],"prefix":"10.1007","author":[{"given":"Jongmin","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-4126","authenticated-orcid":false,"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":[[2019,7,12]]},"reference":[{"key":"24_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":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.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":"24_CR3","unstructured":"Bringmann, K., Cabello, S., Emmerich, M.T.M.: Maximum volume subset selection for anchored boxes. In: 33rd International Symposium on Computational Geometry (SoCG 2017), vol. 77. Leibniz International Proceedings in Informatics (LIPIcs), pp. 22:1\u201322:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: GECCO, pp. 589\u2013596. ACM (2014)","DOI":"10.1145\/2576768.2598276"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-18173-8_8","volume-title":"Algorithms and Complexity","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., Golin, M., Lam, T.-W., Nogneng, D.: Scheduling with gaps: new models and algorithms. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 114\u2013126. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_8"},{"key":"24_CR6","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":"24_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"key":"24_CR8","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. (2018)","DOI":"10.1007\/s10898-018-0694-2"},{"issue":"4","key":"24_CR9","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":"24_CR10","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"},{"issue":"3","key":"24_CR11","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.R.: Hypervolume subset selection in two dimensions: formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016)","journal-title":"Evol. Comput."},{"key":"24_CR12","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 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"24_CR13","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":"24_CR14","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":"24_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"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":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:54:29Z","timestamp":1710266069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}