1: On the Minimum Labelling Spanning bi-Connected Subgraph problem
2: A simpler sublinear algorithm for approximating the triangle count
3: Applying Sorting Networks to Synthesize Optimized Sorting Libraries
4: Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
5: Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems
6: Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence
7: Computing maximal autarkies with few and simple oracle queries
8: Network Filtering for Big Data: Triangulated Maximally Filtered Graph
9: Dominating induced matchings in graphs containing no long claw
10: Socio-Spatial Group Queries for Impromptu Activity Planning
11: Simultaneous straight-line drawing of a planar graph and its rectangular dual
12: Near-optimal RNA-Seq quantification
13: Refining the Analysis of Divide and Conquer: How and When
14: Polynomial enumeration of chordless cycles on cyclically orientable graphs
15: Adaptive Computation of the Klee’s Measure in High Dimensions
16: The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning
17: Quantum Eigenvalue Estimation for Irreducible Non-negative Matrices
18: A Holant Dichotomy: Is the FKT Algorithm Universal?
19: Efficient data hashing with structured binary embeddings
20: Streaming Property Testing of Visibly Pushdown Languages
21: Beating the random assignment on constraint satisfaction problems of bounded degree
22: Towards Real-Time Detection and Tracking of Spatio-Temporal Features: Blob-Filaments in Fusion Plasma
23: The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
24: Isomorphism Testing for Graphs of Bounded Rank Width