Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Satisfiability Problems with a Linear Structure   It was recently shown \cite{STV} that satisfiability is polynomially solvable
when the incidence graph is an interval bipartite graph (an interval graph
turned into a bipartite graph by omitting all edges within each partite set).
Here we relax this condition in several directions: First, we show that it
holds for $k$-interval bigraphs, bipartite graphs which can be converted to
interval bipartite graphs by adding to each node of one side at most $k$ edges;
the same result holds for the counting and the weighted maximization version of
satisfiability. Second, given two linear orders, one for the variables and one
for the clauses, we show how to find, in polynomial time, the smallest $k$ such
that there is a $k$-interval bigraph compatible with these two orders. On the
negative side we prove that, barring complexity collapses, no such extensions
are possible for CSPs more general than satisfiability. We also show
NP-hardness of recognizing 1-interval bigraphs.

19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc