On the public citation graph
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies
0 signed · 40 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.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_11openalex-snapshot
Network-Based Heuristics for Constraint-Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_24openalex-snapshot
Guiding SAT Diagnosis with Tree Decompositions
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1016/0004-3702(87)90002-6openalex-snapshot
Network-based heuristics for constraint-satisfaction problems
inferredcites →https://doi.org/10.1016/s1571-0653(04)00331-2openalex-snapshot
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
inferredcites →https://doi.org/10.1090/dimacs/026/25openalex-snapshot
Local search strategies for satisfiability testing
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/hldvt.2004.1431256openalex-snapshot
Dynamic analysis of constraint-variable dependencies to guide SAT diagnosis
inferredcites →https://doi.org/10.1109/hldvt.2004.1431257openalex-snapshot
Exploiting hypergraph partitioning for efficient Boolean satisfiability
inferredcites →https://doi.org/10.1109/iccad.1996.569607openalex-snapshot
GRASP-A new search algorithm for satisfiability
inferredcites →https://doi.org/10.1109/iccad.2004.1382629openalex-snapshot
Guiding CNF-SAT search via efficient constraint partitioning
inferredcites →https://doi.org/10.1109/tcad.2003.814960openalex-snapshot
Satometer: how much have we searched?
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/343647.343769openalex-snapshot
A BDD-based satisfiability infrastructure using the unate recursive paradigm
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/368434.368864openalex-snapshot
Improved algorithms for hypergraph bipartitioning
inferredcites →https://doi.org/10.1145/513918.514102openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferredcites →https://doi.org/10.1145/774572openalex-snapshot
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design - ICCAD '02
inferredcites →https://doi.org/10.48550/arxiv.1301.2253openalex-snapshot
Efficient Approximation for Triangulation of Minimum Treewidth
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-1-4614-3514-3_9openalex-snapshot
On Performance Modeling of Ad Hoc Opportunistic Routing Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/s10836-014-5452-xopenalex-snapshot
Learning-oriented Property Decomposition for Automated Generation of Directed Tests
inferred← citeshttps://doi.org/10.1080/17445760.2025.2576032openalex-snapshot
Clause connectivity and isolated solutions: a structural heuristic for SAT variable ordering
inferred← citeshttps://doi.org/10.1109/fpl53798.2021.00037openalex-snapshot
An FPGA-based Stochastic SAT Solver Leveraging Inter-Variable Dependencies
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319983openalex-snapshot
Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397256openalex-snapshot
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT
inferred← citeshttps://doi.org/10.1109/isqed.2009.4810323openalex-snapshot
Efficient SAT-based techniques for Design of Experiments by using static variable ordering
inferred← citeshttps://doi.org/10.1109/ssci47803.2020.9308295openalex-snapshot
The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise
inferred← citeshttps://doi.org/10.1109/tc.2011.46openalex-snapshot
A Native APIs Protection Mechanism in the Kernel Mode against Malicious Code
inferred← citeshttps://doi.org/10.1109/tc.2011.49openalex-snapshot
Property Learning Techniques for Efficient Generation of Directed Tests
inferred← citeshttps://doi.org/10.1109/vlsisoc.2009.6041334openalex-snapshot
Structural heuristics for SAT-based ATPG
inferred← citeshttps://doi.org/10.1145/3637528.3671627openalex-snapshot
GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
inferred← citeshttps://doi.org/10.1186/1687-1499-2013-237openalex-snapshot
TOAR: transmission-aware opportunistic ad hoc routing protocol
inferred← citeshttps://doi.org/10.5555/1326073.1326102openalex-snapshot
Exploiting hierarchy and structure to efficiently solve graph coloring as 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.