1: Stochastic Input Models in Online Computing
2: Polynomial Cases for the Vertex Coloring Problem
3: Exact Computation of a Manifold Metric, via Lipschitz Embeddings and Shortest Paths on a Graph
4: Planar Graph Perfect Matching is in NC
5: NC Algorithms for Weighted Planar Perfect Matching and Related Problems
6: An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures
7: Disabling External Influence in Social Networks via Edge Recommendation
8: Combinatorial Optimization of AC Optimal Power Flow with Discrete Demands in Radial Networks
9: A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids
10: Crowdsourced correlation clustering with relative distance comparisons
11: A polynomial-time approximation algorithm for all-terminal network reliability
12: Evolutionary Acyclic Graph Partitioning
13: Polysemy Detection in Distributed Representation of Word Sense
14: In-Place Initializable Arrays
15: Computing Tree Decompositions with FlowCutter: PACE 2017 Submission
16: PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining
17: Recognizing Weak Embeddings of Graphs
18: On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
19: Fillable arrays with constant time operations and a single bit of redundancy
20: On the tractability of optimization problems on H-graphs
21: A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
22: Sampling Without Compromising Accuracy in Adaptive Data Analysis
23: Fully leafed induced subtrees