On the public citation graph
On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
0 signed · 47 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/9781118033166openalex-snapshot
Optimization Methods for Logical Inference
inferredcites →https://doi.org/10.1006/inco.1995.1025openalex-snapshot
Resolution for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-1-4757-2714-2openalex-snapshot
Verification of Sequential and Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_8openalex-snapshot
On Boolean Models for Quantified Boolean Horn Formulas
inferredcites →https://doi.org/10.1007/bf00245296openalex-snapshot
On Fourier's algorithm for linear arithmetic constraints
inferredcites →https://doi.org/10.1007/bf01580222openalex-snapshot
Properties of vertex packing and independence system polyhedra
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferredcites →https://doi.org/10.1007/bf01585160openalex-snapshot
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0020-0190(88)90069-5openalex-snapshot
A simple parallel algorithm for finding a satisfying truth assignment to a 2-cnf formula
inferredcites →https://doi.org/10.1016/0020-0190(92)90199-6openalex-snapshot
A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
inferredcites →https://doi.org/10.1016/0020-0190(93)90038-bopenalex-snapshot
An efficiently solvable graph partition problem to which many problems are reducible
inferredcites →https://doi.org/10.1016/0024-3795(80)90162-7openalex-snapshot
A fast algorithm for solving systems of linear equations with two variables per equation
inferredcites →https://doi.org/10.1016/0097-3165(73)90004-6openalex-snapshot
Fourier-Motzkin elimination and its dual
inferredcites →https://doi.org/10.1016/0097-3165(76)90055-8openalex-snapshot
Fourier-Motzkin elimination extension to integer programming problems
inferredcites →https://doi.org/10.1016/0166-218x(83)90024-0openalex-snapshot
A characterisation of all feasible solutions to an integer program
inferredcites →https://doi.org/10.1137/0214016openalex-snapshot
The Computational Complexity of Simultaneous Diophantine Approximation Problems
inferredcites →https://doi.org/10.1137/s0097539791256325openalex-snapshot
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
inferredcites →https://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/291889.291900openalex-snapshot
Constraint-based array dependence analysis
inferredcites →https://doi.org/10.1145/321921.321936openalex-snapshot
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
inferredcites →https://doi.org/10.1145/322169.322179openalex-snapshot
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
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-030-35166-3_16openalex-snapshot
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_25openalex-snapshot
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_23openalex-snapshot
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_39openalex-snapshot
Analyzing Lattice Point Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/s00165-011-0186-3openalex-snapshot
Improved algorithms for optimal length resolution refutation in difference constraint systems
inferred← citeshttps://doi.org/10.1007/s00453-022-01048-1openalex-snapshot
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
inferred← citeshttps://doi.org/10.1007/s10107-024-02174-0openalex-snapshot
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
inferred← citeshttps://doi.org/10.1007/s10472-020-09703-5openalex-snapshot
On integer closure in a system of unit two variable per inequality constraints
inferred← citeshttps://doi.org/10.1007/s10817-009-9139-4openalex-snapshot
Optimal Length Resolution Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.1007/s10878-017-0176-3openalex-snapshot
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.001openalex-snapshot
A combinatorial algorithm for Horn programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.025openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.1155/2009/845804openalex-snapshot
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls
inferred← citeshttps://doi.org/10.21236/ada460032openalex-snapshot
On Solving Boolean Combinations of Generalized 2SAT Constraints
inferred← citeshttps://doi.org/10.3233/sat190030openalex-snapshot
On Solving Boolean Combinations of UTVPI Constraints
inferred← citeshttps://doi.org/10.33915/etd.3843openalex-snapshot
Analyzing Satisfiability and Refutability in Selected Constraint Systems
inferred← citeshttps://doi.org/10.33915/etd.430openalex-snapshot
Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02786openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
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.