{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:13Z","timestamp":1725535813399},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_21","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"217-226","source":"Crossref","is-referenced-by-count":1,"title":["Tree Projections: Game Characterization and Computational Aspects"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Mikl\u00f3s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Scarcello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.20025","volume":"47","author":"I. Adler","year":"2004","unstructured":"Adler, I.: Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory\u00a047(4), 275\u2013296 (2004)","journal-title":"Journal of Graph Theory"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73420-8_26","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2007","unstructured":"Atserias, A., Bulatov, A., Dalmau, V.: On the Power of k -Consistency. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 279\u2013290. Springer, Heidelberg (2007)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.ejc.2007.04.013","volume":"28","author":"I. Adler","year":"2007","unstructured":"Adler, I., Gottlob, G., Grohe, M.: Hypertree-Width and Related Hypergraph Invariants. European Journal of Combinatorics\u00a028, 2167\u20132181 (2007)","journal-title":"European Journal of Combinatorics"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein, P.A., Goodman, N.: The power of natural semijoins. SIAM Journal on Computing\u00a010(4), 751\u2013771 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Fomin, F.V.: A Linear-Time Algorithm for Finding Tree Decompositions of Small Treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Computing pure nash equilibria in graphical games via markov random fields. In: Proc. of ACM EC 2006, pp. 91\u201399 (2006)","DOI":"10.1145\/1134707.1134718"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/11682462_45","volume-title":"LATIN 2006: Theoretical Informatics","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Nisse, N.: Connected Treewidth and Connected Graph Searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 479\u2013490. Springer, Heidelberg (2006)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms\u00a019, 449\u2013473 (1995)","journal-title":"Journal of Algorithms"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s003730050028","volume":"14","author":"M.C. Golumbic","year":"1998","unstructured":"Golumbic, M.C., Wassermann, A.: Complexity and algorithms for graph and hypergraph sandwich problems. Graphs and Combinatorics\u00a014, 223\u2013239 (1998)","journal-title":"Graphs and Combinatorics"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1145\/2157.322405","volume":"30","author":"N. Goodman","year":"1983","unstructured":"Goodman, N., Shmueli, O.: Syntactic characterization of tree database schemas. Journal of the ACM\u00a030(4), 767\u2013786 (1983)","journal-title":"Journal of the ACM"},{"issue":"1","key":"21_CR11","first-page":"60","volume":"28","author":"N. Goodman","year":"1984","unstructured":"Goodman, N., Shmueli, O.: The tree projection theorem and relational query processing. JCSS\u00a028(1), 60\u201379 (1984)","journal-title":"JCSS"},{"issue":"3","key":"21_CR12","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 decompositions and tractable queries. J. of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"J. of Computer and System Sciences"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","volume":"66","author":"G. Gottlob","year":"2003","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. of Computer and System Sciences\u00a066(4), 775\u2013808 (2003)","journal-title":"J. of Computer and System Sciences"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Mikl\u00f3s, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. In: Proc. of PODS 2007, pp. 13\u201322 (2007)","DOI":"10.1145\/1265530.1265533"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-540-70575-8_60","volume-title":"Automata, Languages and Programming","author":"G. Greco","year":"2008","unstructured":"Greco, G., Scarcello, F.: Tree Projections: Hypergraph Games and Minimality. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 736\u2013747. Springer, Heidelberg (2008)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM\u00a054(1) (2007)","DOI":"10.1145\/1206035.1206036"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. of SODA 2006, pp. 289\u2013298 (2006)","DOI":"10.1145\/1109557.1109590"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1998.0965","volume":"30","author":"A. Lustig","year":"1999","unstructured":"Lustig, A., Shmueli, O.: Acyclic hypergraph projections. Journal of Algorithms\u00a030(2), 400\u2013422 (1999)","journal-title":"Journal of Algorithms"},{"key":"21_CR19","unstructured":"Pearson, J., Jeavons, P.G.: A Survey of Tractable Constraint Satisfaction Problems, CSD-TR-97-15, Royal Holloway, Univ. of London (1997)"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B\u00a036, 49\u201364 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W.L. Ruzzo","year":"1980","unstructured":"Ruzzo, W.L.: Tree-size bounded alternation. Journal of Cumputer and System Sciences\u00a021, 218\u2013235 (1980)","journal-title":"Journal of Cumputer and System Sciences"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/155271.155277","volume":"18","author":"Y. Sagiv","year":"1993","unstructured":"Sagiv, Y., Shmueli, O.: Solving queries by tree projections. ACM Transactions on Database Systems\u00a018(3), 487\u2013511 (1993)","journal-title":"ACM Transactions on Database Systems"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory, Series B\u00a058, 22\u201333 (1993)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"21_CR24","unstructured":"Subbarayan, S., Reif Andersen, H.: Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs. In: Proc. of IJCAI 2007, pp. 180\u2013185 (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T18:18:33Z","timestamp":1558462713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}