On the public citation graph

Max-Sat with Cardinality Constraint Parameterized by the Number of Clauses

0 signed · 12 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/978-3-319-94776-1_62openalex-snapshot
Hitting and Covering Partially
inferredcites →https://doi.org/10.1007/s00224-007-1309-3openalex-snapshot
Parameterized Complexity of Vertex Cover Variants
inferredcites →https://doi.org/10.1007/s00453-001-0019-5openalex-snapshot
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint
inferredcites →https://doi.org/10.1016/j.tcs.2018.10.030openalex-snapshot
FPT algorithms for domination in sparse graphs and beyond
inferredcites →https://doi.org/10.1016/s0020-0190(02)00434-9openalex-snapshot
Computing small partial coverings
inferredcites →https://doi.org/10.1137/1.9781611977554.ch143openalex-snapshot
Parameterized Approximation Scheme for Biclique-free Max k -Weight SAT and Max Coverage
inferredcites →https://doi.org/10.1145/2650261openalex-snapshot
Kernelization Lower Bounds Through Colors and IDs
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1609/aaai.v26i1.8373openalex-snapshot
MAXSAT Heuristics for Cost Optimal Planning
inferredcites →https://doi.org/10.1613/jair.5128openalex-snapshot
Optimal Partial-Order Plan Relaxation via MaxSAT
inferredcites →https://doi.org/10.1613/jair.5628openalex-snapshot
Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
inferredcites →https://doi.org/10.48550/arxiv.1910.11850openalex-snapshot
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum $k$-Coverage, Unique Set Cover and Related Problems (via $t$-Wise Agreement Testing Theorem)
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.