On the public citation graph

Backdoors into heterogeneous classes of SAT and CSP

0 signed · 58 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-snapshot
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-10428-7_18openalex-snapshot
On Backdoors to Tractable Constraint Languages
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_12openalex-snapshot
Matched Formulas and Backdoor Sets
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_20openalex-snapshot
Tradeoffs in the Complexity of Backdoor Detection
inferredcites →https://doi.org/10.1007/978-3-540-79719-7_16openalex-snapshot
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_9openalex-snapshot
Backdoors in the Context of Learning
inferredcites →https://doi.org/10.1007/978-3-642-30891-8openalex-snapshot
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday
inferredcites →https://doi.org/10.1007/978-3-642-30891-8_15openalex-snapshot
Backdoors to Satisfaction
inferredcites →https://doi.org/10.1007/s00012-015-0327-2openalex-snapshot
Characterizations of several Maltsev conditions
inferredcites →https://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferredcites →https://doi.org/10.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1016/j.artint.2012.03.002openalex-snapshot
Augmenting tractable fragments of abstract argumentation
inferredcites →https://doi.org/10.1016/j.artint.2018.10.002openalex-snapshot
Backdoors to Planning
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.003openalex-snapshot
Constraint satisfaction with bounded treewidth revisited
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1109/focs.2013.59openalex-snapshot
Strong Backdoors to Bounded Treewidth SAT
inferredcites →https://doi.org/10.1109/focs16189.2009openalex-snapshot
2009 50th Annual IEEE Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1137/050628957openalex-snapshot
A Simple Algorithm for Mal'tsev Constraints
inferredcites →https://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferredcites →https://doi.org/10.1137/1.9781611974331openalex-snapshot
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/1.9781611974331.ch114openalex-snapshot
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/2556646openalex-snapshot
Constraint Satisfaction Problems Solvable by Local Consistency Methods
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/2677161.2677165openalex-snapshot
Constraint satisfaction problem and universal algebra
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1609/aaai.v28i1.9111openalex-snapshot
Backdoors into Heterogeneous Classes of SAT and CSP
inferredcites →https://doi.org/10.1609/aaai.v29i1.9662openalex-snapshot
Variable-Deletion Backdoors to Planning
inferredcites →https://doi.org/10.1613/jair.3651openalex-snapshot
The Tractability of CSP Classes Defined by Forbidden Patterns
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-425openalex-snapshot
Fixed-Parameter Tractability
inferredcites →https://doi.org/10.3233/faia336openalex-snapshot
Handbook of Satisfiability
inferredcites →https://doi.org/10.3233/sat190059openalex-snapshot
Matched Formulas and Backdoor Sets1
inferredcites →https://doi.org/10.4230/lipics.stacs.2017.36openalex-snapshot
Combining Treewidth and Backdoors for CSP
inferredcites →https://doi.org/10.48550/arxiv.1304.5961openalex-snapshot
Backdoors to Abduction
inferredcites →https://doi.org/10.48550/arxiv.1507.05463openalex-snapshot
Solving Problems on Graphs of High Rank-Width
inferredcites →https://doi.org/10.5555/2884435.2884549openalex-snapshot
Discovering archipelagos of tractability for constraint satisfaction and counting

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_10openalex-snapshot
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_18openalex-snapshot
On Backdoors to Tractable Constraint Languages
inferred← citeshttps://doi.org/10.1007/s00453-020-00758-8openalex-snapshot
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
inferred← citeshttps://doi.org/10.1007/s10472-021-09730-wopenalex-snapshot
Parameterised complexity of model checking and satisfiability in propositional dependence logic
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s10601-023-09362-3openalex-snapshot
CSP beyond tractable constraint languages
inferred← citeshttps://doi.org/10.1007/s13748-021-00234-6openalex-snapshot
Existence versus exploitation: the opacity of backdoors and backbones
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.002openalex-snapshot
Backdoors to Planning
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103561openalex-snapshot
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100868openalex-snapshot
Backdoors to satisfaction continued
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103520openalex-snapshot
SAT backdoors: Depth beats size
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103547openalex-snapshot
Backdoor DNFs
inferred← citeshttps://doi.org/10.1145/3655024openalex-snapshot
Strong Backdoors for Default Logic
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16800openalex-snapshot
Parameterized Complexity of Small Decision Tree Learning
inferred← citeshttps://doi.org/10.1613/jair.1.13787openalex-snapshot
Computational Short Cuts in Infinite Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.24963/ijcai.2017/85openalex-snapshot
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
inferred← citeshttps://doi.org/10.24963/ijcai.2021/194openalex-snapshot
Backdoor DNFs
inferred← citeshttps://doi.org/10.24963/ijcai.2023/355openalex-snapshot
Learning Small Decision Trees with Large Domain
inferred← citeshttps://doi.org/10.24963/kr.2020/40openalex-snapshot
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
inferred← citeshttps://doi.org/10.3390/a12090189openalex-snapshot
Parameterised Enumeration for Modification Problems
inferred← citeshttps://doi.org/10.5555/2884435.2884549openalex-snapshot
Discovering archipelagos of tractability for constraint satisfaction and counting
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.