Record link: 
http://hdl.handle.net/20.500.12708/217465
-
Title: 
Soft and Constrained Hypertree Width
en
Citation: 
Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., & Gottlob, G. (2025). Soft and Constrained Hypertree Width. Proceedings of the ACM on Management of Data (PACMMOD), 3(2), 1–25. https://doi.org/10.1145/3725251
-
Publisher DOI: 
10.1145/3725251
-
Publication Type: 
Article - Original Research Article
en
Language: 
English
-
Authors: 
Lanzinger, Matthias 
Okulmus, Cem 
Pichler, Reinhard 
Selzer, Alexander 
Gottlob, Georg 
-
Organisational Unit: 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Journal: 
Proceedings of the ACM on Management of Data (PACMMOD) 
-
Date (published): 
9-Jun-2025
-
Number of Pages: 
25
-
Publisher: 
ACM
-
Peer reviewed: 
Yes
-
Keywords: 
hypergraph decompositions; hypertree width; constrained decompositions
en
Project title: 
Decompose and Conquer: Fast Query Processing via Decomposition: ICT22-011 (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds) 
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
1020 - Informatik: 100%
-
Appears in Collections:
Article

Show full item record

Page view(s)

7
checked on Jul 28, 2025

Google ScholarTM

Check