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: A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
10: Graphical Model Sketch
11: Exploring Dynamic Environments Using Stochastic Search Strategies
12: Graph Wavelets via Sparse Cuts: Extended Version
13: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
14: A Distributed $(2+\epsilon)$-Approximation for Vertex Cover in $O(\log{\Delta}/\epsilon\log\log{\Delta})$ Rounds
15: Fast Distributed Algorithms for Testing Graph Properties
16: Parallel Shortest-Paths Using Radius Stepping
17: Efficient Call Path Detection for Android-OS Size of Huge Source Code
18: Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort
19: Deterministic graph connectivity in the broadcast congested clique
20: Spectral Alignment of Graphs
21: Haplotype Inference for Pedigrees with Few Recombinations
22: Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs
23: Machine olfaction using time scattering of sensor multiresolution graphs
24: The triangle scheduling problem
25: Fast Computation of the Kinship Coefficients
26: Linear Separability in Spatial Databases
27: Randomized approximate nearest neighbor search with limited adaptivity