{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:25:34Z","timestamp":1743013534525,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030677305"},{"type":"electronic","value":"9783030677312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67731-2_7","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Balanced Independent and Dominating Sets on Colored Interval Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0104-1659","authenticated-orcid":false,"given":"Sujoy","family":"Bhore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-943X","authenticated-orcid":false,"given":"Jan-Henrik","family":"Haunert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7966-076X","authenticated-orcid":false,"given":"Guangping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"3\u20134","key":"7_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Van Kreveld, M.J., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl. 11(3\u20134), 209\u2013218 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(98)00028-5","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986). https:\/\/doi.org\/10.1137\/0215075","journal-title":"SIAM J. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-030-25005-8_5","volume-title":"Combinatorial Algorithms","author":"S Banerjee","year":"2019","unstructured":"Banerjee, S., Bhore, S.: Algorithm and hardness results on liar\u2019s dominating set and $${k}$$-tuple dominating set. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 48\u201360. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_5"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.comgeo.2009.03.006","volume":"43","author":"K Been","year":"2010","unstructured":"Been, K., N\u00f6llenburg, M., Poon, S.H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Comput. Geome. Theory Appl. 43(3), 312\u2013328 (2010). https:\/\/doi.org\/10.1016\/j.comgeo.2009.03.006","journal-title":"Comput. Geome. Theory Appl."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. In: Computational Geometry (SoCG 2009), pp. 333\u2013340. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1542362.1542420","DOI":"10.1145\/1542362.1542420"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1007\/978-1-4613-0303-9_28","volume-title":"Handbook of Combinatorial Optimization","author":"GJ Chang","year":"1998","unstructured":"Chang, G.J.: Algorithmic aspects of domination in graphs. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1811\u20131877. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_28"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: k-domination and k-independence in graphs: a survey. Graphs Comb. 28(1), 1\u201355 (2012). https:\/\/doi.org\/10.1007\/s00373-011-1040-3","journal-title":"Graphs Comb."},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Federickson","year":"1987","unstructured":"Federickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987). https:\/\/doi.org\/10.1137\/0216064","journal-title":"SIAM J. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.dam.2016.09.045","volume":"217","author":"V Garnero","year":"2017","unstructured":"Garnero, V., Sau, I., Thilikos, D.M.: A linear kernel for planar red-blue dominating set. Discrete Appl. Math. 217, 536\u2013547 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.09.045","journal-title":"Discrete Appl. Math."},{"key":"7_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Haunert, J.H., Hermes, T.: Labeling circular focus regions based on a tractable case of maximum weight independent set of rectangles. In: ACM SIGSPATIAL Workshop on Interacting with Maps (MapInteract 2014), pp. 15\u201321 (2014). https:\/\/doi.org\/10.1145\/2677068.2677069","DOI":"10.1145\/2677068.2677069"},{"key":"7_CR12","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics, vol. 208. Dekker (1998)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(91)90188-N","volume":"37","author":"RW Irving","year":"1991","unstructured":"Irving, R.W.: On approximating the minimum independent dominating set. Inf. Process. Lett. 37(4), 197\u2013200 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90188-N","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"MJ van Kreveld","year":"1999","unstructured":"van Kreveld, M.J., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. Theory Appl. 13(1), 21\u201347 (1999). https:\/\/doi.org\/10.1016\/S0925-7721(99)00005-X","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"7_CR15","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). https:\/\/doi.org\/10.4064\/fm-51-1-45-64","journal-title":"Fundam. Math."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: Computational Geometry (SoCG 2009), pp. 17\u201322. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1542362.1542367","DOI":"10.1145\/1542362.1542367"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2), 229\u2013242 (2008). https:\/\/doi.org\/10.1016\/j.jda.2006.07.006","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Global Optim. 4(3), 301\u2013328 (1994). https:\/\/doi.org\/10.1007\/BF01098364","journal-title":"J. Global Optim."},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90081-7","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10951-014-0398-5","volume":"18","author":"R Van Bevern","year":"2015","unstructured":"Van Bevern, R., Mnich, M., Niedermeier, R., Weller, M.: Interval scheduling and colorful independent sets. J. Sched. 18(5), 449\u2013469 (2015). https:\/\/doi.org\/10.1007\/s10951-014-0398-5","journal-title":"J. Sched."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-37623-2_24","volume-title":"Graph Drawing","author":"F Wagner","year":"1998","unstructured":"Wagner, F., Wolff, A.: A combinatorial framework for map labeling. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 316\u2013331. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_24"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-32033-3_18","volume-title":"Term Rewriting and Applications","author":"R Yoshinaka","year":"2005","unstructured":"Yoshinaka, R.: Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 235\u2013249. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32033-3_18"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T15:56:25Z","timestamp":1619279785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","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":"100","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":"33","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":"7","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,1","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":"4,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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}