1: A unified approach to truthful scheduling on related machines
2: Memory Efficient De Bruijn Graph Construction
3: Approximate Counting via Correlation Decay on Planar Graphs
4: Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
5: Approximating the diameter of a graph
6: Light Spanner and Monotone Tree
7: Largenet2: an object-oriented programming library for simulating large adaptive networks
8: Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
9: An analytical comparison of coalescent-based multilocus methods: The three-taxon case
10: Designing FPT algorithms for cut problems using randomized contractions
11: Mechanism Design in Large Games: Incentives and Privacy
12: Approximating minimum-cost edge-covers of crossing biset-families
13: Faster SDP hierarchy solvers for local rounding algorithms
14: The Space Complexity of 2-Dimensional Approximate Range Counting
15: Equivalence between Priority Queues and Sorting in External Memory
16: Efficient Algorithms for Zeckendorf Arithmetic
17: Refined Quicksort asymptotics
18: Efficient Core Maintenance in Large Dynamic Graphs
19: Quick HyperVolume
20: Efficient LZ78 factorization of grammar compressed text
21: Exact Algorithms for Maximum Clique: a computational study
22: A 9k kernel for nonseparating independent set in planar graphs
23: Nonblocker in H-minor free graphs: kernelization meets discharging
24: The Fast Cauchy Transform and Faster Robust Linear Regression
25: A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
26: Testing Permanent Oracles – Revisited
27: A new algorithm for extracting a small representative subgraph from a very large graph
28: Kernel Bounds for Structural Parameterizations of Pathwidth
29: Matroid Secretary for Regular and Decomposable Matroids