{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:45:56Z","timestamp":1743115556746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_12","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Saving Probe Bits by Cube Domination"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ipl.2015.01.007","volume":"115","author":"GR Argiroffo","year":"2015","unstructured":"Argiroffo, G.R., Leoni, V., Torres, P.: On the complexity of k-domination and k-tuple domination in graphs. Info. Proc. Lett. 115, 556\u2013561 (2015)","journal-title":"Info. Proc. Lett."},{"key":"12_CR2","first-page":"31","volume":"65","author":"S Arumugam","year":"1998","unstructured":"Arumugam, S., Kala, R.: Domination parameters of hypercubes. J. Indian Math. Soc. 65, 31\u201338 (1998)","journal-title":"J. Indian Math. Soc."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Azarija, J., Henning, M.A., Klavzar, S.: (Total) domination in prisms. Electron. J. Combin. 24, paper 1.19 (2017)","DOI":"10.37236\/6288"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1137\/S0097539702405292","volume":"31","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31, 1723\u20131744 (2002)","journal-title":"SIAM J. Comput."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Carter, L., Floyd, R.W., Gill, J., Markowsky, G., Wegman, M.N.: Exact and approximate membership testers. In: Lipton, R.J., et al. (eds.) STOC 1978, pp. 59\u201365. ACM (1978)","DOI":"10.1145\/800133.804332"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than bloom. In: Seneviratne, A., et al. (eds.) CoNEXT 2014, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"F\u00f6rster, K.T.: Approximating fault-tolerant domination in general graphs. In: Nebel, M.E., Szpankowski, W. (eds.) ANALCO 2013, pp. 25\u201332. SIAM (2013)","DOI":"10.1137\/1.9781611973037.4"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Garg, M., Radhakrishnan, J.: Set membership with a few bit probes. In: Indyk, P. (ed.) SODA 2015, pp. 776\u2013784. ACM-SIAM (2015)","DOI":"10.1137\/1.9781611973730.53"},{"key":"12_CR9","unstructured":"Garg, M., Radhakrishnan, J.: Set membership with non-adaptive bit probes. In: Vollmer, H., Vall\u00e9e, B. (eds.) STACS 2017. LIPIcs, vol. 66, paper 38, Dagstuhl (2017)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0893-9659(93)90027-K","volume":"6","author":"F Harary","year":"1993","unstructured":"Harary, F., Livingston, M.: Independent domination in hypercubes. Appl. Math. Lett. 6, 27\u201328 (1993)","journal-title":"Appl. Math. Lett."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Info. Proc. Lett. 89, 75\u201383 (2004)","journal-title":"Info. Proc. Lett."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2013.12.005","volume":"114","author":"S Klavzar","year":"2014","unstructured":"Klavzar, S., Ma, M.: The domination number of exchanged hypercubes. Info. Proc. Lett. 114, 159\u2013162 (2014)","journal-title":"Info. Proc. Lett."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-662-44777-2_52","volume-title":"Algorithms - ESA 2014","author":"M Lewenstein","year":"2014","unstructured":"Lewenstein, M., Munro, J.I., Nicholson, P.K., Raman, V.: Improved explicit data structures in the Bitprobe model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 630\u2013641. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_52"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"2556","DOI":"10.1109\/18.945268","volume":"47","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P.R.J., Blass, U.: On the size of optimal binary codes of length $$9$$ and covering radius 1. IEEE Trans. Inform. Theory 47, 2556\u20132557 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Pagh, R.: On the cell probe complexity of membership and perfect hashing. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) STOC 2001, pp. 425\u2013432. ACM (2001)","DOI":"10.1145\/380752.380836"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications encoding k-ary trees, prefix sums and multisets. ACM Trans. Algor. 3, paper 43 (2007)","DOI":"10.1145\/1290672.1290680"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1109\/18.2632","volume":"34","author":"GJM van Wee","year":"1988","unstructured":"van Wee, G.J.M.: Improved sphere bounds on the covering radius of codes. IEEE Trans. Inform. Theory 34, 237\u2013245 (1988)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:45Z","timestamp":1710336285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"45% - 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":"4","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":"11,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)"}}]}}