All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables
Almost 2-SAT is Fixed-Parameter Tractable
Almost Optimal Explicit Johnson-Lindenstrauss Transformations
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
Almost stable matchings in constant time
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
AMS Without 4-Wise Independence on Product Domains
An $O(k^{3} log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
An algorithm for computing cutpoints in finite metric spaces
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System
An Algorithmic Perspective on Some Network Design, Construction and Analysis Problems
An analysis of a bounded resource search puzzle
An Application of Rational Trees in a Logic Programming Interpreter for a Procedural Language