k-Gap Interval Graphs
k-Means has Polynomial Smoothed Complexity
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
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