1. The pebbling problem is complete in polynomial space;Gilbert,1979
2. On time versus space;Hopcroft;J. ACM,1977
3. Recontamination does not help to search a graph;LaPaugh,1983
4. Area efficient graph layouts (for VLSI);Leiserson,1980
5. Black-white pebbles and graph separation;Lengauer,1980