- M. M. Halldórsson and J. Radhakrishnan. Improved
approximations of independent sets in bounded-degree graphs via subgraph
removal. Nordic Journal of Computing, 1(4):475-492, Winter
- G. S. Brodal, S. Chaudhuri, and J. Radhakrishnan. The
Randomized Complexity of Maintaining the Minimum. Nordic Journal
of Computing, 3(4):337-351, Winter 1996.