{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:55:11Z","timestamp":1649141711072},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00453-021-00867-y","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T17:04:03Z","timestamp":1629479043000},"page":"3567-3601","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of Small Weight Automorphisms and Isomorphisms"],"prefix":"10.1007","volume":"83","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Kuhnert","sequence":"additional","affiliation":[]},{"given":"Jacobo","family":"Tor\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"867_CR1","doi-asserted-by":"publisher","unstructured":"Arvind, V., K\u00f6bler, J., Kuhnert, S., Tor\u00e1n, J.: Parameterized complexity of small weight automorphisms. In: Proceedings of 34th STACS, Dagstuhl, pp. 7:1\u20137:13 (2017). Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.7","DOI":"10.4230\/LIPIcs.STACS.2017.7"},{"key":"867_CR2","unstructured":"Arvind, V., K\u00f6bler, J., Kuhnert, S., Tor\u00e1n, J.: Finding small weight isomorphisms with additional constraints is fixed parameter tractable. In: Proceedings of 12 IPEC Symposium, pp. 2:1\u20132:13. LIPIcs 89 (2017)"},{"issue":"6","key":"867_CR3","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757\u20131766 (1997). https:\/\/doi.org\/10.1109\/18.641542","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"867_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I Dumer","year":"2003","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1), 22\u201337 (2003). https:\/\/doi.org\/10.1109\/TIT.2002.806118","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"867_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29(2), 545\u2013570 (1999). https:\/\/doi.org\/10.1137\/S0097539797323571","journal-title":"SIAM J. Comput."},{"issue":"2","key":"867_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s00453-015-0098-3","volume":"75","author":"V Arvind","year":"2016","unstructured":"Arvind, V., K\u00f6bler, J., Kuhnert, S., Tor\u00e1n, J.: Solving linear equations parameterized by Hamming weight. Algorithmica 75(2), 322\u2013338 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0098-3","journal-title":"Algorithmica"},{"key":"867_CR7","unstructured":"Bhattacharyya, A., Ghoshal, S., Karthik, C.S., Manurangsi, P.: Parameterized intractability of even set and shortest vector problem from gap-ETH. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, pp. 17:1\u201317:15 (2018)"},{"issue":"3","key":"867_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3444942","volume":"68","author":"A Bhattacharyya","year":"2021","unstructured":"Bhattacharyya, A., Bonnet, E., Egri, L., Ghoshal, S., Karthik, C.S., Lin, B., Manurangsi, P., Marx, D.: Parameterized intractability of even set and shortest vector problem. J. ACM 68(3), 1\u201340 (2021)","journal-title":"J. ACM"},{"key":"867_CR9","doi-asserted-by":"publisher","unstructured":"Schweitzer, P.: Isomorphism of (mis)labeled graphs. In: Proceedings of 19th ESA, pp. 370\u2013381. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_32","DOI":"10.1007\/978-3-642-23719-5_32"},{"key":"867_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, Berlin (1996)"},{"key":"867_CR11","first-page":"173","volume":"23","author":"M Deza","year":"1998","unstructured":"Deza, M., Huang, T.: Metrics on permutations, a survey. J. Combin. Inform. Syst. Sci. 23, 173\u2013185 (1998)","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"867_CR12","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"867_CR13","doi-asserted-by":"publisher","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, 844\u2013856 (1995). https:\/\/doi.org\/10.1145\/210332.210337","journal-title":"J. ACM"},{"key":"867_CR14","doi-asserted-by":"publisher","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with $$O(1)$$ worst case access time. J. ACM 31(3), 538\u2013544 (1984). https:\/\/doi.org\/10.1145\/828.1884","DOI":"10.1145\/828.1884"},{"issue":"3","key":"867_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R Mathon","year":"1979","unstructured":"Mathon, R.: A note on the Graph Isomorphism counting problem. Inf. Process. Lett. 8(3), 131\u2013132 (1979)","journal-title":"Inf. Process. Lett."},{"key":"867_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science","author":"J K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkh\u00e4user\/Springer, Berlin (1993)"},{"key":"867_CR17","first-page":"169","volume-title":"Computational Problems in Abstract Algebra","author":"CC Sims","year":"1970","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169\u2013183. Pergamon Press, Oxford (1970)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00867-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00867-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00867-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T11:38:19Z","timestamp":1637321899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00867-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,20]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["867"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00867-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,20]]},"assertion":[{"value":"5 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}