1: Constructing and sampling directed graphs with given degree sequences
2: The Push Algorithm for Spectral Ranking
3: Parameterized Complexity of Firefighting Revisited
4: Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
5: A brief overview on the BioPAX and SBML standards for formal presentation of complex biological knowledge
6: Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
7: An O(n^2) Time Algorithm for Alternating B"uchi Games
8: Testing first-order properties for subclasses of sparse graphs
9: A learning graph based quantum query algorithm for finding constant-size subgraphs
10: A Counterexample to rapid mixing of the Ge-Stefankovic Process
11: Parameterized Matching in the Streaming Model
12: Online Sum-Radii Clustering
13: Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots
14: Strong convergence of partial match queries in random quadtrees
15: A Regularity Measure for Context Free Grammars
16: Approximating Edit Distance in Near-Linear Time
17: Deterministic Feature Selection for $k$-means Clustering
18: SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process
19: Lower Bounds on the Complexity of MSO1 Model-Checking
20: Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling
21: LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems
22: Space-efficient Local Computation Algorithms