Search results for "hypertree decomposition"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Georg Gottlob, Marko Samer	A backtracking-based algorithm for hypertree decomposition.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	hypertree decomposition, Constraint satisfaction
2	Kaoru Katayama, Tatsuro Okawara, Yuka Ito	A greedy algorithm for constructing a low-width generalized hypertree decomposition.	ICDT	2010	DBLP DOI BibTeX RDF
2	Georg Gottlob, Zoltán Miklós, Thomas Schwentick	Generalized hypertree decompositions: NP-hardness and tractable variants.	J. ACM	2009	DBLP DOI BibTeX RDF	TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic
2	Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer	Heuristic Methods for Hypertree Decomposition.	MICAI	2008	DBLP DOI BibTeX RDF
2	Georg Gottlob, Gianluigi Greco	On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition.	ACM Conference on Electronic Commerce	2007	DBLP DOI BibTeX RDF	hypertree decompositions, combinatorial auctions, hypergraphs
2	Georg Gottlob, Zoltán Miklós, Thomas Schwentick	Generalized hypertree decompositions: np-hardness and tractable variants.	PODS	2007	DBLP DOI BibTeX RDF	hypertree decomposition, tree projection problem, NP-complete, hypergraph, conjunctive query, tractable, acyclic
2	Peter Harvey, Aditya Ghose	Reducing Redundancy in the Hypertree Decomposition Scheme.	ICTAI	2003	DBLP DOI BibTeX RDF
1	Zineb Habbas, Kamal Amroun, Daniel Singer	Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition.	ICAART	2011	DBLP BibTeX RDF
1	Abdelmalek Ait-Amokhtar, Kamal Amroun, Zineb Habbas	Hypertree Decomposition for Solving Constraint Satisfaction Problems.	ICAART	2009	DBLP BibTeX RDF
1	Dániel Marx	Approximating fractional hypertree width.	SODA	2009	DBLP DOI BibTeX RDF
1	Georg Gottlob, Gianluigi Greco, Bruno Marnette	HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
1	Cédric Pinto, Cyril Terrioux	A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving.	ICTAI	2008	DBLP DOI BibTeX RDF
1	Sathiamoorthy Subbarayan, Henrik Reif Andersen	Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs.	IJCAI	2007	DBLP BibTeX RDF
1	Georg Gottlob, Gianluigi Greco	Combinatorial auctions with tractable winner determination.	SIGecom Exchanges	2007	DBLP DOI BibTeX RDF
1	Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello	Hypertree Decompositions for Query Optimization.	ICDE	2007	DBLP DOI BibTeX RDF
1	Marko Samer	Hypertree-decomposition via Branch-decomposition.	IJCAI	2005	DBLP BibTeX RDF
1	Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello	Hypertree Decompositions: Structure, Algorithms, and Applications.	WG	2005	DBLP DOI BibTeX RDF
1	Francesco Scarcello, Gianluigi Greco, Nicola Leone	Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS)	PODS	2004	DBLP DOI BibTeX RDF
1	Yaling Zheng, Berthe Y. Choueiry	New Structural Decomposition Techniques for Constraint Satisfaction Problems.	CSCLP	2004	DBLP DOI BibTeX RDF
1	Georg Gottlob, Nicola Leone, Francesco Scarcello	Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
1	Georg Gottlob, Nicola Leone, Francesco Scarcello	Hypertree Decompositions: A Survey.	MFCS	2001	DBLP DOI BibTeX RDF