{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:06:21Z","timestamp":1778108781385,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T00:00:00Z","timestamp":1207094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00453-008-9180-4","type":"journal-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T19:35:08Z","timestamp":1207078508000},"page":"448-479","source":"Crossref","is-referenced-by-count":41,"title":["Approximation Algorithms for Treewidth"],"prefix":"10.1007","volume":"56","author":[{"given":"Eyal","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,2]]},"reference":[{"key":"9180_CR1","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1090\/conm\/147\/01199","volume-title":"Graph Structure Theory, Proc. Conf. on Graph Minors (Seattle, 1991)","author":"K.A. Abrahamson","year":"1993","unstructured":"Abrahamson, K.A., Fellows, M.R.: Finite automata, bounded treewidth and well-quasiordering. In: Graph Structure Theory, Proc. Conf. on Graph Minors (Seattle, 1991). Contemporary Mathematics, vol.\u00a0147, pp.\u00a0539\u2013564. American Mathematical Society, Providence (1993)"},{"key":"9180_CR2","unstructured":"Amir, E.: Partitioning and reasoning project website. http:\/\/www.cs.uiuc.edu\/~eyal\/decomp"},{"key":"9180_CR3","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: 17th Conference on Uncertainty in Artificial Intelligence (UAI \u201901) (2001)"},{"key":"9180_CR4","first-page":"90","volume-title":"Proc. 35rd ACM Symp. on Theory of Computing","author":"E. Amir","year":"2003","unstructured":"Amir, E., Krauthgamer, R., Rao, S.: Constant factor approximation of vertex-cuts in planar graphs. In: Proc. 35rd ACM Symp. on Theory of Computing, pp.\u00a090\u201399. ACM, New York (2003)"},{"key":"9180_CR5","first-page":"389","volume-title":"Principles of Knowledge Representation and Reasoning: Proc. Seventh Int\u2019l Conference (KR \u20192000)","author":"E. Amir","year":"2000","unstructured":"Amir, E., McIlraith, S.: Partition-based logical reasoning. In: Principles of Knowledge Representation and Reasoning: Proc. Seventh Int\u2019l Conference (KR \u20192000), pp.\u00a0389\u2013400. Kaufmann, Los Altos (2000)"},{"key":"9180_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a K-tree. SIAM J. Algebr. Discrete Methods 8, 277\u2013284 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9180_CR7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Problems easy for tree-decomposable graphs. J.\u00a0Algorithms 12, 308\u2013340 (1991)","journal-title":"J.\u00a0Algorithms"},{"key":"9180_CR8","first-page":"81","volume-title":"Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI \u201996)","author":"A. Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: A sufficiently fast algorithm for finding close to optimal junction trees. In: Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI \u201996), pp.\u00a081\u201389. Kaufmann, Los Altos (1996)"},{"issue":"1\u20132","key":"9180_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0004-3702(00)00075-8","volume":"125","author":"A. Becker","year":"2001","unstructured":"Becker, A., Geiger, D.: A sufficiently fast algorithm for finding close to optimal clique trees. Artif. Intell. 125(1\u20132), 3\u201317 (2001)","journal-title":"Artif. Intell."},{"issue":"6","key":"9180_CR10","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"9180_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Pr\u00edvara, I., Ruzicka, P. (eds.) Mathematical Foundations of Computer Science 1997. LNCS, vol.\u00a01295, pp.\u00a019\u201336. Springer, Berlin (1997)"},{"key":"9180_CR12","unstructured":"Bodlaender, H.L.: Personal communication (September 2000)"},{"issue":"2","key":"9180_CR13","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J.\u00a0Algorithms 18(2), 238\u2013255 (1995)","journal-title":"J.\u00a0Algorithms"},{"key":"9180_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/3-540-54233-7_162","volume-title":"Automata, Languages and Programming, 18th International Colloquium","author":"H.L. Bodlaender","year":"1991","unstructured":"Bodlaender, H.L., Kloks, T.: Better algorithms for the pathwidth and treewidth of graphs. In: Automata, Languages and Programming, 18th International Colloquium. LNCS, vol.\u00a0510, pp.\u00a0544\u2013555. Springer, Berlin (1991)"},{"issue":"1","key":"9180_CR15","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V. Bouchitte","year":"2001","unstructured":"Bouchitte, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"key":"9180_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/10692760_8","volume-title":"WG: Graph-Theoretic Concepts in Computer Science, International Workshop WG","author":"H. Broersma","year":"1998","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: A\u00a0generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking. In: WG: Graph-Theoretic Concepts in Computer Science, International Workshop WG. LNCS, vol.\u00a01517, pp.\u00a088\u201399. Springer, Berlin (1998)"},{"issue":"4","key":"9180_CR17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"9180_CR18","first-page":"221","volume-title":"Proc. National Conference on Artificial Intelligence (AAAI \u201999)","author":"P. Cohen","year":"1999","unstructured":"Cohen, P., Chaudhri, V., Pease, A., Schrag, R.: Does prior knowledge facilitate the development of knowledge-based systems. In: Proc. National Conference on Artificial Intelligence (AAAI \u201999), pp.\u00a0221\u2013226. AAAI Press, Menlo Park (1999)"},{"key":"9180_CR19","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1989","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw\u2013Hill, New York (1989)"},{"key":"9180_CR20","first-page":"105","volume-title":"DIMACS Series in Disc. Math. and Theor. Comput. Sci.","author":"W.H. Cunningham","year":"1991","unstructured":"Cunningham, W.H.: The optimal multiterminal cut problem. In: DIMACS Series in Disc. Math. and Theor. Comput. Sci., vol.\u00a05, pp.\u00a0105\u2013120. American Mathematical Society, Providence (1991)"},{"key":"9180_CR21","first-page":"211","volume-title":"Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI \u201996)","author":"R. Dechter","year":"1996","unstructured":"Dechter, R.: Bucket elimination: A unifying framework for probabilistic inference. In: Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI \u201996), pp.\u00a0211\u2013219. Kaufmann, Los Altos (1996)"},{"key":"9180_CR22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell. 38, 353\u2013366 (1989)","journal-title":"Artif. Intell."},{"issue":"2","key":"9180_CR23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jcss.2003.12.001","volume":"69","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Nishimura, N., Ragde, P., Thilikos, D.M.: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J.\u00a0Comput. Syst. Sci. 69(2), 166\u2013195 (2004)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9180_CR24","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277\u20131280 (1970)","journal-title":"Sov. Math. Dokl."},{"issue":"3","key":"9180_CR25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0204034","volume":"4","author":"S. Even","year":"1975","unstructured":"Even, S.: An algorithm for determining whether the connectivity of a graph is at least k. SIAM J. Comput. 4(3), 393\u2013396 (1975)","journal-title":"SIAM J. Comput."},{"key":"9180_CR26","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, New York (1979)"},{"key":"9180_CR27","first-page":"563","volume-title":"Proc. 37rd ACM Symp. on Theory of Computing","author":"U. Feige","year":"2005","unstructured":"Feige, U., Hajiaghayi, M.T., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: Proc. 37rd ACM Symp. on Theory of Computing, pp.\u00a0563\u2013572. ACM, New York (2005)"},{"key":"9180_CR28","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/978-3-540-27836-8_49","volume-title":"Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), pp.\u00a0568\u2013580. Springer, Berlin (2004)"},{"key":"9180_CR29","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford, L.R. Jr., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9180_CR30","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-58201-0_92","volume-title":"Automata, Languages and Programming, 21st ICALP","author":"N. Garg","year":"1994","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Automata, Languages and Programming, 21st ICALP. LNCS, vol.\u00a0820, pp.\u00a0487\u2013498. Springer, Berlin (1994)"},{"key":"9180_CR31","unstructured":"Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina, H.: Proximity search in databases. In: Proceedings of the 24th Intl\u2019 Conf. on Very Large Databases (VLDB 1998) (1998)"},{"key":"9180_CR32","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB\u2014the satisfiability library. Canadian SATLIB site, hostet by the Laboratory for Computational Intelligence at the computer science department of the University of British Columbia in Vancouver, Canada, 2001. Can be found at http:\/\/www.satlib.org"},{"key":"9180_CR33","first-page":"269","volume":"4","author":"F.V. Jensen","year":"1990","unstructured":"Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in recursive graphical models by local computation. Comput. Stat. Q. 4, 269\u2013282 (1990)","journal-title":"Comput. Stat. Q."},{"key":"9180_CR34","unstructured":"Kjaerulff, U.: Aspects of efficiency improvement in Bayesian networks. PhD thesis, Aalborg University, Department of Mathematics and Computer Science, Fredrik Bajers Vej 7E, DK-9220 Aalborg, Denmark (1993)"},{"key":"9180_CR35","first-page":"726","volume-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS\u201990)","author":"P. Klein","year":"1990","unstructured":"Klein, P., Agrawal, A., Ravi, R., Rao, S.: Approximation through multicommodity flow. In: Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS\u201990), pp.\u00a0726\u2013739. IEEE Press, New York (1990)"},{"key":"9180_CR36","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: computations and approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: In: Treewidth: computations and approximations. LNCS, vol.\u00a0842. Springer, Berlin (1994)"},{"key":"9180_CR37","first-page":"173","volume-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS\u201990)","author":"J. Lagergren","year":"1990","unstructured":"Lagergren, J.: Efficient parallel algorithms for tree-decomposition and related problems. In: Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS\u201990), pp.\u00a0173\u2013182. IEEE Press, New York (1990)"},{"key":"9180_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/3-540-54233-7_161","volume-title":"Proc. 18th Int. Coll. Automata, Languages and Programming","author":"J. Lagergren","year":"1991","unstructured":"Lagergren, J., Arnborg, S.: Finding minimal forbidden minors using a finite congruence. In: Proc. 18th Int. Coll. Automata, Languages and Programming. LNCS, vol.\u00a0510, pp.\u00a0532\u2013543. Springer, Berlin (1991)"},{"issue":"2","key":"9180_CR39","first-page":"157","volume":"50","author":"S.L. Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J.\u00a0R. Stat. Soc. B 50(2), 157\u2013224 (1988)","journal-title":"J.\u00a0R. Stat. Soc. B"},{"issue":"2","key":"9180_CR40","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jcss.1995.1020","volume":"50","author":"T. Leighton","year":"1995","unstructured":"Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.: Fast approximation algorithms for multicommodity flow problems. J. Comput. Syst. Sci. 50(2), 228\u2013243 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9180_CR41","doi-asserted-by":"crossref","unstructured":"Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proc. 29th IEEE Symp. on Foundations of Computer Science (FOCS\u201988), pp.\u00a0422\u2013431 (1988)","DOI":"10.1109\/SFCS.1988.21958"},{"issue":"6","key":"9180_CR42","first-page":"787","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J.\u00a0ACM 46(6), 787\u2013832 (1999)","journal-title":"J.\u00a0ACM"},{"issue":"11","key":"9180_CR43","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/219717.219745","volume":"38","author":"D.B. Lenat","year":"1995","unstructured":"Lenat, D.B.: Cyc: A large-scale investment in knowledge infrastructure. Commun. ACM 38(11), 33\u201338 (1995)","journal-title":"Commun. ACM"},{"key":"9180_CR44","first-page":"89","volume-title":"Proc. Eighteenth International Joint Conference on Artificial Intelligence (IJCAI \u201903)","author":"B. MacCartney","year":"2003","unstructured":"MacCartney, B., McIlraith, S., Amir, E., Uribe, T.: Practical partition-based theorem proving for large knowledge bases. In: Proc. Eighteenth International Joint Conference on Artificial Intelligence (IJCAI \u201903), pp.\u00a089\u201396. Kaufmann, Los Altos (2003)"},{"key":"9180_CR45","first-page":"624","volume-title":"Proc. Seventeenth International Joint Conference on Artificial Intelligence (IJCAI \u201901)","author":"S. McIlraith","year":"2001","unstructured":"McIlraith, S., Amir, E.: Theorem proving with structured theories. In: Proc. Seventeenth International Joint Conference on Artificial Intelligence (IJCAI \u201901), pp.\u00a0624\u2013631. Kaufmann, Los Altos (2001)"},{"key":"9180_CR46","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Kaufmann, Los Altos (1988)"},{"key":"9180_CR47","first-page":"484","volume-title":"Proc. Tenth Conference on Uncertainty in Artificial Intelligence (UAI \u201994)","author":"M. Pradhan","year":"1994","unstructured":"Pradhan, M., Provan, G., Middleton, B., Henrion, M.: Knowledge engineering for large belief networks. In: Proc. Tenth Conference on Uncertainty in Artificial Intelligence (UAI \u201994), pp.\u00a0484\u2013490. Kaufmann, Los Altos (1994)"},{"key":"9180_CR48","first-page":"221","volume-title":"Proc. 24th ACM Symp. on Theory of Computing","author":"B.A. Reed","year":"1992","unstructured":"Reed, B.A.: Finding approximate separators and computing tree width quickly. In: Proc. 24th ACM Symp. on Theory of Computing, pp.\u00a0221\u2013228. ACM, New York (1992)"},{"key":"9180_CR49","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II: Algorithmic aspects of treewidth. J.\u00a0Algorithms 7, 309\u2013322 (1986)","journal-title":"J.\u00a0Algorithms"},{"key":"9180_CR50","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XIII. the disjoint paths problem. J.\u00a0Comb. Theory Ser. B 63, 65\u2013110 (1995)","journal-title":"J.\u00a0Comb. Theory Ser. B"},{"key":"9180_CR51","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D.J. Rose","year":"1974","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J.\u00a0Discrete Math. 7, 317\u2013322 (1974)","journal-title":"J.\u00a0Discrete Math."},{"issue":"2","key":"9180_CR52","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"9180_CR53","first-page":"185","volume-title":"Proc. National Conference on Artificial Intelligence (AAAI \u201997)","author":"K. Shoikhet","year":"1997","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proc. National Conference on Artificial Intelligence (AAAI \u201997), pp.\u00a0185\u2013190. Kaufmann, Los Altos (1997)"},{"key":"9180_CR54","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"J.R. Walter","year":"1978","unstructured":"Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J.\u00a0Graph Theory 2, 265\u2013267 (1978)","journal-title":"J.\u00a0Graph Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9180-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9180-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9180-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9180-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,2]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9180"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9180-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,2]]}}}