1: PolyAdd: Polynomial Formal Verification of Adder Circuits
2: A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost $\widetilde{O}(m^{4/3})$ Time
3: A Fast Randomized Algorithm for Finding the Maximal Common Subsequences
4: A Lightweight Algorithm to Uncover Deep Relationships in Data Tables
5: Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
6: Finding Diverse Trees, Paths, and More
7: Attribute Privacy: Framework and Mechanisms
8: Adwords in a Panorama
9: Sensitivity Analysis of the Maximum Matching Problem
10: Diverse Pairs of Matchings
11: A performance study of some approximation algorithms for minimum dominating set in a graph
12: Backtracking algorithms for constructing the Hamiltonian decomposition of a 4-regular multigraph
13: A Normal Sequence Compressed by PPM$^(star)$ but not by Lempel-Ziv 78
14: Revisiting Tardos’s Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
15: Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
16: Near-linear Size Hypergraph Cut Sparsifiers
17: On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
18: Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults
19: Robust production planning with budgeted cumulative demand uncertainty
20: Terminating cases of flooding
21: On Achieving Leximin Fairness and Stability in Many-to-One Matchings
22: Optimization over Young Diagrams
23: Simple, Deterministic, Constant-Round Coloring in the Congested Clique
24: On Fault Tolerant Feedback Vertex Set
25: Cut-Equivalent Trees are Optimal for Min-Cut Queries
26: Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching
27: Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent