1: A polynomial 3-colorability algorithm with automatic generation of NO 3-colorability (i.e. Co-NP) short proofs
2: Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings
3: Matrix method for the multi salesmen problem (TSP) with several vehicles
4: `Lassoing’ a phylogenetic tree I: Basic properties, shellings, and covers
5: Combined Data Structure for Previous- and Next-Smaller-Values
6: Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms
7: Asymptotics of the chromatic number for quasi-line graphs
8: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
9: A New Data Layout For Set Intersection on GPUs
10: On Approximating Four Covering and Packing Problems
11: Algorithms for Silver Coloring of Generalized Petersen Graphs
12: A Polynomial Time Algorithm for a Special Case of Linear Integer Programming
13: Ranking-Based Black-Box Complexity
14: The complexity of approximate Nash equilibrium in congestion games with negative delays
15: One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay