On the public citation graph
Hypertree-Width and Related Hypergraph Invariants
0 signed · 17 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.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.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
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.1017/cbo9780511662119.006openalex-snapshot
Tree Width and Tangles: A New Connectivity Measure and Some Applications
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/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/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.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1051/ro/2015017openalex-snapshot
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints
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/1265530.1265533openalex-snapshot
Generalized hypertree decompositions
inferred← citeshttps://doi.org/10.1145/1568318.1568320openalex-snapshot
Generalized hypertree decompositions: NP-hardness and tractable variants
inferred← citeshttps://doi.org/10.3233/aic-150694openalex-snapshot
A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems
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.