We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...