PaperComplexity of finding k-path-free dominating sets in graphsReuven Bar-Yehuda, Uzi VishkinInformation Processing Letters
PaperOptimal doubly logarithmic parallel algorithms based on finding all nearest smaller valuesOmer Berkman, Baruch Schieber, et al.Journal of Algorithms
Conference paperA polynomial time algorithm for solving systems of linear inequalities with two variables per inequalityBengt Aspvall, Yossi ShiloachFOCS 1979
