The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
The fast intersection transform with applications to counting paths
The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem
The Forgiving Graph: A distributed data structure for low stretch under adversarial attack
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
The General Traveling Salesman Problem, Version 2
The generalized work function algorithm is competitive for the generalized 2-server problem
The Generic Multiple-Precision Floating-Point Addition With Exact Rounding (as in the MPFR Library)
The Geometric Maximum Traveling Salesman Problem
The Geometry of Scheduling
The Gibbs Representation of 3D Rotations
The Graph Traversal Pattern
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
The interval ordering problem
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
The K-Server Dual and Loose Competitiveness for Paging
The Knapsack Problem with Neighbour Constraints
The lattice dimension of a graph