1.  The complexity of enumeration and reliability problems
	Leslie Valiant
	SIAM J Computing, 1979

2.  Approximating the minimum spanning tree weight in sublinear time 
	Chazelle, Rubinfeld, Trevisan
	SIAM J. on Computing, 2005 34, No. 6, pp. 1370–1379

3.  Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
	David R. Karger and Daphne Koller and Steven J. Phillips
	SIAM J. Comput. Volume 22, Issue 6, pp. 1199-1217 (1993)

4.  The Worst Page-Replacement Policy. 
	Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
	Theory Comput Syst (2009) 44: 175–185
	http://www.springerlink.com/content/4m32213441gw7657/fulltext.pdf

5.  An Analysis of Several Heuristics for the Traveling Salesman Problem
	Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis, II
	SIAM J. Comput. Volume 6, Issue 3, pp. 563-581 (1977)

6.  The k-traveling repairmen problem
	Fakcharoenphol, Harrelson and Rao
	ACM Transactions on Algorithms (TALG)
	http://portal.acm.org/citation.cfm?doid=1290672.1290677

7.  The Power of a Pebble: Exploring and Mapping Directed Graphs
	Michael A. Bendera, Antonio Fernándezb, Dana Ronc, Amit Sahaie, and Salil Vadhan
	Information and Computation, Volume 176, Issue 1, 10 July 2002, Pages 1-21

8.  On Minimul and Maximum Spanning Tree Of Moving Points
	Katoh, Tokuyama, Iwano
	Discrete and Computational Geometry

9.  How Many Lions Are Needed to Clear a Grid?
	Florian Berger and Alexander Gilbers and Ansgar Grune  and Rolf Klein
	Algorithms 2, no. 3: 1069-1086.
	http://www.mdpi.com/1999-4893/2/3/1069/pdf

10.  Online learning in online auctions
	Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu
	ACM Symposium on Discrete Algorithms, 2003
	http://portal.acm.org/citation.cfm?id=644108.644143