{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:27Z","timestamp":1761611067183},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0166-218x(96)00074-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"27-34","source":"Crossref","is-referenced-by-count":6,"title":["A linear-time algorithm for computing the intersection of all odd cycles in a graph"],"prefix":"10.1016","volume":"73","author":[{"given":"Leizhen","family":"Cai","sequence":"first","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00074-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB2","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1142\/S0129054194000049","article-title":"On disjoint cycles","volume":"5","author":"Bodlaender","year":"1994","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00074-1_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","article-title":"Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties","volume":"58","author":"Cai","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00074-1_BIB6","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-Parameter Tractability and Completeness, I: Basic Results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00074-1_BIB7","series-title":"Computers and Intractability : A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00074-1_BIB9","series-title":"Proceedings 35th IEEE Symp. on Foundations of Computer Science","first-page":"780","article-title":"Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping","author":"Kaplan","year":"1994"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(96)00074-1_BIB11","series-title":"Proceedings 10th ACM Symp. on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:17Z","timestamp":1556130497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0166218X96000741"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00074-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}