{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:21:13Z","timestamp":1743034873261,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886358"},{"type":"electronic","value":"9783540886365"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88636-5_1","type":"book-chapter","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T02:19:04Z","timestamp":1224209944000},"page":"1-11","source":"Crossref","is-referenced-by-count":19,"title":["Heuristic Methods for Hypertree Decomposition"],"prefix":"10.1007","author":[{"given":"Artan","family":"Dermaku","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Ganzow","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[]},{"given":"Ben","family":"McMahan","sequence":"additional","affiliation":[]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Samer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C. Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theoretical Computer Science\u00a0239(2), 211\u2013229 (2000)","journal-title":"Theoretical Computer Science"},{"key":"1_CR3","unstructured":"DBAI Hypertree Project website, Vienna University of Technology, http:\/\/www.dbai.tuwien.ac.at\/proj\/hypertree\/"},{"key":"1_CR4","first-page":"276","volume-title":"Encyclopedia of Artificial Intelligence","author":"R. Dechter","year":"1992","unstructured":"Dechter, R.: Constraint networks. In: Encyclopedia of Artificial Intelligence, 2nd edn., vol.\u00a01, pp. 276\u2013285. Wiley and Sons, Chichester (1992)","edition":"2"},{"key":"1_CR5","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a038(3), 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"1_CR7","first-page":"175","volume-title":"Proc. of the 19th Conference on Design Automation (DAC 1982)","author":"C.M. Fiduccia","year":"1982","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proc. of the 19th Conference on Design Automation (DAC 1982), pp. 175\u2013181. IEEE Press, Los Alamitos (1982)"},{"key":"1_CR8","unstructured":"Ganzow, T., Gottlob, G., Musliu, N., Samer, M.: A CSP hypergraph library. Technical Report, DBAI-TR-2005-50, Vienna University of Technology (2005)"},{"key":"1_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., New York (1979)"},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence\u00a0124(2), 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"48","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. Journal of the ACM\u00a048(3), 431\u2013498 (2001)","journal-title":"Journal of the ACM"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decomposition and tractable queries. Journal of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR14","first-page":"13","volume-title":"Proc. of the 26th ACM Symposium on Principles of Database Systems (PODS 2007)","author":"G. Gottlob","year":"2007","unstructured":"Gottlob, G., Mikl\u00f3s, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. In: Proc. of the 26th ACM Symposium on Principles of Database Systems (PODS 2007), pp. 13\u201322. ACM Press, New York (2007)"},{"key":"1_CR15","unstructured":"Gottlob, G., Samer, M.: A backtracking-based algorithm for hypertree decomposition. ACM Journal of Experimental Algorithmics (to appear)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence\u00a066(1), 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4615-9385-0_4","volume-title":"Advances in Data Base Theory","author":"M. Gyssens","year":"1984","unstructured":"Gyssens, M., Paredaens, J.: A decomposition methodology for cyclic databases. In: Gallaire, H., Nicolas, J.-M., Minker, J. (eds.) Advances in Data Base Theory, vol.\u00a02, pp. 85\u2013122. Plemum Press, New York (1984)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: Applications in VLSI domain. IEEE Transactions on Very Large Scale Integration Systems\u00a07(1), 69\u201379 (1999)","journal-title":"IEEE Transactions on Very Large Scale Integration Systems"},{"key":"1_CR19","unstructured":"Karypis, G., Kumar, V.: hMetis: A hypergraph partitioning package, version 1.5.3 (1998)"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing\u00a048(1), 96\u2013129 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/309847.309954","volume-title":"Proc. of the 36th ACM\/IEEE Conference on Design Automation (DAC 1999)","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proc. of the 36th ACM\/IEEE Conference on Design Automation (DAC 1999), pp. 343\u2013348. ACM Press, New York (1999)"},{"key":"1_CR22","unstructured":"Korimort, T.: Heuristic Hypertree Decomposition. PhD thesis, Vienna University of Technology (2003)"},{"key":"1_CR23","unstructured":"McMahan, B.: Bucket eliminiation and hypertree decompositions. Implementation Report, Database and AI Group, Vienna University of Technology (2004)"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1504\/EJIE.2007.014690","volume":"1","author":"N. Musliu","year":"2007","unstructured":"Musliu, N., Schafhauser, W.: Genetic algorithms for generalized hypertree decompositions. European Journal of Industrial Engineering\u00a01(3), 317\u2013340 (2007)","journal-title":"European Journal of Industrial Engineering"},{"key":"1_CR25","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.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"1_CR26","unstructured":"Samer, M.: Hypertree-decomposition via branch-decomposition. In: Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 1535\u20131536. Professional Book Center (2005)"},{"key":"1_CR27","unstructured":"Samer, M., Szeider, S.: Complexity and applications of edge-induced vertex-cuts. Technical Report, arXiv:cs.DM\/0607109 (2006)"},{"key":"1_CR28","first-page":"81","volume-title":"Proc. of the 7th International Conference on Very Large Data Bases (VLDB 1981)","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proc. of the 7th International Conference on Very Large Data Bases (VLDB 1981), pp. 81\u201394. IEEE Press, Los Alamitos (1981)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2008: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88636-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T14:39:11Z","timestamp":1684593551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88636-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886358","9783540886365"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88636-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}