On the public citation graph

Satisfiability of co-nested formulas

https://doi.org/10.1007/bf01209713

0 signed · 20 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/bf02983372openalex-snapshot

Nested satisfiability

inferredcites →https://doi.org/10.1090/conm/147/01173openalex-snapshot

Induced minors and related problems

inferredcites →https://doi.org/10.1137/0205049openalex-snapshot

The Planar Hamiltonian Circuit Problem is NP-Complete

inferredcites →https://doi.org/10.1137/0211025openalex-snapshot

Planar Formulae and Their Uses

inferredcites →https://doi.org/10.1137/0404022openalex-snapshot

Noncrossing Subgraphs in Topological Layouts

inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot

Efficient Planarity Testing

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118835913.ch4openalex-snapshot

Bioconversion of Lignocellulosic Biomass for Bioethanol Production

inferred← citeshttps://doi.org/10.1007/10692760_11openalex-snapshot

Drawing Planar Partitions II: HH-Drawings

inferred← citeshttps://doi.org/10.1007/11750321_26openalex-snapshot

A New Lower Bound of Critical Function for (k,s)-SAT

inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_29openalex-snapshot

Hypergraph Reductions and Satisfiability Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_7openalex-snapshot

Strong Backdoors to Nested Satisfiability

inferred← citeshttps://doi.org/10.1007/bf01581727openalex-snapshot

Max Horn SAT and the minimum cut problem in directed hypergraphs

inferred← citeshttps://doi.org/10.1007/s10472-005-9000-3openalex-snapshot

New tractable classes for default reasoning from conditional knowledge bases

inferred← citeshttps://doi.org/10.1007/s10479-008-0502-3openalex-snapshot

Optimization and probabilistic satisfiability on nested and co-nested formulas

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.02.004openalex-snapshot

Computing unsatisfiable k -SAT instances with few occurrences per variable

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.016openalex-snapshot

Directed hypergraphs: Introduction and fundamental algorithms—A survey

inferred← citeshttps://doi.org/10.1023/a:1012332915908openalex-snapshot

Easy Cases of Probabilistic Satisfiability

inferred← citeshttps://doi.org/10.1137/s0895480104445745openalex-snapshot

A Note on Unsatisfiable k -CNF Formulas with Few Occurrences per Variable

inferred← citeshttps://doi.org/10.1145/276884.276917openalex-snapshot

Drawing planar partitions I

inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-18openalex-snapshot

Planar 3-SAT with a Clause/Variable Cycle

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.