{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T01:18:21Z","timestamp":1760577501284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_6","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"62-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Advice Complexity Bounds for\u00a0Online Delayed $$\\mathcal{F}$$-Node-, H-Node- and H-Edge-Deletion Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7938-526X","authenticated-orcid":false,"given":"Niklas","family":"Berndt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-8831","authenticated-orcid":false,"given":"Henri","family":"Lotze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Ahmadian, S., Esfandiari, H., Mirrokni, V.S., Peng, B.: Robust load balancing with machine learned advice. In: Naor, J.S., Buchbinder, N. (eds.) Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference \/ Alexandria, 9 January\u201312 January 2022, pp. 20\u201334. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.2","DOI":"10.1137\/1.9781611977073.2"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Berndt, N., Lotze, H.: Advice complexity bounds for online delayed $$\\cal{F} $$-node-, $$H$$-node- and $$H$$-edge-deletion problems. CoRR abs\/2303.17346 (2023)","DOI":"10.1007\/978-3-031-34347-6_6"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcss.2017.01.001","volume":"86","author":"H B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the $$k$$-server problem. J. Comput. Syst. Sci. 86, 159\u2013170 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.01.001","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ic.2017.03.001","volume":"254","author":"H B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Online algorithms with advice: the tape model. Inf. Comput. 254, 59\u201383 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.03.001","journal-title":"Inf. Comput."},{"key":"6_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbc\u00edk, M., Larsen, K.S.: Online dominating set. In: Pagh, R. (ed.) 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22\u201324, 2016, Reykjavik, Iceland. LIPIcs, vol. 53, pp. 21:1\u201321:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2016.21","DOI":"10.4230\/LIPIcs.SWAT.2016.21"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-62127-2_19","volume-title":"Algorithms and Data Structures","author":"J Boyar","year":"2017","unstructured":"Boyar, J., Favrholdt, L.M., Kotrb\u010d\u00edk, M., Larsen, K.S.: Relaxing the irrevocability requirement for online graph algorithms. In: WADS 2017. LNCS, vol. 10389, pp. 217\u2013228. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_19"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. ACM Comput. Surv. 50(2), 19:1\u201319:34 (2017). https:\/\/doi.org\/10.1145\/3056461","DOI":"10.1145\/3056461"},{"issue":"9","key":"6_CR9","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1007\/s00453-021-00840-9","volume":"83","author":"L-H Chen","year":"2021","unstructured":"Chen, L.-H., Hung, L.-J., Lotze, H., Rossmanith, P.: Online node- and edge-deletion problems with advice. Algorithmica 83(9), 2719\u20132753 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00840-9","journal-title":"Algorithmica"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1051\/ita\/2009012","volume":"43","author":"S Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Measuring the problem-relevant information in input. ITA 43(3), 585\u2013613 (2009). https:\/\/doi.org\/10.1051\/ita\/2009012","journal-title":"ITA"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-15155-2_3","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Hromkovi\u010d","year":"2010","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information complexity of online problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24\u201336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_3"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Komm, D.: An Introduction to Online Computation - Determinism, Randomization Advice. Texts in Theoretical Computer Science. An EATCS Series. Springer, Switzerland (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2","DOI":"10.1007\/978-3-319-42749-2"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Megow, N.: Permutation predictions for non-clairvoyant scheduling. In: Agrawal, K., Lee, I.A. (eds.) SPAA 2022: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11\u201314, 2022, pp. 357\u2013368. ACM (2022). https:\/\/doi.org\/10.1145\/3490148.3538579","DOI":"10.1145\/3490148.3538579"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Megow, N., Simon, B.: Double coverage with machine-learned advice. In: Braverman, M. (ed.) 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA. LIPIcs, vol. 215, pp. 99:1\u201399:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.99","DOI":"10.4230\/LIPIcs.ITCS.2022.99"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Lykouris, T., Vassilvitskii, S.: Competitive caching with machine learned advice. J. ACM 68(4), 24:1\u201324:25 (2021). https:\/\/doi.org\/10.1145\/3447579","DOI":"10.1145\/3447579"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update rules. In: DeMillo, R.A. (ed.) Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 30 April\u20132 May 1984, Washington, pp. 488\u2013492. ACM (1984). https:\/\/doi.org\/10.1145\/800057.808718","DOI":"10.1145\/800057.808718"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:07:36Z","timestamp":1712758056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"86","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":"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":"38% - 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.04","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":"5.69","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)"}}]}}