{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:22Z","timestamp":1760441062795},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T00:00:00Z","timestamp":1325030400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00453-011-9608-0","type":"journal-article","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T15:14:14Z","timestamp":1324998854000},"page":"517-544","source":"Crossref","is-referenced-by-count":13,"title":["The Parameterized Complexity of Unique Coverage and Its Variants"],"prefix":"10.1007","volume":"65","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,28]]},"reference":[{"key":"9608_CR1","series-title":"Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)"},{"issue":"4","key":"9608_CR2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"9608_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.jcta.2003.08.001","volume":"104","author":"N. Alon","year":"2003","unstructured":"Alon, N., Cohen, G., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. J. Comb. Theory, Ser. A 104(1), 207\u2013215 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9608_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9608_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property: the case of multiple parents. SIAM J. Discrete Math. 14(3), 423\u2013431 (2001)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"9608_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","volume":"81","author":"M. Cesati","year":"2002","unstructured":"Cesati, M.: Perfect Code is W[1]-complete. Inf. Process. Lett. 81(3), 163\u2013168 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"9608_CR7","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J. Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., M\u00f6lle, D., Richter, S., Rossmanith, P., Sze, S.-H., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9608_CR8","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput."},{"key":"9608_CR9","series-title":"LNCS","volume-title":"Proceedings of 36th International Colloquium of Automata, Languages and Programming (ICALP 2009)","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Proceedings of 36th International Colloquium of Automata, Languages and Programming (ICALP 2009). LNCS, vol. 5555. Springer, Berlin (2009)"},{"key":"9608_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"9608_CR11","first-page":"1267","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)","author":"T. Erlebach","year":"2008","unstructured":"Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1267\u20131276 (2008)"},{"key":"9608_CR12","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"9608_CR13","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1981)"},{"key":"9608_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. Springer, Berlin (2001)"},{"issue":"1","key":"9608_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The Budgeted Maximum Coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"9608_CR16","first-page":"170","volume-title":"Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"K. Mehlhorn","year":"1982","unstructured":"Mehlhorn, K.: On the program size of perfect and universal hash functions. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 170\u2013175. IEEE, New York (1982)"},{"key":"9608_CR17","series-title":"LNCS","first-page":"310","volume-title":"Proceedings of the 4th Computer Science Symposium in Russia (CSR 2009)","author":"N. Misra","year":"2009","unstructured":"Misra, N., Raman, V., Saurabh, S., Sikdar, S.: Budgeted unique coverage and color-coding. In: Proceedings of the 4th Computer Science Symposium in Russia (CSR 2009). LNCS, vol.\u00a05675, pp.\u00a0310\u2013321. Springer, Berlin (2009)"},{"key":"9608_CR18","first-page":"621","volume-title":"Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2007)","author":"H. Moser","year":"2007","unstructured":"Moser, H., Raman, V., Sikdar, S.: The parameterized complexity of the Unique Coverage problem. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2007), vol.\u00a04835, pp. 621\u2013631 (2007)"},{"key":"9608_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"9608_CR20","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"5","key":"9608_CR21","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J. Schmidt","year":"1990","unstructured":"Schmidt, J., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 19(5), 775\u2013786 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9608-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9608-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9608-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:09Z","timestamp":1559137509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9608-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,28]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9608"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9608-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,28]]}}}