Search results for "hypertree-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
214	Dániel Marx	Approximating fractional hypertree width.	SODA	2009	DBLP DOI BibTeX RDF
192	Kaoru Katayama, Tatsuro Okawara, Yuka Ito	A greedy algorithm for constructing a low-width generalized hypertree decomposition.	ICDT	2010	DBLP DOI BibTeX RDF
181	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
159	Francesco Scarcello, Gianluigi Greco, Nicola Leone	Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS)	PODS	2004	DBLP DOI BibTeX RDF
150	Isolde Adler	Tree-width and functional dependencies in databases.	PODS	2008	DBLP DOI BibTeX RDF	hypertree-width, databases, functional dependencies, conjunctive queries, tree-width
120	Georg Gottlob, Marko Samer	A backtracking-based algorithm for hypertree decomposition.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	hypertree decomposition, Constraint satisfaction
109	Martin Grohe, Dániel Marx	Constraint solving via fractional edge covers.	SODA	2006	DBLP DOI BibTeX RDF
88	Georg Gottlob, Reinhard Pichler	Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.	ICALP	2001	DBLP DOI BibTeX RDF
77	Hubie Chen, Víctor Dalmau	Beyond Hypertree Width: Decomposition Methods Without Decompositions.	CP	2005	DBLP DOI BibTeX RDF
77	Georg Gottlob, Zoltán Miklós 0001, 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
77	Georg Gottlob, Zoltán Miklós 0001, 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
77	Georg Gottlob, Nicola Leone, Francesco Scarcello	Hypertree Decompositions: A Survey.	MFCS	2001	DBLP DOI BibTeX RDF
71	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
66	Dániel Marx	Tractable hypergraph properties for constraint satisfaction and conjunctive queries.	STOC	2010	DBLP DOI BibTeX RDF	submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
55	Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello	Hypertree Decompositions: Structure, Algorithms, and Applications.	WG	2005	DBLP DOI BibTeX RDF
44	Francesco Scarcello	From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions.	SEBD	2018	DBLP BibTeX RDF
44	Georg Gottlob, Reinhard Pichler	Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
44	Gianluigi Greco, Francesco Scarcello	The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability.	PODS	2010	DBLP DOI BibTeX RDF	structural decomposition methods, tree projections, local consistency
44	Francesco Scarcello	Query answering exploiting structural properties.	SIGMOD Rec.	2005	DBLP DOI BibTeX RDF
38	Dietmar Berwanger, Erich Grädel	Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.	LPAR	2004	DBLP DOI BibTeX RDF
38	Georg Gottlob, Gianluigi Greco	On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition.	EC	2007	DBLP DOI BibTeX RDF	hypertree decompositions, combinatorial auctions, hypergraphs
33	Matthias Lanzinger, Igor Razgon	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs.	STACS	2024	DBLP DOI BibTeX RDF
33	Benjamin Scheidt, Nicole Schweikardt	Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation.	CoRR	2023	DBLP DOI BibTeX RDF
33	Matthias Lanzinger, Igor Razgon	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs.	CoRR	2023	DBLP DOI BibTeX RDF
33	Benjamin Scheidt, Nicole Schweikardt	Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation.	MFCS	2023	DBLP DOI BibTeX RDF
33	Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider	Threshold Treewidth and Hypertree Width.	J. Artif. Intell. Res.	2022	DBLP DOI BibTeX RDF
33	Igor Razgon	FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank.	CoRR	2022	DBLP DOI BibTeX RDF
33	André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider	Threshold Treewidth and Hypertree Width.	CoRR	2022	DBLP DOI BibTeX RDF
33	Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider	Threshold Treewidth and Hypertree Width.	IJCAI	2020	DBLP DOI BibTeX RDF
33	Nikola Yolov	Minor-matching hypertree width.	SODA	2018	DBLP DOI BibTeX RDF
33	Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider	An SMT Approach to Fractional Hypertree Width.	CP	2018	DBLP DOI BibTeX RDF
33	Nikola Yolov	Minor-matching hypertree width.	CoRR	2017	DBLP BibTeX RDF
33	Tian Liu 0001, Chaoyi Wang, Ke Xu 0001	Large hypertree width for sparse random hypergraphs.	J. Comb. Optim.	2015	DBLP DOI BibTeX RDF
33	Georg Gottlob, Gianluigi Greco, Francesco Scarcello	Treewidth and Hypertree Width.	Tractability	2014	DBLP DOI BibTeX RDF
33	Chaoyi Wang, Tian Liu 0001, Ke Xu 0001	Large Hypertree Width for Sparse Random Hypergraphs.	FAW-AAIM	2013	DBLP DOI BibTeX RDF
33	Dániel Marx	Approximating fractional hypertree width.	ACM Trans. Algorithms	2010	DBLP DOI BibTeX RDF
33	Isolde Adler, Georg Gottlob, Martin Grohe	Hypertree width and related hypergraph invariants.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
33	Hubie Chen, Víctor Dalmau	Beyond Hypertree Width: Decomposition Methods Without Decompositions	CoRR	2005	DBLP BibTeX RDF
33	Isolde Adler	Marshals, monotone marshals, and hypertree-width.	J. Graph Theory	2004	DBLP DOI BibTeX RDF
33	Georg Gottlob, Nicola Leone, Francesco Scarcello	Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width.	J. Comput. Syst. Sci.	2003	DBLP DOI BibTeX RDF
33	Georg Gottlob, Nicola Leone, Francesco Scarcello	Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width.	SEBD	2001	DBLP BibTeX RDF
22	Georg Gottlob, Gianluigi Greco, Francesco Scarcello	Pure Nash equilibria: hard and easy games.	TARK	2003	DBLP DOI BibTeX RDF