{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:11:30Z","timestamp":1743030690748,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-75242-2_14","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"202-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation"],"prefix":"10.1007","author":[{"given":"Louis","family":"Dublois","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0890-5401(03)00060-9","volume":"184","author":"EM Arkin","year":"2003","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.: The lazy bureaucrat scheduling problem. Inf. Comput. 184(1), 129\u2013146 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00060-9","journal-title":"Inf. Comput."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2019.10.005","volume":"280","author":"C Bazgan","year":"2019","unstructured":"Bazgan, C., Brankovic, L., Casel, K., Fernau, H.: Domination chain: characterisation, classical complexity, parameterised complexity and approximability. Discrete Appl. Math. 280, 23\u201342 (2019)","journal-title":"Discrete Appl. Math."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.05.042","volume":"717","author":"C Bazgan","year":"2018","unstructured":"Bazgan, C., et al.: The many facets of upper domination. Theor. Comput. Sci. 717, 2\u201325 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.042","journal-title":"Theor. Comput. Sci."},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Bonnet, E., Escoffier, B., Kim, E.J., Paschos, V.T.: On subexponential and FPT-time inapproximability. In: Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, 4\u20136 September 2013, Revised Selected Papers, pp. 54\u201365 (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_6","DOI":"10.1007\/978-3-319-03898-8_6"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Boria, N., Croce, F.D., Paschos, V.T.: On the max min vertex cover problem. In: Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, 5\u20136 September 2013, Revised Selected Papers, pp. 37\u201348 (2013). https:\/\/doi.org\/10.1007\/978-3-319-08001-7_4","DOI":"10.1007\/978-3-319-08001-7_4"},{"issue":"4\u20135","key":"14_CR6","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Croce, F.D., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4\u20135), 558\u2013572 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.01.003","journal-title":"Discret. Appl. Math."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October 2013, Berkeley, CA, USA, pp. 370\u2013379 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.47","DOI":"10.1109\/FOCS.2013.47"},{"issue":"8","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006). https:\/\/doi.org\/10.1016\/j.jcss.2006.04.007","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"GA Cheston","year":"1990","unstructured":"Cheston, G.A., Fricke, G., Hedetniemi, S.T., Jacobs, D.P.: On the computational complexity of upper fractional domination. Discret. Appl. Math. 27(3), 195\u2013207 (1990). https:\/\/doi.org\/10.1016\/0166-218X(90)90065-K","journal-title":"Discret. Appl. Math."},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"14_CR11","unstructured":"Dublois, L., Hanaka, T., Ghadikolaei, M.K., Lampis, M., Melissinos, N.: (In)approximability of maximum minimal FVS. CoRR abs\/2009.09971 (2020). https:\/\/arxiv.org\/abs\/2009.09971"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Eto, H., Hanaka, T., Kobayashi, Y., Kobayashi, Y.: Parameterized algorithms for maximum cut with connectivity constraints. In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, 11\u201313 September 2019, Munich, Germany, pp. 13:1\u201313:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.13","DOI":"10.4230\/LIPIcs.IPEC.2019.13"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","volume":"262","author":"F Furini","year":"2017","unstructured":"Furini, F., Ljubic, I., Sinnl, M.: An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262(2), 438\u2013448 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.03.061","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Gourv\u00e8s, L., Monnot, J., Pagourtzis, A.: The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. In: Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, 19\u201321 August 2013. Proceedings, pp. 171\u2013182 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40164-0_18","DOI":"10.1007\/978-3-642-40164-0_18"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: Approximating the minimum maximal independence number. Inf. Process. Lett. 46(4), 169\u2013172 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90022-2","journal-title":"Inf. Process. Lett."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.tcs.2019.09.025","volume":"796","author":"T Hanaka","year":"2019","unstructured":"Hanaka, T., Bodlaender, H.L., van der Zanden, T.C., Ono, H.: On the maximum weight minimal separator. Theor. Comput. Sci. 796, 294\u2013308 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.025","journal-title":"Theor. Comput. Sci."},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Hanaka, T., Katsikarelis, I., Lampis, M., Otachi, Y., Sikora, F.: Parameterized orientable deletion. In: Eppstein, D. (ed.) 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, 18\u201320 June 2018, Malm\u00f6, Sweden. LIPIcs, vol. 101, pp. 24:1\u201324:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2018.24","DOI":"10.4230\/LIPIcs.SWAT.2018.24"},{"key":"14_CR18","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, Pure and Applied Mathematics, vol.\u00a0208. Dekker, New York (1998)"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Hurink, J.L., Nieberg, T.: Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2), 155\u2013160 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2008.09.021","DOI":"10.1016\/j.ipl.2008.09.021"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-57586-5_29","volume-title":"Algorithms and Complexity","author":"L Jaffke","year":"2017","unstructured":"Jaffke, L., Jansen, B.M.P.: Fine-grained parameterized complexity analysis of graph coloring problems. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 345\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_29"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Katsikarelis, I., Lampis, M., Paschos, V.T.: Structural parameters, tight bounds, and approximation for (k, r)-center. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation, ISAAC 2017, 9\u201312 December 2017, Phuket, Thailand. LIPIcs, vol. 92, pp. 50:1\u201350:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.50","DOI":"10.4230\/LIPIcs.ISAAC.2017.50"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Katsikarelis, I., Lampis, M., Paschos, V.T.: Structurally parameterized d-scattered set. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, 27\u201329 June 2018, Proceedings. Lecture Notes in Computer Science, vol. 11159, pp. 292\u2013305. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_24","DOI":"10.1007\/978-3-030-00256-5_24"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Lampis, M.: Finer tight bounds for coloring on clique-width. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9\u201313 July 2018, Prague, Czech Republic. LIPIcs, vol. 107, pp. 86:1\u201386:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.86","DOI":"10.4230\/LIPIcs.ICALP.2018.86"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3170442","volume":"14","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. ACM Trans. Algorithms 14(2), 13:1\u201313:30 (2018). https:\/\/doi.org\/10.1145\/3170442","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Zehavi, M.: Maximum minimal vertex cover parameterized by vertex cover. In: Mathematical Foundations of Computer Science 2015\u201340th International Symposium, MFCS 2015, Milan, Italy, 24\u201328 August 2015, Proceedings, Part II. pp. 589\u2013600 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_49","DOI":"10.1007\/978-3-662-48054-0_49"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:26:02Z","timestamp":1620141962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_14","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":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"35% - 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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}