{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:18:36Z","timestamp":1743045516265,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_38","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"378-387","source":"Crossref","is-referenced-by-count":1,"title":["On Finding Small 2-Generating Sets"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Fagnot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"38_CR2","first-page":"49","volume":"11","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences\u00a011, 49\u201357 (1995)","journal-title":"Computer Applications in the Biosciences"},{"doi-asserted-by":"crossref","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, Word, language, grammar, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)","key":"38_CR3","DOI":"10.1007\/978-3-642-59136-5_6"},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ipl.2006.08.007","volume":"101","author":"M.J. Collins","year":"2007","unstructured":"Collins, M.J., Kempe, D., Saia, J., Young, M.: Nonnegative integral subset representations of integer sets. Information Processing Letters\u00a0101(3), 129\u2013133 (2007)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory, 2nd edn. Graduate texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","key":"38_CR5","DOI":"10.1007\/978-3-662-53622-3_7"},{"doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized complexity. Springer, Heidelberg (1999)","key":"38_CR6","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"38_CR7","first-page":"65","volume":"147","author":"M.A. Fitch","year":"2000","unstructured":"Fitch, M.A., Jamison, R.E.: Minimum sum covers of small cyclic groups. Congressus Numerantium\u00a0147, 65\u201381 (2000)","journal-title":"Congressus Numerantium"},{"unstructured":"Gy\u00e1rf\u00e1s, A.: Combinatorics of intervals, preliminary version. In: Institute for Mathematics and its Applications (IMA) Summer Workshop on Combinatorics and Its Applications (2003), \n                    \n                      http:\/\/www.math.gatech.edu\/news\/events\/ima\/newag.pdf","key":"38_CR8"},{"unstructured":"Haanp\u00e4\u00e4, H.: Minimum sum and difference covers of abelian groups. Journal of Integer Sequences 7(2), article 04.2.6 (2004)","key":"38_CR9"},{"issue":"1-2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(03)00273-7","volume":"138","author":"H. Haanp\u00e4\u00e4","year":"2004","unstructured":"Haanp\u00e4\u00e4, H., Huima, A., \u00d6sterg\u00e5rd, P.R.J.: Sets in \u2124\n                    n\n                   with distinct sums of pairs. Discrete Applied Mathematics\u00a0138(1-2), 99\u2013106 (2004)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Jain, K., Lau, L., Russell, A., Mandoiu, I., Vazirani, V.: Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03994, pp. 758\u2013766. Springer, Heidelberg (2006)","key":"38_CR11","DOI":"10.1007\/11758525_102"},{"doi-asserted-by":"crossref","unstructured":"Hermelin, D., Rawitz, D., Rizzi, R., Vialette, S.: The minimum substring cover problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 170\u2013183. Springer, Heidelberg (2008)","key":"38_CR12","DOI":"10.1007\/978-3-540-77918-6_14"},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/aa-6-1-11-13","volume":"6","author":"L. Moser","year":"1960","unstructured":"Moser, L.: On the representation of 1, 2, ..., n by sums. Acta Arithmetica\u00a06, 11\u201313 (1960)","journal-title":"Acta Arithmetica"},{"issue":"5","key":"38_CR14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1051\/ita\/1990240504591","volume":"24","author":"J. N\u00e9raud","year":"1990","unstructured":"N\u00e9raud, J.: Elementariness of a finite set of words is coNP-complete. Theoretical Informatics and Applications\u00a024(5), 459\u2013470 (1990)","journal-title":"Theoretical Informatics and Applications"},{"doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed parameter algorithms. Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)","key":"38_CR15","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)","key":"38_CR16"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","key":"38_CR17","DOI":"10.1016\/0022-0000(91)90023-X"},{"doi-asserted-by":"crossref","unstructured":"Swanson, C.N.: Planar cyclic difference packings. Journal of Combinatorial Designs\u00a08, 426\u2013434 (2000)","key":"38_CR18","DOI":"10.1002\/1520-6610(2000)8:6<426::AID-JCD5>3.0.CO;2-4"},{"unstructured":"Wiedemann, D.: Cyclic difference covers through 133. Congressus Numerantium\u00a090, 181\u2013185 (1992)","key":"38_CR19"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:11:06Z","timestamp":1558267866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}