BibTeX
@inproceedings{DBLP:conf/mfcs/OgiharaT01,
author = {Mitsunori Ogihara and
Seinosuke Toda},
title = {The Complexity of Computing the Number of Self-Avoiding
Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs},
booktitle = {MFCS},
year = {2001},
pages = {585-597},
ee = {http://link.springer.de/link/service/series/0558/bibs/2136/21360585.htm},
crossref = {DBLP:conf/mfcs/2001},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/mfcs/2001,
editor = {Jiri Sgall and
Ales Pultr and
Petr Kolman},
title = {Mathematical Foundations of Computer Science 2001, 26th
International Symposium, MFCS 2001 Marianske Lazne, Czech
Republic, August 27-31, 2001, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2136},
year = {2001},
isbn = {3-540-42496-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-01-03 by Michael Ley (ley@uni-trier.de)