BibTeX record: journals/eccc/ECCC-TR01-038

download as .bib file

@article{DBLP:journals/eccc/ECCC-TR01-038,
  author    = {R{\"{u}}diger Reischuk},
  title     = {Approximating Schedules for Dynamic Graphs Efficiently},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {38},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-038/index.html},
  timestamp = {Wed, 07 Dec 2011 17:05:30 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR01-038},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}