On the public citation graph

https://doi.org/10.2139/ssrn.4132993

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.2001.1809openalex-extracted
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1007/3-540-45655-4_60openalex-extracted
On Parameterized Enumeration
inferredcites →https://doi.org/10.1007/3-540-48224-5_58openalex-extracted
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
inferredcites →https://doi.org/10.1007/3-540-61332-3_153openalex-extracted
Reduction algorithms for constructing solutions in graphs with small treewidth
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-extracted
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_29openalex-extracted
Hypergraph Acyclicity and Propositional Model Counting
inferredcites →https://doi.org/10.1007/978-3-540-73671-4_2openalex-extracted
Computational Complexity
inferredcites →https://doi.org/10.1016/0004-3702(94)90003-5openalex-extracted
Decomposing constraint satisfaction problems using database techniques
inferredcites →https://doi.org/10.1016/j.ejc.2007.04.013openalex-extracted
Hypertree width and related hypergraph invariants
inferredcites →https://doi.org/10.1016/j.ipl.2012.05.005openalex-extracted
Some characterizations of γ and β-acyclicity of hypergraphs
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.039openalex-extracted
Satisfiability of acyclic and almost acyclic CNF formulas
inferredcites →https://doi.org/10.1016/s0166-218x(99)00184-5openalex-extracted
Upper bounds to the clique width of graphs
inferredcites →https://doi.org/10.1137/0210022openalex-extracted
Node-Deletion Problems on Bipartite Graphs
inferredcites →https://doi.org/10.1137/110859440openalex-extracted
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1145/2402.322390openalex-extracted
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/2535926openalex-extracted
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
inferredcites →https://doi.org/10.1145/2594538.2594547openalex-extracted
Beyond worst-case analysis for joins with minesweeper
inferredcites →https://doi.org/10.1145/2636918openalex-extracted
Constraint Solving via Fractional Edge Covers
inferredcites →https://doi.org/10.1145/2983573openalex-extracted
Hypergraph Acyclicity Revisited
inferredcites →https://doi.org/10.1145/3034786.3056105openalex-extracted
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
inferredcites →https://doi.org/10.1145/321033.321034openalex-extracted
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1613/jair.1683openalex-extracted
Pure Nash Equilibria: Hard and Easy Games
inferredcites →https://doi.org/10.1613/jair.4831openalex-extracted
Solving #SAT and MAXSAT by Dynamic Programming
inferredcites →https://doi.org/10.4230/lipics.csl.2012.137openalex-extracted
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
inferredcites →https://doi.org/10.4230/lipics.stacs.2015.143openalex-extracted
Understanding Model Counting for beta-acyclic CNF-formulas
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.