|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 21 occurrences of 12 keywords
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
214 | 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 |
|
192 | 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 |
|
181 | 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 |
|
159 | 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 |
|
150 | 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 |
120 | 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 |
109 | 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 |
|
88 | 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 |
|
77 | 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 |
|
77 | 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 |
77 | 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 |
77 | 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 |
|
71 | 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 |
|
66 | 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 |
55 | 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 |
|
44 | 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 |
|
44 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 33(2), pp. 351-378, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | 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 |
44 | 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 |
|
38 | Dietmar Berwanger, Erich Grädel |
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, pp. 209-223, 2004, Springer, 3-540-25236-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | 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 |
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | 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 |
|
33 | Hubie Chen, Víctor Dalmau |
Beyond Hypertree Width: Decomposition Methods Without Decompositions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0505035, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
33 | Isolde Adler |
Marshals, monotone marshals, and hypertree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 47(4), pp. 275-296, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 66(4), pp. 775-808, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEBD ![In: Nono Convegno Nazionale Sistemi Evoluti per Basi di Dati, SEBD 2001, Venezia, Italy, 27-29 Giugno 2001, pp. 147-154, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
22 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Pure Nash equilibria: hard and easy games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), Bloomington, Indiana, USA, June 20-22, 2003, pp. 215-230, 2003, ACM, 1-58113-731-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|