{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:58:40Z","timestamp":1743105520930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_13","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"175-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Independent Sets in Interval and Segment Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Barun","family":"Gorain","sequence":"first","affiliation":[]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"5\u20136","key":"13_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. Distrib. Comput. 22(5\u20136), 363\u2013379 (2010)","journal-title":"Distrib. Comput."},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2027216.2027221","volume":"58","author":"L Barenboim","year":"2011","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23:1\u201323:25 (2011)","journal-title":"J. ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, M.H., Halld\u00f3rsson, M.M., Konrad, C., Kuhn, F.: Brief announcement: local independent set approximation. In: PODC, pp. 93\u201395 (2016)","DOI":"10.1145\/2933057.2933068"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-87779-0_6","volume-title":"Distributed Computing","author":"A Czygrinow","year":"2008","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 78\u201392. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_6"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Fischer, M., Noever, A.: Tight analysis of parallel randomized greedy MIS. In: SODA, pp. 2152\u20132160 (2018)","DOI":"10.1137\/1.9781611975031.140"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: SODA, pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-48653-5_37","volume-title":"Distributed Computing","author":"MM Halld\u00f3rsson","year":"2015","unstructured":"Halld\u00f3rsson, M.M., Konrad, C.: Distributed large independent sets in one round on bounded-independence graphs. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 559\u2013572. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_37"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273\u2013287. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561927_21"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2742012","volume":"63","author":"F Kuhn","year":"2016","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1\u201317:44 (2016)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: STOC, pp. 1\u201310 (1985)","DOI":"10.1145\/22145.22146"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jpdc.2019.05.012","volume":"132","author":"AR Molla","year":"2019","unstructured":"Molla, A.R., Pandit, S., Roy, S.: Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distrib. Comput. 132, 36\u201347 (2019)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jagm.1996.0017","volume":"20","author":"A Panconesi","year":"1996","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356\u2013374 (1996)","journal-title":"J. Algorithms"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Rozhon, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. CoRR abs\/1907.10937 (2019)","DOI":"10.1145\/3357713.3384298"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J Schneider","year":"2010","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22(5), 349\u2013361 (2010)","journal-title":"Distrib. Comput."}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:02:14Z","timestamp":1619301734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_13","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)"}}]}}