@InProceedings{jakoby_et_al:DagSemProc.06111.6,
  author =	{Jakoby, Andreas and Tantau, Till},
  title =	{{Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.6},
  URN =		{urn:nbn:de:0030-drops-6185},
  doi =		{10.4230/DagSemProc.06111.6},
  annote =	{Keywords: Series-parallel graphs, shortest path, logspace}
}