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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings, pp. 174-182, 2010, ACM, 978-1-60558-947-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
170 | Francesco Scarcello, Gianluigi Greco, Nicola Leone |
Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France, pp. 210-221, 2004, ACM, 1-58113-858-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
154 | Dániel Marx |
Approximating fractional hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 902-911, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
147 | Georg Gottlob, Marko Samer |
A backtracking-based algorithm for hypertree decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA, 2001, ACM, 1-58113-361-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
115 | Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick |
Generalized hypertree decompositions: NP-hardness and tractable variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(6), pp. 30:1-30:32, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 13-22, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 208-225, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 36-45, 2007, IEEE Computer Society, 1-4244-0802-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
88 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 37-57, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
82 | Martin Grohe, Dániel Marx |
Constraint solving via fractional edge covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 289-298, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
82 | Georg Gottlob, Gianluigi Greco |
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 152-161, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hypertree decompositions, combinatorial auctions, hypergraphs |
72 | Shlomi Dolev, Ronen I. Kat |
HyperTree for self-stabilizing peer-to-peer systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 20(5), pp. 375-388, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2008: Advances in Artificial Intelligence, 7th Mexican International Conference on Artificial Intelligence, Atizapán de Zaragoza, Mexico, October 27-31, 2008, Proceedings, pp. 1-11, 2008, Springer, 978-3-540-88635-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello |
Hypertree Decompositions: Structure, Algorithms, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 1-15, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Shlomi Dolev, Ronen I. Kat |
HyperTree for Self-Stabilizing Peer-to-Peer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCA ![In: 3rd IEEE International Symposium on Network Computing and Applications (NCA 2004), 30 August - 1 September 2004, Cambridge, MA, USA, pp. 25-32, 2004, IEEE Computer Society, 0-7695-2242-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
59 | Isolde Adler |
Tree-width and functional dependencies in databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 311-320, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 167-181, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Peter Harvey, Aditya Ghose |
Reducing Redundancy in the Hypertree Decomposition Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 474-481, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Georg Gottlob, Gianluigi Greco, Bruno Marnette |
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 87-99, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
46 | Sathiamoorthy Subbarayan, Henrik Reif Andersen |
Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 180-185, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
43 | Saswata Shannigrahi, Sudebkumar Prasant Pal |
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 588-597, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 708-719, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Gianluigi Greco, Francesco Scarcello |
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA, pp. 327-338, 2010, ACM, 978-1-4503-0033-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 735-744, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complexity of Constraints ![In: Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]., pp. 156-195, 2008, Springer, 978-3-540-92799-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Gianluigi Greco, Francesco Scarcello |
Tree Projections: Hypergraph Games and Minimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 736-747, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Xiangdong An 0001, Nick Cercone |
Iterative Multiagent Probabilistic Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAT ![In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Hong Kong, China, 18-22 December 2006, pp. 240-246, 2006, IEEE Computer Society, 0-7695-2748-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Francesco Scarcello |
Query answering exploiting structural properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Rec. ![In: SIGMOD Rec. 34(3), pp. 91-99, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Yueming Hu |
A Simulation Research on Multiprocessor Interconnection Networks With Wormhole Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APDC ![In: Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), March 19-21, 1997, Shanghai, China, pp. 58-65, 1997, IEEE Computer Society, 0-8186-7876-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Chun-Hung Tzeng |
A Probability Propagation in Hypertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 21th Conference on Computer Science, CSC '93, Indianapolis, IN, USA, February 16-18, 1993, pp. 237-242, 1993, ACM, 0-89791-558-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Sajal K. Das 0001, Aisheng Mao |
Optimal Embeddings in the Hamming Cube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '95 Parallel Processing, First International Euro-Par Conference, Stockholm, Sweden, August 29-31, 1995, Proceedings, pp. 205-216, 1995, Springer, 3-540-60247-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 49(1), pp. 1:1-1:43, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 48:1-48:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing optimal hypertree decompositions with SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 325, pp. 104015, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Benjamin Scheidt, Nicole Schweikardt |
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.10980, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Lanzinger, Igor Razgon |
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.17049, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 |
Enhancing Datalog Reasoning with Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.06854, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Benjamin Scheidt, Nicole Schweikardt |
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 79:1-79:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 |
Enhancing Datalog Reasoning with Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 3383-3393, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales |
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(3), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus |
Incremental Updates of Generalized Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 27, pp. 1.16:1-1.16:28, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 74, pp. 1687-1713, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Igor Razgon |
FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.13423, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.07040, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.11491, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus |
Incremental Updates of Generalized Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.10375, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2022, pp. 4634326:1-4634326:9, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Gholam Hassan Shirdel, B. Vaez-Zadeh |
Finding a minimal spanning hypertree of a weighted hypergraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(1), pp. 894-904, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Hao Zhou, Gongshen Liu, Kewei Tu |
Improving Constituent Representation with Hypertree Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAACL-HLT ![In: Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2022, Seattle, WA, United States, July 10-15, 2022, pp. 1682-1692, 2022, Association for Computational Linguistics, 978-1-955917-71-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022, pp. 325-336, 2022, ACM, 978-1-4503-9260-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
Complexity Analysis of Generalized and Fractional Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 68(5), pp. 38:1-38:50, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales |
Every Steiner triple system contains almost spanning d-ary hypertree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.10969, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13793, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions with SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021., pp. 1418-1424, 2021, ijcai.org. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. Lett. ![In: Pattern Recognit. Lett. 135, pp. 30-37, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
Complexity Analysis of General and Fractional Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.05239, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 1-11, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 1898-1904, 2020, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Cem Okulmus, Reinhard Pichler |
Parallel Computation of Generalized Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMW ![In: Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunción, Paraguay, June 3-7, 2019., 2019, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Andrew Hundt, Varun Jain, Chris Paxton, Gregory D. Hager |
Training Frankenstein's Creature to Stack: HyperTree Architecture Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.11714, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra |
Hypertree Decompositions Revisited for PGMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.01640, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra |
Hypertree Decompositions Revisited for PGMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.00886, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Nikola Yolov |
Minor-matching hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 219-233, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018, pp. 17-32, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Francesco Scarcello |
From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEBD ![In: Proceedings of the 26th Italian Symposium on Advanced Database Systems, Castellaneta Marina (Taranto), Italy, June 24-27, 2018., 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider |
An SMT Approach to Fractional Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, pp. 109-127, 2018, Springer, 978-3-319-98333-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMW ![In: Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, Cali, Colombia, May 21-25, 2018., 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Nikola Yolov |
Minor-matching hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.02939, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Ke Liu 0006, Sven Löffler, Petra Hofstedt |
Hypertree Decomposition: The First Step Towards Parallel Constraint Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DECLARE ![In: Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19-22, 2017, Revised Selected Papers, pp. 81-94, 2017, Springer, 978-3-030-00800-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Ke Liu 0006, Sven Löffler, Petra Hofstedt |
Using Hypertree Decomposition for Parallel Constraint Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GI-Jahrestagung ![In: 47. Jahrestagung der Gesellschaft für Informatik, Digitale Kulturen, INFORMATIK 2017, Chemnitz, Germany, September 25-29, 2017, pp. 615-622, 2017, GI, 978-3-88579-669-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Zineb Habbas, Kamal Amroun, Daniel Singer |
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 50(2), pp. 241-267, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Privacy preserving existence recognition and construction of hypertree agent organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 30(2), pp. 220-258, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI Commun. ![In: AI Commun. 29(2), pp. 371-392, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
General and Fractional Hypertree Decompositions: Hard and Easy Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.01090, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
23 | Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: Questions and Answers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp. 57-74, 2016, ACM, 978-1-4503-4191-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Exp. Theor. Artif. Intell. ![In: J. Exp. Theor. Artif. Intell. 27(5), pp. 649-671, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Manas Joglekar, Rohan Puttagunta, Christopher Ré |
Aggregations over Generalized Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.07532, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Tian Liu 0001, Chaoyi Wang, Ke Xu 0001 |
Large hypertree width for sparse random hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 29(3), pp. 531-540, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLOUD ![In: 8th IEEE International Conference on Cloud Computing, CLOUD 2015, New York City, NY, USA, June 27 - July 2, 2015, pp. 1077-1080, 2015, IEEE Computer Society, 978-1-4673-7287-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Susan Tu, Christopher Ré |
DunceCap: Query Plans Using Generalized Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 2077-2078, 2015, ACM, 978-1-4503-2758-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Tractability ![In: Tractability: Practical Approaches to Hard Problems, pp. 3-38, 2014, Cambridge University Press, 9781139177801. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Canadian AI ![In: Advances in Artificial Intelligence, 26th Canadian Conference on Artificial Intelligence, Canadian AI 2013, Regina, SK, Canada, May 28-31, 2013. Proceedings, pp. 199-210, 2013, Springer, 978-3-642-38456-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Yang Xiang 0004, Kamala Srinivasan |
Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Canadian AI ![In: Advances in Artificial Intelligence, 26th Canadian Conference on Artificial Intelligence, Canadian AI 2013, Regina, SK, Canada, May 28-31, 2013. Proceedings, pp. 187-198, 2013, Springer, 978-3-642-38456-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Chaoyi Wang, Tian Liu 0001, Ke Xu 0001 |
Large Hypertree Width for Sparse Random Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW-AAIM ![In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pp. 294-302, 2013, Springer, 978-3-642-38755-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Isolde Adler, Tomas Gavenciak, Tereza Klimosová |
Hypertree-depth and minors in hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 463, pp. 84-95, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Zineb Habbas, Kamal Amroun, Daniel Singer |
Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (1) ![In: ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Rome, Italy, January 28-30, 2011, pp. 146-156, 2011, SciTePress, 978-989-8425-40-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMAGAPP/IVAPP ![In: IMAGAPP & IVAPP 2011 - Proceedings of the International Conference on Imaging Theory and Applications and International Conference on Information Visualization Theory and Applications, Vilamoura, Algarve, Portugal, March 5-7, 2011., pp. 242-248, 2011, SciTePress, 978-989-8425-46-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
23 | Dániel Marx |
Approximating fractional hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 6(2), pp. 29:1-29:17, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Takuro Fukunaga |
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings, pp. 15-28, 2010, Springer, 978-3-642-13035-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Abdelmalek Ait-Amokhtar, Kamal Amroun, Zineb Habbas |
Hypertree Decomposition for Solving Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART ![In: ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19 - 21, 2009, pp. 85-92, 2009, INSTICC Press, 978-989-8111-66-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
23 | Mohammed Lalou, Zineb Habbas, Kamal Amroun |
Solving Hypertree Structured CSP: Sequential and Parallel Approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RCRA@AI*IA ![In: Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@AI*IA 2009, Reggio Emilia, Italy, December 11-12, 2009, 2009, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0812.3593, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
23 | Rina Dechter, Lars Otten, Radu Marinescu 0002 |
On the Practical Significance of Hypertree vs. TreeWidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, 2008, Proceedings, pp. 913-914, 2008, IOS Press, 978-1-58603-891-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Isolde Adler, Georg Gottlob, Martin Grohe |
Hypertree width and related hypergraph invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 28(8), pp. 2167-2181, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Francesco Scarcello, Gianluigi Greco, Nicola Leone |
Weighted hypertree decompositions and optimal query plans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 73(3), pp. 475-506, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Georg Gottlob, Marko Samer |
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0701083, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
23 | Isolde Adler |
Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2006 |
RDF |
|