The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for hypertree with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1981-2000 (17) 2001-2004 (20) 2005-2007 (22) 2008-2009 (18) 2010-2015 (19) 2016-2018 (16) 2019-2022 (21) 2023-2024 (8)
Publication types (Num. hits)
article(58) incollection(2) inproceedings(79) phdthesis(2)
Venues (Conferences, Journals, ...)
CoRR(20) PODS(10) IJCAI(5) SEBD(4) J. ACM(3) J. Comput. Syst. Sci.(3) SIGMOD Conference(3) SODA(3) WG(3) ACM J. Exp. Algorithmics(2) AMW(2) Canadian AI(2) CP(2) ECAI(2) IAT(2) ISAAC(2) More (+10 of total 84)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 55 occurrences of 42 keywords

Results
Found 141 publication records. Showing 141 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
170Kaoru Katayama, Tatsuro Okawara, Yuka Ito A greedy algorithm for constructing a low-width generalized hypertree decomposition. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
170Francesco Scarcello, Gianluigi Greco, Nicola Leone Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
154Dániel Marx Approximating fractional hypertree width. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
147Georg Gottlob, Marko Samer A backtracking-based algorithm for hypertree decomposition. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hypertree decomposition, Constraint satisfaction
138Georg Gottlob, Nicola Leone, Francesco Scarcello Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
115Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick Generalized hypertree decompositions: NP-hardness and tractable variants. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic
115Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick Generalized hypertree decompositions: np-hardness and tractable variants. Search on Bibsonomy PODS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF hypertree decomposition, tree projection problem, NP-complete, hypergraph, conjunctive query, tractable, acyclic
92Saswata Shannigrahi, Sudebkumar Prasant Pal Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hypertree, Prüfer code, r-uniform, Coding, Counting
88Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello Hypertree Decompositions for Query Optimization. Search on Bibsonomy ICDE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
88Georg Gottlob, Nicola Leone, Francesco Scarcello Hypertree Decompositions: A Survey. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
82Martin Grohe, Dániel Marx Constraint solving via fractional edge covers. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
82Georg Gottlob, Gianluigi Greco On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. Search on Bibsonomy EC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF hypertree decompositions, combinatorial auctions, hypergraphs
72Shlomi Dolev, Ronen I. Kat HyperTree for self-stabilizing peer-to-peer systems. Search on Bibsonomy Distributed Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Peer-to-peer, Overlay networks, Self-stabilization
72Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer Heuristic Methods for Hypertree Decomposition. Search on Bibsonomy MICAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
72Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello Hypertree Decompositions: Structure, Algorithms, and Applications. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Shlomi Dolev, Ronen I. Kat HyperTree for Self-Stabilizing Peer-to-Peer Systems. Search on Bibsonomy NCA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
59Isolde Adler Tree-width and functional dependencies in databases. Search on Bibsonomy PODS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hypertree-width, databases, functional dependencies, conjunctive queries, tree-width
56Hubie Chen, Víctor Dalmau Beyond Hypertree Width: Decomposition Methods Without Decompositions. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Peter Harvey, Aditya Ghose Reducing Redundancy in the Hypertree Decomposition Scheme. Search on Bibsonomy ICTAI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Georg Gottlob, Gianluigi Greco, Bruno Marnette HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
46Bé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 2014   RDF
46Sathiamoorthy Subbarayan, Henrik Reif Andersen Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs. Search on Bibsonomy IJCAI The full citation details ... 2007 DBLP  BibTeX  RDF
43Saswata Shannigrahi, Sudebkumar Prasant Pal Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF hypertree, Prüfer code, r-uniform, coding, counting
39Georg Gottlob, Reinhard Pichler Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Gianluigi Greco, Francesco Scarcello The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability. Search on Bibsonomy PODS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF structural decomposition methods, tree projections, local consistency
33Dániel Marx Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
33Francesco Scarcello, Georg Gottlob, Gianluigi Greco Uniform Constraint Satisfaction Problems and Database Theory. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Gianluigi Greco, Francesco Scarcello Tree Projections: Hypergraph Games and Minimality. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Xiangdong An 0001, Nick Cercone Iterative Multiagent Probabilistic Inference. Search on Bibsonomy IAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Francesco Scarcello Query answering exploiting structural properties. Search on Bibsonomy SIGMOD Rec. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Yueming Hu A Simulation Research on Multiprocessor Interconnection Networks With Wormhole Routing. Search on Bibsonomy APDC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Chun-Hung Tzeng A Probability Propagation in Hypertrees. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
26Sajal K. Das 0001, Aisheng Mao Optimal Embeddings in the Hamming Cube Networks. Search on Bibsonomy Euro-Par The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hamming cube, hypertree, interconnection network, dilation, binary tree, Network embedding, incomplete hypercube, tree machine
23Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
23Matthias Lanzinger, Igor Razgon FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. Search on Bibsonomy STACS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
23André Schidler, Stefan Szeider Computing optimal hypertree decompositions with SAT. Search on Bibsonomy Artif. Intell. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Benjamin Scheidt, Nicole Schweikardt Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Matthias Lanzinger, Igor Razgon FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 Enhancing Datalog Reasoning with Hypertree Decompositions. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Benjamin Scheidt, Nicole Schweikardt Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. Search on Bibsonomy MFCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Xinyue Zhang, Pan Hu 0001, Yavor Nenov, Ian Horrocks 0001 Enhancing Datalog Reasoning with Hypertree Decompositions. Search on Bibsonomy IJCAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Search on Bibsonomy Electron. J. Comb. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus Incremental Updates of Generalized Hypertree Decompositions. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider Threshold Treewidth and Hypertree Width. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Igor Razgon FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider Threshold Treewidth and Hypertree Width. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Guillaume 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 CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus Incremental Updates of Generalized Hypertree Decompositions. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Yun 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 Complex. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Gholam Hassan Shirdel, B. Vaez-Zadeh Finding a minimal spanning hypertree of a weighted hypergraph. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Hao Zhou, Gongshen Liu, Kewei Tu Improving Constituent Representation with Hypertree Neural Networks. Search on Bibsonomy NAACL-HLT The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. Search on Bibsonomy PODS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Guillaume 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 NeurIPS The full citation details ... 2022 DBLP  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon Complexity Analysis of Generalized and Fractional Hypertree Decompositions. Search on Bibsonomy J. ACM The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales Every Steiner triple system contains almost spanning d-ary hypertree. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
23André Schidler, Stefan Szeider Computing Optimal Hypertree Decompositions with SAT. Search on Bibsonomy IJCAI The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Alexandre Morimitsu, Nicolas Passat, Wonder Alexandre Luz Alves, Ronaldo Fumio Hashimoto Efficient component-hypertree construction based on hierarchy of partitions. Search on Bibsonomy Pattern Recognit. Lett. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon Complexity Analysis of General and Fractional Hypertree Decompositions. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
23André Schidler, Stefan Szeider Computing Optimal Hypertree Decompositions. Search on Bibsonomy ALENEX The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider Threshold Treewidth and Hypertree Width. Search on Bibsonomy IJCAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Cem Okulmus, Reinhard Pichler Parallel Computation of Generalized Hypertree Decompositions. Search on Bibsonomy AMW The full citation details ... 2019 DBLP  BibTeX  RDF
23Andrew Hundt, Varun Jain, Chris Paxton, Gregory D. Hager Training Frankenstein's Creature to Stack: HyperTree Architecture Search. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra Hypertree Decompositions Revisited for PGMs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra Hypertree Decompositions Revisited for PGMs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23Nikola Yolov Minor-matching hypertree width. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Wolfgang Fischl, Georg Gottlob, Reinhard Pichler General and Fractional Hypertree Decompositions: Hard and Easy Cases. Search on Bibsonomy PODS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Francesco Scarcello From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions. Search on Bibsonomy SEBD The full citation details ... 2018 DBLP  BibTeX  RDF
23Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider An SMT Approach to Fractional Hypertree Width. Search on Bibsonomy CP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Wolfgang Fischl, Georg Gottlob, Reinhard Pichler General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). Search on Bibsonomy AMW The full citation details ... 2018 DBLP  BibTeX  RDF
23Nikola Yolov Minor-matching hypertree width. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
23Ke Liu 0006, Sven Löffler, Petra Hofstedt Hypertree Decomposition: The First Step Towards Parallel Constraint Solving. Search on Bibsonomy DECLARE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Ke Liu 0006, Sven Löffler, Petra Hofstedt Using Hypertree Decomposition for Parallel Constraint Solving. Search on Bibsonomy GI-Jahrestagung The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
23Zineb Habbas, Kamal Amroun, Daniel Singer Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints. Search on Bibsonomy RAIRO Oper. Res. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Yang Xiang 0004, Kamala Srinivasan Privacy preserving existence recognition and construction of hypertree agent organization. Search on Bibsonomy Auton. Agents Multi Agent Syst. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Kamal Amroun, Zineb Habbas, Wassila Aggoune-Mtalaa A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems. Search on Bibsonomy AI Commun. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Wolfgang Fischl, Georg Gottlob, Reinhard Pichler General and Fractional Hypertree Decompositions: Hard and Easy Cases. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
23Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello Hypertree Decompositions: Questions and Answers. Search on Bibsonomy PODS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Zineb 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 J. Exp. Theor. Artif. Intell. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Manas Joglekar, Rohan Puttagunta, Christopher Ré Aggregations over Generalized Hypertree Decompositions. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
23Tian Liu 0001, Chaoyi Wang, Ke Xu 0001 Large hypertree width for sparse random hypergraphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Lin 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 CLOUD The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Susan Tu, Christopher Ré DunceCap: Query Plans Using Generalized Hypertree Decompositions. Search on Bibsonomy SIGMOD Conference The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Gianluigi Greco, Francesco Scarcello Treewidth and Hypertree Width. Search on Bibsonomy Tractability The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Yang Xiang 0004, Kamala Srinivasan Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree. Search on Bibsonomy Canadian AI The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Yang Xiang 0004, Kamala Srinivasan Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization. Search on Bibsonomy Canadian AI The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Chaoyi Wang, Tian Liu 0001, Ke Xu 0001 Large Hypertree Width for Sparse Random Hypergraphs. Search on Bibsonomy FAW-AAIM The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Isolde Adler, Tomas Gavenciak, Tereza Klimosová Hypertree-depth and minors in hypergraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
23Zineb Habbas, Kamal Amroun, Daniel Singer Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition. Search on Bibsonomy ICAART (1) The full citation details ... 2011 DBLP  BibTeX  RDF
23Isabel 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 IMAGAPP/IVAPP The full citation details ... 2011 DBLP  BibTeX  RDF
23Dániel Marx Approximating fractional hypertree width. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Takuro Fukunaga Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Abdelmalek Ait-Amokhtar, Kamal Amroun, Zineb Habbas Hypertree Decomposition for Solving Constraint Satisfaction Problems. Search on Bibsonomy ICAART The full citation details ... 2009 DBLP  BibTeX  RDF
23Mohammed Lalou, Zineb Habbas, Kamal Amroun Solving Hypertree Structured CSP: Sequential and Parallel Approaches. Search on Bibsonomy RCRA@AI*IA The full citation details ... 2009 DBLP  BibTeX  RDF
23Sergio 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 CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
23Rina Dechter, Lars Otten, Radu Marinescu 0002 On the Practical Significance of Hypertree vs. TreeWidth. Search on Bibsonomy ECAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Isolde Adler, Georg Gottlob, Martin Grohe Hypertree width and related hypergraph invariants. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Francesco Scarcello, Gianluigi Greco, Nicola Leone Weighted hypertree decompositions and optimal query plans. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Georg Gottlob, Marko Samer A Backtracking-Based Algorithm for Computing Hypertree-Decompositions Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
23Isolde Adler Width functions for hypertree decompositions (Weitefunktionen für Hyperbaumzerlegungen) Search on Bibsonomy 2006   RDF
Displaying result #1 - #100 of 141 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license