On the public citation graph
Beyond Hypertree Width: Decomposition Methods Without Decompositions
0 signed · 72 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.1006/jcss.1995.1055openalex-snapshot
On the Expressive Power of Datalog: Tools and a Case Study
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.1007/11538363_17openalex-snapshot
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction
inferredcites →https://doi.org/10.1007/3-540-46135-3_21openalex-snapshot
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
inferredcites →https://doi.org/10.1007/978-1-4615-9385-0openalex-snapshot
Advances in Data Base Theory
inferredcites →https://doi.org/10.1007/978-1-4615-9385-0_4openalex-snapshot
A Decomposition Methodology for Cyclic Databases
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_9openalex-snapshot
Constraint Propagation as a Proof System
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/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/s0022-0000(03)00030-8openalex-snapshot
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181990openalex-snapshot
A dichotomy theorem for constraints on a three-element set
inferredcites →https://doi.org/10.1109/sfcs.2003.1238228openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/298514.298542openalex-snapshot
On the expressive power of datalog
inferredcites →https://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_5openalex-snapshot
The Structure of Tractable Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/11889205_11openalex-snapshot
Typed Guarded Decompositions for Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11889205_36openalex-snapshot
Constraint Satisfaction with Bounded Treewidth Revisited
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_20openalex-snapshot
Tradeoffs in the Complexity of Backdoor Detection
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
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-02029-2_9openalex-snapshot
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_21openalex-snapshot
Structural Tractability of Enumerating CSP Solutions
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_27openalex-snapshot
Structural Tractability of Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_7openalex-snapshot
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints
inferred← citeshttps://doi.org/10.1007/s00224-014-9543-yopenalex-snapshot
Structural Tractability of Counting of Solutions to Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/s00224-018-9884-zopenalex-snapshot
How Many Variables are Needed to Express an Existential Positive Query?
inferred← citeshttps://doi.org/10.1007/s00224-019-09924-0openalex-snapshot
A More General Theory of Static Approximations for Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/s10472-014-9407-9openalex-snapshot
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
inferred← citeshttps://doi.org/10.1007/s10559-018-0007-2openalex-snapshot
Finding a Given Number of Solutions to a System of Fuzzy Constraints*
inferred← citeshttps://doi.org/10.1007/s10601-012-9129-8openalex-snapshot
Structural tractability of enumerating CSP solutions
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.jcss.2010.04.003openalex-snapshot
Constraint satisfaction with succinctly specified relations
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.11.005openalex-snapshot
Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.003openalex-snapshot
Regularizing conjunctive features for classification
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.1145/1206035.1206036openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferred← citeshttps://doi.org/10.1145/1807085.1807127openalex-snapshot
The power of tree projections
inferred← citeshttps://doi.org/10.1145/2448496.2448508openalex-snapshot
Structural tractability of counting of solutions to conjunctive queries
inferred← citeshttps://doi.org/10.1145/2463664.2463671openalex-snapshot
Semantic acyclicity on graph databases
inferred← citeshttps://doi.org/10.1145/2594538.2594553openalex-snapshot
Does query evaluation tractability help query containment?
inferred← citeshttps://doi.org/10.1145/2636918openalex-snapshot
Constraint Solving via Fractional Edge Covers
inferred← citeshttps://doi.org/10.1145/2902251.2902302openalex-snapshot
Semantic Acyclicity Under Constraints
inferred← citeshttps://doi.org/10.1145/2933575.2933580openalex-snapshot
Semantically Acyclic Conjunctive Queries under Functional Dependencies
inferred← citeshttps://doi.org/10.1145/3137586.3137588openalex-snapshot
Semantic Optimization in Tractable Classes of Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3196959.3196962openalex-snapshot
General and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.1145/3294052.3319680openalex-snapshot
Regularizing Conjunctive Features for Classification
inferred← citeshttps://doi.org/10.1145/3424908openalex-snapshot
Semantic Optimization of Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3457374openalex-snapshot
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.1145/3517804.3524152openalex-snapshot
The Complexity of Conjunctive Queries with Degree 2
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:6)2007openalex-snapshot
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1205.3321openalex-snapshot
Tree Projections and Structural Decomposition Methods: The Power of Local Consistency and Larger Islands of Tractability
inferred← citeshttps://doi.org/10.48550/arxiv.1303.2059openalex-snapshot
Structural Tractability of Counting of Solutions to Conjunctive Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01366openalex-snapshot
Semantic Acyclicity Under Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01090openalex-snapshot
General and Fractional Hypertree Decompositions: Hard and Easy Cases
inferred← citeshttps://doi.org/10.48550/arxiv.1904.00934openalex-snapshot
A More General Theory of Static Approximations for Conjunctive Queries
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.26openalex-snapshot
Principles of Guarded Structural Indexing
inferred← citeshttps://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
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.