Cs-Ds
Reconstruction of Integers from Pairwise Distances
The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
Persistent Monitoring in Discrete Environments: Minimizing the Maximum Weighted Latency Between Observations
Binary Jumbled String Matching for Highly Run-Length Compressible Texts
MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
Parallel and sequential in-place permuting and perfect shuffling using involutions
Tight Analysis of Priority Queuing Policy for Egress Traffic
The Online Replacement Path Problem
(Really) Tight bounds for dispatching binary methods
On the Complexity of Trial and Error
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
Locally Stable Marriage with Strict Preferences
Sparsification of Motion-Planning Roadmaps by Edge Contraction
Additive Update Algorithm for Nonnegative Matrix Factorization
Faster Deterministic Fully-Dynamic Graph Connectivity
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
A dynamic data structure for counting subgraphs in sparse graphs
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
Can Quantum Communication Speed Up Distributed Computation?
Quick HyperVolume
