{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:22Z","timestamp":1725574102263},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_54","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:28:22Z","timestamp":1294421302000},"page":"509-518","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Cycle Length Modularity Problems in Graphs"],"prefix":"10.1007","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Holger","family":"Spakowski","sequence":"additional","affiliation":[]},{"given":"Mayur","family":"Thakur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","series-title":"Undergraduate Texts in Mathematics","volume-title":"Introduction to Analytic Number Theory","author":"T. Apostol","year":"1976","unstructured":"Apostol, T.: Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics. Springer, Heidelberg (1976)"},{"issue":"2","key":"54_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/103516.103517","volume":"38","author":"E. Arkin","year":"1991","unstructured":"Arkin, E., Papadimitriou, C., Yannakakis, M.: Modularity of cycles and paths in graphs. Journal of the ACM\u00a038(2), 255\u2013274 (1991)","journal-title":"Journal of the ACM"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0012-365X(73)90166-0","volume":"4","author":"Y. Balcer","year":"1973","unstructured":"Balcer, Y., Veinott, A.: Computing a graph\u2019s period quadratically by node condensation. Discrete Mathematics\u00a04, 295\u2013303 (1973)","journal-title":"Discrete Mathematics"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P. Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., P\u00f3sa, L.: On independent circuits contained in a graph. Canadian Journal on Mathematics\u00a017, 347\u2013352 (1965)","journal-title":"Canadian Journal on Mathematics"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1996.0036","volume":"21","author":"A. Galluccio","year":"1996","unstructured":"Galluccio, A., Loebl, M.: Cycles of prescribed modularity in planar digraphs. Journal of Algorithms\u00a021, 51\u201370 (1996)","journal-title":"Journal of Algorithms"},{"key":"54_CR7","first-page":"43","volume-title":"Graph Theory and Theoretical Physics","author":"P. Kasteleyn","year":"1967","unstructured":"Kasteleyn, P.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43\u2013110. Academic Press, New York (1967)"},{"key":"54_CR8","unstructured":"Knuth, D.: Strong components. Technical Report 004639, Computer Science Department, Stanford University, Stanford, California (1973)"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"McCuaig, W., Robertson, N., Seymour, P., Thomas, R.: Permanents, pfaffian orientations, and even directed circuits. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 402\u2013405 (1997)","DOI":"10.1145\/258533.258625"},{"issue":"3","key":"54_CR10","first-page":"271","volume":"20","author":"G. Polya","year":"1913","unstructured":"Polya, G.: Aufgabe 424. Arch. Math. Phys.\u00a020(3), 271 (1913)","journal-title":"Arch. Math. Phys."},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1017\/CBO9781107325678.009","volume-title":"Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.: Graph minors\u2014a survey. In: Anderson, I. (ed.) Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference, pp. 153\u2013171. Cambridge University Press, Cambridge (1985)"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"N. Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Permanents, pfaffian orientations, and even directed circuits. Annals of Mathematics\u00a0150, 929\u2013975 (1999)","journal-title":"Annals of Mathematics"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"2","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth first search and linear graph algorithms. SIAM Journal on Computing\u00a02, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"54_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C.: On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory\u00a012(1), 101\u2013111 (1988)","journal-title":"Journal of Graph Theory"},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0166-218X(89)90053-X","volume":"25","author":"V. Vazirani","year":"1989","unstructured":"Vazirani, V., Yannakakis, M.: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discrete Applied Mathematics\u00a025, 179\u2013190 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"54_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/S0895480194274133","volume":"10","author":"R. Yuster","year":"1997","unstructured":"Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM Journal on Discrete Mathematics\u00a010(2), 209\u2013222 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:57:06Z","timestamp":1559915826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}