
On the degree sequences of dual graphs on surfaces
Given two graphs G and G^* with a onetoone correspondence between thei...
read it

Envyfree Relaxations for Goods, Chores, and Mixed Items
In fair division problems, we are given a set S of m items and a set N o...
read it

Unique key Horn functions
Given a relational database, a key is a set of attributes such that a va...
read it

Generating clause sequences of a CNF formula
Given a CNF formula Φ with clauses C_1,...,C_m and variables V={x_1,...,...
read it

Approximating minimum representations of key Horn functions
Horn functions form a subclass of Boolean functions and appear in many d...
read it

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1Sperner hypergraphs
A hypergraph H is said to be 1Sperner if for every two hyperedges the s...
read it

On Quadratization of PseudoBoolean Functions
We survey current termwise techniques for quadratizing highdegree pseu...
read it

Quadratization of Symmetric PseudoBoolean Functions
A pseudoBoolean function is a realvalued function f(x)=f(x_1,x_2,...,x...
read it

Hardness Results for Approximate Pure Horn CNF Formulae Minimization
We study the hardness of approximation of clause minimum and literal min...
read it
Endre Boros
is this you? claim profile
Distinguished Professor at Rutgers University and Director of Rutgers Center for Operations Research