On the public citation graph
Automated Generation of Simplification Rules for SAT and MAXSAT
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45995-2openalex-snapshot
LATIN 2002: Theoretical Informatics
inferredcites →https://doi.org/10.1007/3-540-45995-2_32openalex-snapshot
Improved Exact Algorithms for Max-Sat
inferredcites →https://doi.org/10.1007/3-540-46632-0_26openalex-snapshot
Upper Bounds for MaxSat: Further Improved
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_22openalex-snapshot
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms
inferredcites →https://doi.org/10.1007/s00453-004-1090-5openalex-snapshot
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
inferredcites →https://doi.org/10.1007/s10958-005-0101-7openalex-snapshot
A 2|E|/4-time algorithm for MAX-CUT
inferredcites →https://doi.org/10.1023/a:1006340920104openalex-snapshot
New Worst-Case Upper Bounds for SAT
inferredcites →https://doi.org/10.7146/brics.v10i30.21798openalex-snapshot
New Algorithms for Exact Satisfiability
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-0-387-30162-4_133openalex-snapshot
Exact Algorithms for General CNF SAT
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_133openalex-snapshot
Exact Algorithms for General CNF SAT
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_12openalex-snapshot
Generating Faster Algorithms for d-Path Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_4openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_2openalex-snapshot
Improved MaxSAT Algorithms for Instances of Degree 3
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_7openalex-snapshot
An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_21openalex-snapshot
New Bounds for MAX-SAT by Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_133-2openalex-snapshot
Exact Algorithms for General CNF SAT
inferred← citeshttps://doi.org/10.1007/s00224-014-9600-6openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/s10878-019-00421-1openalex-snapshot
An improved algorithm for the $$(n, 3)$$-MaxSAT problem: asking branchings to satisfy the clauses
inferred← citeshttps://doi.org/10.1007/s10958-012-1101-zopenalex-snapshot
A new upper bound for (n, 3)-MAX-SAT
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.008openalex-snapshot
Resolution and linear CNF formulas: Improved (n,3)-MaxSAT algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.011openalex-snapshot
Improved exact algorithms for mildly sparse instances of Max SAT
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1515/dma.2009.009openalex-snapshot
New upper bounds for the problem of maximal satisfiability
inferred← citeshttps://doi.org/10.4213/dm1043openalex-snapshot
Новые верхние оценки для задачи максимальной выполнимости
inferred← citeshttps://doi.org/10.5555/1109557.1109559openalex-snapshot
A new approach to proving upper bounds for MAX-2-SAT
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.