@inproceedings{DBLP:conf/focs/MegiddoHGJP81,
author = {Nimrod Megiddo and
S. Louis Hakimi and
M. R. Garey and
David S. Johnson and
Christos H. Papadimitriou},
title = {The Complexity of Searching a Graph (Preliminary Version)},
booktitle = {FOCS},
year = {1981},
pages = {376-385},
ee = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1981.46},
crossref = {DBLP:conf/focs/FOCS22},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/focs/FOCS22,
title = {22nd Annual Symposium on Foundations of Computer Science,
Nashville, Tennessee, USA, 28-30 October 1981},
booktitle = {FOCS},
publisher = {IEEE Computer Society},
year = {1981},
bibsource = {DBLP, http://dblp.uni-trier.de}
}