Seminal results establish that the coverability problem for Vector Addit...
In the Maximum Weight Independent Set of Rectangles problem (MWISR) we a...
In this paper, we study problems of connecting classes of points via
non...
In this paper, we consider a general notion of convolution. Let D be a
f...
In a classical scheduling problem, we are given a set of n jobs of unit
...
We prove that for any triangle-free intersection graph of n axis-paralle...
We revisit classic string problems considered in the area of parameteriz...
We study Koebe orderings of planar graphs: vertex orderings obtained by
...
Knapsack and Subset Sum are fundamental NP-hard problems in combinatoria...
The Isolation Lemma of Mulmuley, Vazirani and Vazirani [Combinatorica'87...
We revisit the classic task of finding the shortest tour of n points in
...
We present an 𝒪^⋆(2^0.5n) time and
𝒪^⋆(2^0.249999n) space randomized alg...
In the Bin Packing problem one is given n items with weights
w_1,…,w_n a...
For many algorithmic problems on graphs of treewidth t, a standard dynam...
Zwick's (1+ε)-approximation algorithm for the All Pairs Shortest
Path (A...
In the Equal-Subset-Sum problem, we are given a set S of n integers and
...
The subject of this paper is the time complexity of approximating Knapsa...
We present the Mim-Solution's approach to the RecSys Challenge 2016, whi...