Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
170 | Kaoru Katayama, Tatsuro Okawara, Yuka Ito |
A greedy algorithm for constructing a low-width generalized hypertree decomposition. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
|
170 | Francesco Scarcello, Gianluigi Greco, Nicola Leone |
Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS) |
PODS |
2004 |
DBLP DOI BibTeX RDF |
|
154 | Dániel Marx |
Approximating fractional hypertree width. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
147 | Georg Gottlob, Marko Samer |
A backtracking-based algorithm for hypertree decomposition. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
hypertree decomposition, Constraint satisfaction |
138 | 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 |
|
115 | 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 |
115 | 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 |
92 | Saswata Shannigrahi, Sudebkumar Prasant Pal |
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Hypertree, Prüfer code, r-uniform, Coding, Counting |
88 | Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello |
Hypertree Decompositions for Query Optimization. |
ICDE |
2007 |
DBLP DOI BibTeX RDF |
|
88 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: A Survey. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
82 | Martin Grohe, Dániel Marx |
Constraint solving via fractional edge covers. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
82 | 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 |
72 | Shlomi Dolev, Ronen I. Kat |
HyperTree for self-stabilizing peer-to-peer systems. |
Distributed Comput. |
2008 |
DBLP DOI BibTeX RDF |
Peer-to-peer, Overlay networks, Self-stabilization |
72 | Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer |
Heuristic Methods for Hypertree Decomposition. |
MICAI |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello |
Hypertree Decompositions: Structure, Algorithms, and Applications. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Shlomi Dolev, Ronen I. Kat |
HyperTree for Self-Stabilizing Peer-to-Peer Systems. |
NCA |
2004 |
DBLP DOI BibTeX RDF |
|
59 | Isolde Adler |
Tree-width and functional dependencies in databases. |
PODS |
2008 |
DBLP DOI BibTeX RDF |
hypertree-width, databases, functional dependencies, conjunctive queries, tree-width |
56 | Hubie Chen, Víctor Dalmau |
Beyond Hypertree Width: Decomposition Methods Without Decompositions. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Peter Harvey, Aditya Ghose |
Reducing Redundancy in the Hypertree Decomposition Scheme. |
ICTAI |
2003 |
DBLP DOI BibTeX RDF |
|
49 | 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 |
|
46 | Bérénice Delcroix-Oger |
Hyperarbres et Partitions semi-pointées : Aspects combinatoires, algébriques et homologiques. (Hypertree and semi-pointed partitions / Hypertree and semi-pointed partitions : Combinatorial, algebraic and homological aspects). |
|
2014 |
RDF |
|
46 | Sathiamoorthy Subbarayan, Henrik Reif Andersen |
Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
43 | Saswata Shannigrahi, Sudebkumar Prasant Pal |
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
hypertree, Prüfer code, r-uniform, coding, counting |
39 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
33 | 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 |
33 | 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 |
33 | Francesco Scarcello, Georg Gottlob, Gianluigi Greco |
Uniform Constraint Satisfaction Problems and Database Theory. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Gianluigi Greco, Francesco Scarcello |
Tree Projections: Hypergraph Games and Minimality. |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Xiangdong An 0001, Nick Cercone |
Iterative Multiagent Probabilistic Inference. |
IAT |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Francesco Scarcello |
Query answering exploiting structural properties. |
SIGMOD Rec. |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Yueming Hu |
A Simulation Research on Multiprocessor Interconnection Networks With Wormhole Routing. |
APDC |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Chun-Hung Tzeng |
A Probability Propagation in Hypertrees. |
ACM Conference on Computer Science |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Sajal K. Das 0001, Aisheng Mao |
Optimal Embeddings in the Hamming Cube Networks. |
Euro-Par |
1995 |
DBLP DOI BibTeX RDF |
Hamming cube, hypertree, interconnection network, dilation, binary tree, Network embedding, incomplete hypercube, tree machine |
23 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. |
ACM Trans. Database Syst. |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. |
STACS |
2024 |
DBLP DOI BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing optimal hypertree decompositions with SAT. |
Artif. Intell. |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Benjamin Scheidt, Nicole Schweikardt |
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 |
Enhancing Datalog Reasoning with Hypertree Decompositions. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Benjamin Scheidt, Nicole Schweikardt |
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. |
MFCS |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 |
Enhancing Datalog Reasoning with Hypertree Decompositions. |
IJCAI |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales |
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. |
Electron. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus |
Incremental Updates of Generalized Hypertree Decompositions. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. |
J. Artif. Intell. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Igor Razgon |
FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
23 | André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Lample, Marie-Anne Lachaux, Thibaut Lavril, Xavier Martinet, Amaury Hayat, Gabriel Ebner, Aurélien Rodriguez, Timothée Lacroix |
HyperTree Proof Search for Neural Theorem Proving. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus |
Incremental Updates of Generalized Hypertree Decompositions. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Yun Yu, D. Antony Xavier, Eddith Sarah Varghese, Deepa Mathew, Muhammad Kamran Siddiqui, Samuel Asefa Fufa |
Distance-Based Topological Descriptors on Ternary Hypertree Networks. |
Complex. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Gholam Hassan Shirdel, B. Vaez-Zadeh |
Finding a minimal spanning hypertree of a weighted hypergraph. |
J. Comb. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Hao Zhou, Gongshen Liu, Kewei Tu |
Improving Constituent Representation with Hypertree Neural Networks. |
NAACL-HLT |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. |
PODS |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Guillaume Lample, Timothée Lacroix, Marie-Anne Lachaux, Aurélien Rodriguez, Amaury Hayat, Thibaut Lavril, Gabriel Ebner, Xavier Martinet |
HyperTree Proof Search for Neural Theorem Proving. |
NeurIPS |
2022 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
Complexity Analysis of Generalized and Fractional Hypertree Decompositions. |
J. ACM |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales |
Every Steiner triple system contains almost spanning d-ary hypertree. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions with SAT. |
IJCAI |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Alexandre Morimitsu, Nicolas Passat, Wonder Alexandre Luz Alves, Ronaldo Fumio Hashimoto |
Efficient component-hypertree construction based on hierarchy of partitions. |
Pattern Recognit. Lett. |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
Complexity Analysis of General and Fractional Hypertree Decompositions. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. |
IJCAI |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Cem Okulmus, Reinhard Pichler |
Parallel Computation of Generalized Hypertree Decompositions. |
AMW |
2019 |
DBLP BibTeX RDF |
|
23 | Andrew Hundt, Varun Jain, Chris Paxton, Gregory D. Hager |
Training Frankenstein's Creature to Stack: HyperTree Architecture Search. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
23 | Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra |
Hypertree Decompositions Revisited for PGMs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
23 | Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra |
Hypertree Decompositions Revisited for PGMs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
23 | Nikola Yolov |
Minor-matching hypertree width. |
SODA |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases. |
PODS |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Francesco Scarcello |
From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions. |
SEBD |
2018 |
DBLP BibTeX RDF |
|
23 | Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider |
An SMT Approach to Fractional Hypertree Width. |
CP |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). |
AMW |
2018 |
DBLP BibTeX RDF |
|
23 | Nikola Yolov |
Minor-matching hypertree width. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
23 | Ke Liu 0006, Sven Löffler, Petra Hofstedt |
Hypertree Decomposition: The First Step Towards Parallel Constraint Solving. |
DECLARE |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Ke Liu 0006, Sven Löffler, Petra Hofstedt |
Using Hypertree Decomposition for Parallel Constraint Solving. |
GI-Jahrestagung |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Zineb Habbas, Kamal Amroun, Daniel Singer |
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints. |
RAIRO Oper. Res. |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Privacy preserving existence recognition and construction of hypertree agent organization. |
Auton. Agents Multi Agent Syst. |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Kamal Amroun, Zineb Habbas, Wassila Aggoune-Mtalaa |
A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems. |
AI Commun. |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: Questions and Answers. |
PODS |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Zineb Habbas, Kamal Amroun, Daniel Singer |
A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems. |
J. Exp. Theor. Artif. Intell. |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Manas Joglekar, Rohan Puttagunta, Christopher Ré |
Aggregations over Generalized Hypertree Decompositions. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
23 | Tian Liu 0001, Chaoyi Wang, Ke Xu 0001 |
Large hypertree width for sparse random hypergraphs. |
J. Comb. Optim. |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Lin Gui 0003, Rui Shen, Yue Yu, Dawei Feng, Yuxing Peng 0001, Wei Liu |
DLG-Hypertree: A Low-Diameter, Server-centric Datacenter Network Architecture. |
CLOUD |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Susan Tu, Christopher Ré |
DunceCap: Query Plans Using Generalized Hypertree Decompositions. |
SIGMOD Conference |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Treewidth and Hypertree Width. |
Tractability |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree. |
Canadian AI |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization. |
Canadian AI |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Chaoyi Wang, Tian Liu 0001, Ke Xu 0001 |
Large Hypertree Width for Sparse Random Hypergraphs. |
FAW-AAIM |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Isolde Adler, Tomas Gavenciak, Tereza Klimosová |
Hypertree-depth and minors in hypergraphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Zineb Habbas, Kamal Amroun, Daniel Singer |
Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition. |
ICAART (1) |
2011 |
DBLP BibTeX RDF |
|
23 | Isabel Cristina Siqueira da Silva, Carla Maria Dal Sasso Freitas |
Requirements for Interactive Ontology Visualization - Using Hypertree +2.5D Visualization for Exploring Relationships between Concepts. |
IMAGAPP/IVAPP |
2011 |
DBLP BibTeX RDF |
|
23 | Dániel Marx |
Approximating fractional hypertree width. |
ACM Trans. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Takuro Fukunaga |
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Abdelmalek Ait-Amokhtar, Kamal Amroun, Zineb Habbas |
Hypertree Decomposition for Solving Constraint Satisfaction Problems. |
ICAART |
2009 |
DBLP BibTeX RDF |
|
23 | Mohammed Lalou, Zineb Habbas, Kamal Amroun |
Solving Hypertree Structured CSP: Sequential and Parallel Approaches. |
RCRA@AI*IA |
2009 |
DBLP BibTeX RDF |
|
23 | Sergio Caracciolo, Gregor Masbaum, Alan D. Sokal, Andrea Sportiello |
A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
23 | Rina Dechter, Lars Otten, Radu Marinescu 0002 |
On the Practical Significance of Hypertree vs. TreeWidth. |
ECAI |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Isolde Adler, Georg Gottlob, Martin Grohe |
Hypertree width and related hypergraph invariants. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Francesco Scarcello, Gianluigi Greco, Nicola Leone |
Weighted hypertree decompositions and optimal query plans. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Marko Samer |
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions |
CoRR |
2007 |
DBLP BibTeX RDF |
|
23 | Isolde Adler |
Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen) |
|
2006 |
RDF |
|