Papers:
D. Fernholz, V. Ramachandran, "The giant $k$-core of a random graph with a specified degree sequence," Manuscript, November 2003. (ps)
D. Fernholz, V. Ramachandran, "Cores and connectivity in sparse random graphs". Technical report TR04-13, 2004. (ps)
D. Fernholz, “k-orientability, probability generating functions, and algorithms on random graphs.” Manuscript, April 2006. (ps)
D Fernholz, V. Ramachandran, “The k-orientability thresholds for G(n,p).” Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2007. (ps)
D. Fernholz, V. Ramachandran, "The diameter of sparse random graphs." Random Structures and Algorithms, 31:4, December 2007 (p 482-516). (ps)
D. Fernholz, "Independent set heuristics for random 3-regular graphs." Submitted. (ps)
A. Banner, D. Fernholz, "Short-term arbitrage in volatility-stabilized markets." To appear in Annals of Finance. (pdf)
Dissertation:
Sparse Random Graphs: Methods, Structure, and Heuristics (pdf)