Artur Czumaj Miroslaw Kowaluk Andrzej Lingas Faster algorithms for finding lowest common ancestors in directed acyclic graphs. 37-46 2007 380 Theor. Comput. Sci. 1-2 http://dx.doi.org/10.1016/j.tcs.2007.02.053 db/journals/tcs/tcs380.html#CzumajKL07