1: A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
2: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
3: Pricing Randomized Allocations
4: PTAS for k-tour cover problem on the plane for moderately large values of k
5: New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs
6: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
7: Decomposition width - a new width parameter for matroids
8: An efficient quantum search engine on unsorted database
9: Approximate counting with a floating-point counter
10: Counting Paths and Packings in Halves
11: Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method
12: Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard
13: On the Complexity of Submodular Function Minimisation on Diamonds
14: On evaluation of permanents