{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:37:22Z","timestamp":1733377042656,"version":"3.30.1"},"reference-count":74,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":4549,"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":[[2001,2]]},"DOI":"10.1016\/s0166-218x(00)00221-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:17:26Z","timestamp":1027621046000},"page":"23-52","source":"Crossref","is-referenced-by-count":131,"title":["On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic"],"prefix":"10.1016","volume":"108","author":[{"given":"B.","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"J.A.","family":"Makowsky","sequence":"additional","affiliation":[]},{"given":"U.","family":"Rotics","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00221-3_BIB1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0608024","article-title":"Complexity of finding embedding in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0166-218X(99)00140-7","article-title":"Recognition and isomorphism of tree-like P4-connected graphs","volume":"99","author":"Babel","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB4","series-title":"Graph Theoretic Concepts in Computer Science, 21th International Workshop, WG\u201995","first-page":"24","article-title":"On the isomorphism of graphs with few P4s","volume":"Vol. 1017","author":"Babel","year":"1995"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0166-218X(99)00062-1","article-title":"On the p-connectedness of graphs \u2014 a survey","volume":"95","author":"Babel","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/moor.21.1.65","article-title":"Two algorithmic results for the traveling salesman problem","volume":"21","author":"Barvinok","year":"1996","journal-title":"Math. Oper. Res."},{"year":"1998","series-title":"Complexity and Real Computation","author":"Blum","key":"10.1016\/S0166-218X(00)00221-3_BIB7"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB8","first-page":"1","article-title":"A tourist guide through tree width","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB9","series-title":"Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS\u201997","first-page":"29","article-title":"Treewidth: algorithmic techniques and results","volume":"Vol. 1295","author":"Bodlaender","year":"1997"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded tree width (tutorial)","volume":"208","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB11","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Approximating treewidth, pathwidth, and minimum elimination tree height","volume":"18","author":"Bodlaender","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB12","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","article-title":"Efficient and constructive algorithms for the pathwidth and treewidth of graphs","volume":"21","author":"Bodlaender","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB13","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"year":"1999","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/S0166-218X(00)00221-3_BIB14"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1017\/S0963548398003447","article-title":"A Tutte polynomial for coloured graphs","volume":"8","author":"Bollob\u00e1s","year":"1999","journal-title":"Combin. Probab Comput."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB16","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser, Completeness and Reduction in Algebraic Complexity Theory, Algorithms and Computations in Mathematics, Vol. 7, Springer, Berlin, 2000. Expanded version of the Habilitationsschrift with the same title, Universit\u00e4t Z\u00fcrich, 1998.","DOI":"10.1007\/978-3-662-04179-6_2"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB17","series-title":"Algebraic Complexity Theory","volume":"Vol. 315","author":"B\u00fcrgisser","year":"1997"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1006\/jcss.1996.0069","article-title":"Logical definability of counting functions","volume":"53","author":"Compton","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB19","doi-asserted-by":"crossref","unstructured":"D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width \u2a7d 3 graphs, Extended abstract, LATIN\u20192000, August 1999, to appear.","DOI":"10.1007\/10719839_14"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","article-title":"Monadic second order graph transductions: a survey","volume":"126","author":"Courcelle","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB22","doi-asserted-by":"crossref","unstructured":"B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1: Foundations, World Scientific, Singapore, 1997, pp. 313\u2013400 (Chapter 5).","DOI":"10.1142\/9789812384720_0005"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB23","unstructured":"B. Courcelle, The monadic second order logic of graphs, XIV: uniformly sparse graphs and edge set quantification, submitted for publication, cf. http:\/\/dept-info.labri.u-bordeaux.fr\/\u223ccourcell\/ActSci.html, 1999."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB24","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01204169","article-title":"A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars","volume":"28","author":"Courcelle","year":"1995","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB25","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB26","unstructured":"B. Courcelle, J.A. Makowsky, Operations on relational structures and their compatibility with monadic second order logic, Math. Struct. Comput. Sci. xx (2000) xx\u2013yy."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB27","series-title":"Graph Theoretic Concepts in Computer Science, 24th International Workshop, WG\u201998","first-page":"1","article-title":"Linear time solvable optimization problems on graph of bounded clique width, extended abstract","volume":"Vol. 1517","author":"Courcelle","year":"1998"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"linear time solvable optimization problems on graphs of bounded clique-width","volume":"33.2","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluations on tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique-width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discrete Appl. Math."},{"year":"1990","series-title":"Graph Decompositions","author":"Diestel","key":"10.1016\/S0166-218X(00)00221-3_BIB31"},{"year":"1996","series-title":"Graph Theory","author":"Diestel","key":"10.1016\/S0166-218X(00)00221-3_BIB32"},{"year":"1999","series-title":"Parametrized Complexity","author":"Downey","key":"10.1016\/S0166-218X(00)00221-3_BIB33"},{"year":"1995","series-title":"Finite Model Theory","author":"Ebbinghaus","key":"10.1016\/S0166-218X(00)00221-3_BIB34"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB35","doi-asserted-by":"crossref","unstructured":"T. Feder, M. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction, STOC\u201993, ACM, New York, 1993, pp. 612\u2013622.","DOI":"10.1145\/167088.167245"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","article-title":"The first order properties of algebraic systems","volume":"47","author":"Feferman","year":"1959","journal-title":"Fund. Math."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0166-218X(00)00221-3_BIB37"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB38","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.232","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB39","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","article-title":"On extended P4-reducible and extended P4-sparse graphs","volume":"180","author":"Giakoumakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB40","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, Y. Gurevich Metafinite model theory, Inform. and Comput. 140 (1998) 26\u201381. See also: D. Leivant (Ed.), Logic and Computational Complexity, Selected Papers, Springer, Berlin, 1995, pp. 313\u2013366.","DOI":"10.1006\/inco.1997.2675"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB41","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, K. Meer, Descriptive complexity theory over the real numbers, Lectures in Applied Mathematics, Vol. 32, Springer, Berlin, 1996, pp. 381\u2013403. A preliminary version has been presented at the 27th ACM-Symposium on Theory of Computing, Las Vegas, 1995.","DOI":"10.1145\/225058.225151"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB42","doi-asserted-by":"crossref","unstructured":"D.Y. Grigoriev, M. Karpinski, The matching problem for bipartite graphs with polynomial bounded permanents is in nc, 28th Annual Symposium on Foundations of Computer Science, 1987, pp. 166\u2013172.","DOI":"10.1109\/SFCS.1987.56"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB43","series-title":"Database Theory-ICDT\u201999","first-page":"70","article-title":"Definability and descriptive complexity on databases of bounded tree-width","volume":"Vol. 1540","author":"Grohe","year":"1999"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB44","doi-asserted-by":"crossref","first-page":"481","DOI":"10.2307\/2273287","article-title":"Modest theory of short chains, I","volume":"44","author":"Gurevich","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB45","series-title":"Model Theory","volume":"Vol. 42","author":"Hodges","year":"1993"},{"year":"1995","series-title":"Limits to Parallel Computation","author":"Hoover","key":"10.1016\/S0166-218X(00)00221-3_BIB46"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB47","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","article-title":"A linear-time algorithm to recognize P4-reducible graphs","volume":"145","author":"Jamison","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB48","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","article-title":"Linear-time optimization algorithms for P4-sparse graphs","volume":"61","author":"Jamison","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB49","doi-asserted-by":"crossref","unstructured":"M. Jerrum, Two-dimensional monomer-dimer systems are computationally intractable, J. Statist. Phys. 48 (1987) 121\u2013134. Erratum in 59 (1990) 1087\u20131088.","DOI":"10.1007\/BF01010403"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB50","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. 1, Elsevier Science Publishers, Amsterdam, 1990 (Chapter 2).","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB51","doi-asserted-by":"crossref","unstructured":"G.P. Kogan, Computing the permanent over fields of characteristic 3: where and why it becomes difficult, FOCS\u201996, IEEE, New York, 1996, pp. 108\u2013114.","DOI":"10.1109\/SFCS.1996.548469"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB52","unstructured":"G.P. Kogan, The complexity of Schur functions over finite fields, Research proposal for Candidacy Examination, June 1997, http:\/\/cs.technion.ac.il\/\u223cadmlogic\/TR\/readme.html."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB53","unstructured":"G.P. Kogan, J.A. Makowsky, The complexity of Schur functions in finite fields of characteristic 2, Technical Report, Technion-Israel Institute of Technology, February 1997, Comput. Complexity, submitted for publication. http:\/\/cs.technion.ac.il\/\u223cadmlogic\/TR\/readme.html."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB54","unstructured":"G.P. Kogan, J.A. Makowsky, Computing Schur functions for Borchardt matrices, in preparation."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB55","doi-asserted-by":"crossref","unstructured":"G.P. Kogan, J.A. Makowsky, Computing the permanent over fields of characteristic 3: where and why it becomes difficult, Technical Report, Technion-Israel Institute of Technology, February 1996, Computational Complexity, submitted for publication. http:\/\/cs.technion.ac.il\/\u223cadmlogic\/TR\/readme.html.","DOI":"10.1109\/SFCS.1996.548469"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB56","doi-asserted-by":"crossref","unstructured":"P. Kolaitis, M. Vardi, Conjunctive query containment and constraint satisfaction, PODS\u201998, ACM, New York, 1998, pp. 425\u2013435.","DOI":"10.1145\/275487.275511"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB57","doi-asserted-by":"crossref","unstructured":"J.A. Makowsky, Model theory and computer science: an appetizer, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 1, Oxford University Press, Oxford, 1992 (Chapter I.6).","DOI":"10.1093\/oso\/9780198537359.003.0006"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB58","unstructured":"J.A. Makowsky, Logical methods in graph algorithms, Lecture Notes of a course given at ESSLLI\u201999 in Utrecht, August 1999."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB59","unstructured":"J.A. Makowsky, Colored tutte polynomials and Kauffman brackets for graphs of bounded tree-width, Combin. Probab. Comput. xxx (2000) xx\u2013yy, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB60","doi-asserted-by":"crossref","unstructured":"J.A. Makowsky, K. Meer, On the complexity of combinatorial and metafinite generating functions of graph properties in the computational model of Blum, Shub and Smale, CSL\u201900, Lecture Notes in Computer Science, Vol. xxxx, Springer, Berlin, 2000, pp. xx\u2013yy.","DOI":"10.1007\/3-540-44622-2_27"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB61","doi-asserted-by":"crossref","unstructured":"J.A. Makowsky, K. Meer, Polynomials of bounded tree-width, in: Formal Power Series and Algebraic Combinatorics, eds. D. Krob, A.A. Mikhalev and A.V. Mikhalev, Berlin, 2000, pp. 292\u2013703.","DOI":"10.1007\/978-3-662-04166-6_68"},{"issue":"2","key":"10.1016\/S0166-218X(00)00221-3_BIB62","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0168-0072(95)00013-5","article-title":"Arity vs. alternation in second order logic","volume":"78","author":"Makowsky","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB63","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0129054199000241","article-title":"On the cliquewidth of graphs with few P4's","volume":"10","author":"Makowsky","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB64","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(94)00070-0","article-title":"On the complexity of quadratic programming in real number models of computation","volume":"133","author":"Meer","year":"1994","journal-title":"Theoret. Comput. Sci."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/S0166-218X(00)00221-3_BIB65"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB66","unstructured":"E. Ravve, Decomposition of Databases with Translation Schemes, Ph.D. Thesis, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, 1998."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB67","unstructured":"U. Rotics, Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs, Ph.D. Thesis, Technion-Israel Institute of Technology, 1998."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB68","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1006\/jcss.1995.1039","article-title":"Descriptive complexity of \u266f p functions","volume":"50","author":"Saluja","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB69","unstructured":"A. Sharell, Complexit\u00e9 Descriptive et l'approximation des fonctions de d\u00e9nombrement, Ph.D. Thesis, L.R.I.-UPS, Paris, France, 1998."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB70","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","article-title":"The monadic theory of order","volume":"102","author":"Shelah","year":"1975","journal-title":"Ann. Math."},{"year":"1992","series-title":"Matroid Decomposition","author":"Truemper","key":"10.1016\/S0166-218X(00)00221-3_BIB71"},{"year":"1998","series-title":"Effective Logic Computation","author":"Truemper","key":"10.1016\/S0166-218X(00)00221-3_BIB72"},{"key":"10.1016\/S0166-218X(00)00221-3_BIB73","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00221-3_BIB74","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","article-title":"k-NLC graphs and polynomial algorithms","volume":"54","author":"Wanke","year":"1994","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T21:59:23Z","timestamp":1733349563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":74,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0166218X00002213"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00221-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}