{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T11:04:45Z","timestamp":1780484685916,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,11]],"date-time":"2015-08-11T00:00:00Z","timestamp":1439251200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00453-015-0045-3","type":"journal-article","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T10:14:11Z","timestamp":1439201651000},"page":"363-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree"],"prefix":"10.1007","volume":"75","author":[{"given":"Jannis","family":"Bulian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the 15th annual ACM symposium on theory of computing, ACM, pp.\u00a0171\u2013183 (1983)","DOI":"10.1145\/800061.808746"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Bouland, A., Dawar, A., Kopczy\u0144ski, E.: On tractable parameterizations of graph isomorphism. In: Parameterized and Exact Computation, pp. 218\u2013230. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33293-7_21"},{"key":"45_CR3","volume-title":"Graph Theory","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2000)"},{"key":"45_CR4","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (2012)"},{"issue":"3","key":"45_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s004930050059","volume":"19","author":"S Evdokimov","year":"1999","unstructured":"Evdokimov, S., Ponomarenko, I.: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks. Combinatorica 19(3), 321\u2013333 (1999)","journal-title":"Combinatorica"},{"issue":"6","key":"45_CR6","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1016\/j.jcss.2010.12.001","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter\u2019s local optimization theorem. J. Comput. Syst. Sci. 77(6), 1141\u20131158 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Proceedings of the 19th international symposium on algorithms and computation, pp.\u00a0294\u2013305 (2008)","DOI":"10.1007\/978-3-540-92182-0_28"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: Proceedings of the 12th annual ACM symposium on theory of computing, ACM, pp.\u00a0236\u2013243 (1980)","DOI":"10.1145\/800141.804671"},{"key":"45_CR9","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: Proceedings of the 44th annual ACM symposium on theory of computing, pp.\u00a0173\u2013192 (2012)","DOI":"10.1145\/2213977.2213996"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Parameterized and Exact Computation, pp. 162\u2013173. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-28639-4_15"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Schweitzer, P.: Isomorphism for graphs of bounded feedback vertex set number. In: Proceedings of the 12th Scandinavian conference on algorithm theory, pp.\u00a081\u201392. Springer (2010)","DOI":"10.1007\/978-3-642-13731-0_9"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization (extended abstract). In: Proceedings of the 24th annual ACM symposium on theory of computing, ACM (1992)","DOI":"10.1145\/129712.129750"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: 55th IEEE annual symposium on foundations of computer science, pp.\u00a0186\u2013195 (2014)","DOI":"10.1109\/FOCS.2014.28"},{"issue":"1","key":"45_CR15","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the 12th annual ACM symposium on theory of computing, ACM, pp.\u00a0218\u2013224 (1980)","DOI":"10.1145\/800141.804670"},{"key":"45_CR17","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 University Press, Oxford (2006)"},{"issue":"2","key":"45_CR18","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1007\/BF01098279","volume":"55","author":"IN Ponomarenko","year":"1991","unstructured":"Ponomarenko, I.N.: The isomorphism problem for classes of graphs closed under contraction. J. Sov. Math. 55(2), 1621\u20131643 (1991)","journal-title":"J. Sov. Math."},{"issue":"8","key":"45_CR19","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1093\/ietisy\/e89-d.8.2388","volume":"E89\u2013D","author":"S Toda","year":"2006","unstructured":"Toda, S.: Computing automorphism groups of chordal graphs whose simplicial components are of small size. IEICE Trans. Inf. Syst. E89\u2013D(8), 2388\u20132401 (2006)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"45_CR20","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.dam.2004.06.008","volume":"145","author":"R Uehara","year":"2005","unstructured":"Uehara, R., Toda, S., Nagoya, T.: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Appl. Math. 145(3), 479\u2013482 (2005)","journal-title":"Discrete Appl. Math."},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Yamazaki, K., Bodlaender, H.L., De\u00a0Fluiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. In: Italian\/International conference on algorithms and complexity, pp.\u00a0276\u2013287. Springer (1997)","DOI":"10.1007\/3-540-62592-5_79"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0045-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0045-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0045-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T14:15:49Z","timestamp":1551190549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0045-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0045-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,11]]}}}