1. S.Alpern, How to search a tree to which Eulerian networks are attached, London School of Economics, 2005.
2. The search value of a network;Alpern;Networks,1986
3. S.Alpern,V.Baston, and S.Gal, Network search games with immobile hider, without a designated searcher starting point, Research Report CDAM-2006-03, Centre for Discrete and Applicable Mathematics, London School of Economics, 2006.
4. S.Alpern,V.Baston, and S.Gal, Searching symmetric networks with utilitarian postman paths, Research Report CDAM-2006-06, Centre for Discrete and Applicable Mathematics, London School of Economics, 2006.