Algorithms for Solving Rubik's Cubes

Algorithms for Submodular Matroid Secretary Problems Under Transversal Matroids and Partition Matroids

Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs

Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs

Algorithms using Java for Spreadsheet Dependent Cell Recomputation

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