1: Independent sets and cuts in large-girth regular graphs
2: Metric Dimension of Bounded Tree-length Graphs
3: Scalability and Total Recall with Fast CoveringLSH
4: Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
5: On Determining if Tree-based Networks Contain Fixed Trees
6: Combinatorial Scoring of Phylogenetic Networks
7: A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
8: RECKONER: Read Error Corrector Based on KMC
9: Graphical Model Sketch
10: Exploring Dynamic Environments Using Stochastic Search Strategies
11: Graph Wavelets via Sparse Cuts: Extended Version
12: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
13: A Distributed $(2+\epsilon)$-Approximation for Vertex Cover in $O(\log{\Delta}/\epsilon\log\log{\Delta})$ Rounds
14: Fast Distributed Algorithms for Testing Graph Properties
15: Parallel Shortest-Paths Using Radius Stepping
16: Efficient Call Path Detection for Android-OS Size of Huge Source Code
17: Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort
18: Deterministic graph connectivity in the broadcast congested clique
19: Spectral Alignment of Graphs
20: Haplotype Inference for Pedigrees with Few Recombinations
21: Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs
22: Machine olfaction using time scattering of sensor multiresolution graphs
23: The triangle scheduling problem
24: Fast Computation of the Kinship Coefficients
25: Linear Separability in Spatial Databases
26: Randomized approximate nearest neighbor search with limited adaptivity