1: Between Treewidth and Clique-width
2: Parameterized Complexity of Bandwidth on Trees
3: Parameterized Streaming Algorithms for Vertex Cover
4: Un algorithme de test pour la connexit'e temporelle des graphes dynamiques de faible densit'e
5: On Hardness of Jumbled Indexing
6: Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection
7: An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph
8: Parallel computation using active self-assembly
9: Unique Games on the Hypercube
10: Single machine slack due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity
11: Hardness of Graph Pricing through Generalized Max-Dicut
12: Finding a Curve in a Point Set
13: A note on the ring loading problem
14: On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy
15: Density decompositions of networks
16: On Computing Maximal Independent Sets of Hypergraphs in Parallel
17: The Huge Multiway Table Problem
18: Efficient Compressed Wavelet Trees over Large Alphabets
19: A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines
20: Time-Inconsistent Planning: A Computational Problem in Behavioral Economics
21: Computing the permanent of (some) complex matrices
22: A unified framework for linear dimensionality reduction in L1
23: Streaming Kernelization
24: A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem