{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:41Z","timestamp":1759335521009},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_11","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"101-109","source":"Crossref","is-referenced-by-count":4,"title":["Mod-2 Independence and Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"29","author":"E. Berlekamp","year":"1978","unstructured":"E. Berlekamp, R.J. McEliece and H.C.A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory. Vol.29, No.3, 1978, 384\u2013386. 106","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR2","unstructured":"M. Halld\u00f3rsson, unpublished. 101"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"M. Halld\u00f3rsson, J. Kratochv\u2019il and J.A. Telle, Independent sets with domination constraints, Proceedings ICALP\u201998-25th International Colloquium on Automata, Languages and Programming, Aalborg, Denmark, July 1998, LNCS vol. 1443, 176\u2013187 101, 109","DOI":"10.1007\/BFb0055051"},{"key":"11_CR4","unstructured":"M. Mahajan and V. Vinay, Determinant: combinatorics, algorithms, complexity, Chicago Journal of Theoretical Computer Science, 1997:5, 1997. Preliminary version SODA\u201997."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"M. Mahajan and V. Vinay, Determinant: Old Algorithms, New Insights, in Proceedings SWAT\u201998-6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 1998, LNCS Vol. 1432, 276\u2013287. 102","DOI":"10.1007\/BFb0054375"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TIT.1981.1056419","volume":"27","author":"S.C. Ntafos","year":"1981","unstructured":"S.C. Ntafos and S.L. Hakimi, On the complexity of some coding problems, IEEE Trans. Inform. Theory, Vol. 27, 1981, 794\u2013796. 106","journal-title":"IEEE Trans. Inform. Theory,"},{"key":"11_CR7","first-page":"9","volume":"94","author":"J.A. Telle","year":"1993","unstructured":"J.A. Telle, Characterization of domination-type parameters in graphs, Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing-Congressus Numerantium Vol.94 1993, 9\u201316. 101","journal-title":"Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing-Congressus Numerantium"},{"key":"11_CR8","first-page":"157","volume":"1","author":"J.A. Telle","year":"1994","unstructured":"J.A. Telle, Complexity of domination-type problems in graphs, Nordic Journal of Computing 1(1994), 157\u2013171. 109","journal-title":"Nordic Journal of Computing"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory. Vol.43 No. 6, 1997, 1757\u20131766. Preliminary version STOC\u201997. 106","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:18Z","timestamp":1556321898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}