K-Medians, Facility Location, and the Chernoff-Wald Bound

k-Probe DH-graphs

K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!

Kernel Bounds for Path and Cycle Problems

Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves

Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems

Kernels for Feedback Arc Set In Tournaments

Knowledge State Algorithms: Randomization with Limited Information

Known algorithms for EDGE CLIQUE COVER are probably optimal

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

L1 Projections with Box Constraints

Label-Guided Graph Exploration with Adjustable Ratio of Labels

Lagrangian Relaxation and Partial Cover

Lagrangian Relaxation Applied to Sparse Global Network Alignment

Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model

Large primes in generalized Pascal triangles

Large-girth roots of graphs

Lasserre SDPs, $\ell_1$-embeddings, and approximating non-uniform sparsest cut via generalized spectra

Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks

Layered Working-Set Trees