@InProceedings{beyersdorff_et_al:OASIcs.ATMOS.2009.2147,
  author =	{Beyersdorff, Olaf and Nebesov, Yevgen},
  title =	{{Edges as Nodes - a New Approach to Timetable Information}},
  booktitle =	{9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)},
  pages =	{1--12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-11-8},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{12},
  editor =	{Clausen, Jens and Di Stefano, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2147},
  URN =		{urn:nbn:de:0030-drops-21478},
  doi =		{10.4230/OASIcs.ATMOS.2009.2147},
  annote =	{Keywords: Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model}
}