Page "Brian Kernighan" Paragraph 2

In collaboration with Shen Lin he devised well-known heuristics for two NP-complete optimization problems: graph partitioning and the travelling salesman problem.

( In a display of authorial equity, the former is usually called the Kernighan – Lin algorithm, while the latter is styled Lin – Kernighan.