On the public citation graph

Matched Formulas and Backdoor Sets1

0 signed · 35 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.1007/11814948_36openalex-snapshot
Solving #SAT Using Vertex Covers
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
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/s10472-004-9432-1openalex-snapshot
Generalizations of Matched CNF Formulas
inferredcites →https://doi.org/10.1016/0097-3165(86)90060-9openalex-snapshot
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
inferredcites →https://doi.org/10.1016/0166-218x(84)90081-7openalex-snapshot
A simplified NP-complete satisfiability problem
inferredcites →https://doi.org/10.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.009openalex-snapshot
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.005openalex-snapshot
On finding short resolution refutations and small unsatisfiable subsets
inferredcites →https://doi.org/10.1016/s0166-218x(00)00245-6openalex-snapshot
On subclasses of minimal unsatisfiable formulas
inferredcites →https://doi.org/10.1016/s0166-218x(01)00358-4openalex-snapshot
A perspective on certain polynomial-time solvable classes of satisfiability
inferredcites →https://doi.org/10.1016/s0166-218x(02)00406-7openalex-snapshot
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
inferredcites →https://doi.org/10.1016/s0166-218x(96)00028-5openalex-snapshot
Variable and term removal from Boolean formulae
inferredcites →https://doi.org/10.1016/s0304-3975(01)00337-1openalex-snapshot
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1109/focs.2007.4389488openalex-snapshot
Parameterized Proof Complexity
inferredcites →https://doi.org/10.1109/sfcs.1998.743516openalex-snapshot
Which problems have strongly exponential complexity?
inferredcites →https://doi.org/10.3233/sat190032openalex-snapshot
An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas

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-319-96932-9_2openalex-snapshot
Genomic Interventions to Improve Resilience of Pigeonpea in Changing Climate
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_23openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_15openalex-snapshot
Backdoors to Satisfaction
inferred← citeshttps://doi.org/10.1007/978-981-16-7861-5_12openalex-snapshot
Potential of In-Field Rainwater Harvesting to Improve Resilience of Dryland Cropping in Smallholder Farms of Zimbabwe: A Review
inferred← citeshttps://doi.org/10.1007/s11816-013-0299-7openalex-snapshot
Advances in biotechnological applications in three important food legumes
inferred← citeshttps://doi.org/10.1007/s12298-022-01218-zopenalex-snapshot
Phenotypic evaluation of agronomic and root related traits for drought tolerance in recombinant inbred line population derived from a chickpea cultivar (C. arietinum L.) and its wild relative (C. reticulatum)
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.007openalex-snapshot
Backdoors into heterogeneous classes of SAT and CSP
inferred← citeshttps://doi.org/10.1080/21683565.2018.1537325openalex-snapshot
Classification of small-scale farmers for improved rainfall variability management in South Africa
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.1139/cjps-2020-0030openalex-snapshot
Characterization of tomato accessions for morphological, agronomic, fruit quality, and virus resistance traits
inferred← citeshttps://doi.org/10.1145/3243176.3243193openalex-snapshot
M emo D yn
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9111openalex-snapshot
Backdoors into Heterogeneous Classes of SAT and CSP
inferred← citeshttps://doi.org/10.24963/ijcai.2017/706openalex-snapshot
On Minimum Representations of Matched Formulas (Extended Abstract)
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-425openalex-snapshot
Fixed-Parameter Tractability
inferred← citeshttps://doi.org/10.3390/a12090189openalex-snapshot
Parameterised Enumeration for Modification Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5961openalex-snapshot
Backdoors to Abduction
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.