On the public citation graph
Hypertree Decompositions: Structure, Algorithms, and Applications
0 signed · 100 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.20025openalex-snapshot
Marshals, monotone marshals, and hypertree‐width
inferredcites →https://doi.org/10.1006/jcss.2000.1713openalex-snapshot
Conjunctive-Query Containment and Constraint Satisfaction
inferredcites →https://doi.org/10.1006/jcss.2001.1809openalex-snapshot
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1006/jctb.1993.1027openalex-snapshot
Graph Searching and a Min-Max Theorem for Tree-Width
inferredcites →https://doi.org/10.1007/3-540-48309-8_1openalex-snapshot
On Tractable Queries and Constraints
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_11openalex-snapshot
Network-Based Heuristics for Constraint-Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-1-4615-9385-0_4openalex-snapshot
A Decomposition Methodology for Cyclic Databases
inferredcites →https://doi.org/10.1016/0004-3702(87)90002-6openalex-snapshot
Network-based heuristics for constraint-satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(89)90037-4openalex-snapshot
Tree clustering for constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(94)90003-5openalex-snapshot
Decomposing constraint satisfaction problems using database techniques
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1016/j.ejc.2007.04.013openalex-snapshot
Hypertree width and related hypergraph invariants
inferredcites →https://doi.org/10.1016/s0004-3702(00)00078-3openalex-snapshot
A comparison of structural CSP decomposition methods
inferredcites →https://doi.org/10.1016/s0304-3975(01)00108-6openalex-snapshot
Computing LOGCFL certificates
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511662119.006openalex-snapshot
Tree Width and Tangles: A New Connectivity Measure and Some Applications
inferredcites →https://doi.org/10.1137/s0097539701396807openalex-snapshot
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases
inferredcites →https://doi.org/10.1287/ijoc.15.3.233.16078openalex-snapshot
Tour Merging via Branch-Decomposition
inferredcites →https://doi.org/10.1613/jair.1683openalex-snapshot
Pure Nash Equilibria: Hard and Easy Games
inferredcites →https://doi.org/10.4018/978-1-59904-849-9openalex-snapshot
Encyclopedia of Artificial Intelligence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1804openalex-snapshot
Distributed backtracking algorithm based on tree decomposition over wireless sensor networks
inferred← citeshttps://doi.org/10.1007/11847250_21openalex-snapshot
The Parameterized Complexity of Enumerating Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/11889205_36openalex-snapshot
Constraint Satisfaction with Bounded Treewidth Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_2openalex-snapshot
Cross-Model Conjunctive Queries over Relation and Tree-Structured Data
inferred← citeshttps://doi.org/10.1007/978-3-319-00080-0_4openalex-snapshot
Some Particular Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_29openalex-snapshot
Treewidth and Pure Nash Equilibria
inferred← citeshttps://doi.org/10.1007/978-3-319-61893-7_15openalex-snapshot
Structural Decomposition Methods: Key Notions and Database Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-73305-0_9openalex-snapshot
Optimizing Answer Set Computation via Heuristic-Based Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_7openalex-snapshot
Uniform Constraint Satisfaction Problems and Database Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_35openalex-snapshot
Myhill-Nerode Methods for Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00224-017-9811-8openalex-snapshot
It’s All a Matter of Degree
inferred← citeshttps://doi.org/10.1007/s00453-015-9977-xopenalex-snapshot
Myhill–Nerode Methods for Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10489-022-04361-yopenalex-snapshot
HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.034openalex-snapshot
Efficiently enumerating minimal triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.04.013openalex-snapshot
Hypertree width and related hypergraph invariants
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.010openalex-snapshot
Weighted hypertree decompositions and optimal query plans
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.04.003openalex-snapshot
Constraint satisfaction with bounded treewidth revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.010openalex-snapshot
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
inferred← citeshttps://doi.org/10.1017/s1471068419000036openalex-snapshot
Optimizing Answer Set Computation via Heuristic-Based Decomposition
inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00053openalex-snapshot
Efficient Approximation of Fractional Hypertree Width
inferred← citeshttps://doi.org/10.1109/icde.2018.00048openalex-snapshot
LevelHeaded: A Unified Engine for Business Intelligence and Linear Algebra Querying
inferred← citeshttps://doi.org/10.1109/icde.2019.00183openalex-snapshot
HyMJ: A Hybrid Structure-Aware Approach to Distributed Multi-way Join Query
inferred← citeshttps://doi.org/10.1109/ictai.2018.00115openalex-snapshot
Sum-of-Products with Default Values: Algorithms and Complexity Results
inferred← citeshttps://doi.org/10.1137/080743226openalex-snapshot
Approximating Width Parameters of Hypergraphs with Excluded Minors
inferred← citeshttps://doi.org/10.1137/1.9781611976007openalex-snapshot
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX)
inferred← citeshttps://doi.org/10.1145/1084805.1084827openalex-snapshot
Query answering exploiting structural properties
inferred← citeshttps://doi.org/10.1145/1721837.1721845openalex-snapshot
Approximating fractional hypertree width
inferred← citeshttps://doi.org/10.1145/2582112.2582124openalex-snapshot
The limited blessing of low dimensionality
inferred← citeshttps://doi.org/10.1145/2636918openalex-snapshot
Constraint Solving via Fractional Edge Covers
inferred← citeshttps://doi.org/10.1145/3034786.3056109openalex-snapshot
Efficiently Enumerating Minimal Triangulations
inferred← citeshttps://doi.org/10.1145/3035918.3064027openalex-snapshot
The Dynamic Yannakakis Algorithm
inferred← citeshttps://doi.org/10.1145/3197384openalex-snapshot
Finite-State Map-Reduce Computation and Relational Algebra Queries
inferred← citeshttps://doi.org/10.1145/3294052.3319678openalex-snapshot
Ranked Enumeration of Minimal Triangulations
inferred← citeshttps://doi.org/10.1145/3294052.3319698openalex-snapshot
Instance and Output Optimal Parallel Algorithms for Acyclic Joins
inferred← citeshttps://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
inferred← citeshttps://doi.org/10.1145/3514221.3517830openalex-snapshot
Conjunctive Queries with Comparisons
inferred← citeshttps://doi.org/10.1145/3604437.3604450openalex-snapshot
Conjunctive Queries with Comparisons
inferred← citeshttps://doi.org/10.1145/3622758openalex-snapshot
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
inferred← citeshttps://doi.org/10.1145/3622758.3622887openalex-snapshot
Scalable Spreadsheet-Driven End-User Applications with Incremental Computation
inferred← citeshttps://doi.org/10.1145/3725296openalex-snapshot
Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized
inferred← citeshttps://doi.org/10.1145/3799232openalex-snapshot
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
inferred← citeshttps://doi.org/10.14288/1.0052053openalex-snapshot
D-width, metric embedding, and their connections
inferred← citeshttps://doi.org/10.14778/3407790.3407797openalex-snapshot
Adopting worst-case optimal joins in relational database systems
inferred← citeshttps://doi.org/10.14778/3750601.3750642openalex-snapshot
Query Running Too Slow? Rewrite it with Quorion!
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10644openalex-snapshot
Going Beyond Primal Treewidth for (M)ILP
inferred← citeshttps://doi.org/10.1613/jair.1.12370openalex-snapshot
Sum-of-Products with Default Values: Algorithms and Complexity Results
inferred← citeshttps://doi.org/10.1613/jair.1.13661openalex-snapshot
Threshold Treewidth and Hypertree Width
inferred← citeshttps://doi.org/10.24963/ijcai.2020/263openalex-snapshot
Threshold Treewidth and Hypertree Width
inferred← citeshttps://doi.org/10.24963/ijcai.2021/196openalex-snapshot
Computing Optimal Hypertree Decompositions with SAT
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-913openalex-snapshot
On the Practical Significance of Hypertree vs. TreeWidth
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2016.11openalex-snapshot
GYM: A Multiround Distributed Join Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1803openalex-snapshot
Approximating Acyclicity Parameters of Sparse Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4156openalex-snapshot
GYM: A Multiround Join Algorithm In MapReduce
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02368openalex-snapshot
EmptyHeaded: A Relational Engine for Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07532openalex-snapshot
Aggregations over Generalized Hypertree Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1602.08721openalex-snapshot
Flexible Caching in Trie Joins
inferred← citeshttps://doi.org/10.48550/arxiv.1605.06704openalex-snapshot
Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles)
inferred← citeshttps://doi.org/10.48550/arxiv.1804.01640openalex-snapshot
Hypertree Decompositions Revisited for PGMs
inferred← citeshttps://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferred← citeshttps://doi.org/10.5555/1496770.1496868openalex-snapshot
Approximating fractional hypertree width
inferred← citeshttps://doi.org/10.70675/a4e03b4bz812cz48cdzaceez9a6f8a20f63eopenalex-snapshot
Hypergraphes partiels de largeur bornée, décompositions arborescentes et contraintes globales
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.