@misc{19480,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}},
  editor       = {{Brunner, Horst and Moritz, Rainer}},
  pages        = {{58--60}},
  title        = {{{Bürgerliches Trauerspiel}}},
  year         = {{1997}},
}

@misc{19483,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}},
  editor       = {{Brunner, Horst and Moritz, Rainer}},
  pages        = {{64--68}},
  title        = {{{DDR-Literatur}}},
  year         = {{1997}},
}

@misc{19485,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}},
  editor       = {{Brunner, Horst and Moritz, Rainer}},
  pages        = {{347--350}},
  title        = {{{Tragödie}}},
  year         = {{1997}},
}

@phdthesis{19631,
  author       = {{Bäumker, Armin}},
  isbn         = {{3-931466-27-2}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Communication Efficient Parallel Searching}}},
  volume       = {{28}},
  year         = {{1997}},
}

@phdthesis{19636,
  author       = {{Dittrich, Wolfgang}},
  isbn         = {{3-931466-26-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Communication and I/O Efficient Parallel Data Structures}}},
  volume       = {{27}},
  year         = {{1997}},
}

@phdthesis{19637,
  author       = {{Strothmann, Willy-Bernhard}},
  isbn         = {{3-931466-34-5}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Bounded Degree Spanning Trees}}},
  volume       = {{35}},
  year         = {{1997}},
}

@inproceedings{19869,
  abstract     = {{Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.}},
  author       = {{Czumaj, Artur and Strothmann, Willy-Bernhard}},
  booktitle    = {{Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)}},
  isbn         = {{9783540633976}},
  issn         = {{0302-9743}},
  title        = {{{Bounded degree spanning trees}}},
  doi          = {{10.1007/3-540-63397-9_9}},
  year         = {{1997}},
}

@inproceedings{2013,
  author       = {{Brune, Matthias and Hellmann, Christian and Keller, Axel}},
  booktitle    = {{Proc. Workshop Hypercomputing at ITG/GI-Conference Architekur von Rechensystemen}},
  title        = {{{A Closer Step towards Management of Metacomputing-Resources}}},
  year         = {{1997}},
}

@inproceedings{2438,
  author       = {{Simon, Jens and Weicker, Reinhold and Vieth, Marco}},
  booktitle    = {{Proc. European Conf. on Parallel Processing (Euro-Par)}},
  isbn         = {{978-3-540-69549-3}},
  pages        = {{971--984}},
  publisher    = {{Springer}},
  title        = {{{Workload Analysis of Computation Intensive Tasks: Case Study on SPEC CPU95 Benchmarks}}},
  doi          = {{10.1007/BFb0002841}},
  volume       = {{1300}},
  year         = {{1997}},
}

@inproceedings{2439,
  author       = {{Heinz, Oliver and Simon, Jens}},
  booktitle    = {{Proc. Int. Conf. on Architecture of Computing Systems (ARCS)}},
  publisher    = {{VDE Verlag}},
  title        = {{{Experiences with a SCI Multiprocessor Workstation Cluster}}},
  year         = {{1997}},
}

@inproceedings{2440,
  author       = {{Simon, Jens and Heinz, Oliver}},
  booktitle    = {{Proc. Workshops im Rahmen der 14. ITG/GI-Fachtagung Architektur von Rechensystemen}},
  pages        = {{189--199}},
  title        = {{{SCI multiprocessor PC cluster in a WindowsNT environment}}},
  year         = {{1997}},
}

@inproceedings{2441,
  author       = {{Fischer, Markus and Simon, Jens}},
  booktitle    = {{Proc. European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting (EuroPVM/MPI)}},
  pages        = {{175--184}},
  publisher    = {{Springer}},
  title        = {{{Embedding SCI into PVM}}},
  doi          = {{10.1007/3-540-63697-8_84}},
  volume       = {{1332}},
  year         = {{1997}},
}

@inproceedings{2442,
  author       = {{Reinefeld, Alexander and Baraglia, Ranieri and Decker, Thomas and Gehring, Jörn and Laforenza, Domenico and Ramme, Friedhelm and Römke, Thomas and Simon, Jens}},
  booktitle    = {{Proc. Heterogenous Computing Workshop (HCW)}},
  pages        = {{17--31}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{The MOL Project: An Open, Extensible Metacomputer}}},
  doi          = {{10.1109/HCW.1997.581407}},
  year         = {{1997}},
}

@techreport{2580,
  author       = {{Betz, Stefan}},
  title        = {{{Zum Abbau der Diskriminierung von Frauenarbeit im Rahmen kostenminimaler Produktionen}}},
  volume       = {{5}},
  year         = {{1997}},
}

@article{25930,
  author       = {{Toeller, M and Buyken, Anette and Heitkamp, G and Milne, R and Klischan, A and Gries, FA}},
  issn         = {{0954-3007}},
  journal      = {{Eur J Clin Nutr}},
  number       = {{2}},
  pages        = {{74--80}},
  title        = {{{Repeatability of three-day dietary records in the EURODIAB IDDM Complications Study.}}},
  doi          = {{10.1038/sj.ejcn.1600364}},
  volume       = {{51}},
  year         = {{1997}},
}

@techreport{2671,
  author       = {{Betz, Stefan}},
  title        = {{{Die Zielkostenrechnung als Controllinginstrument}}},
  volume       = {{Neue Folge Nr. 49}},
  year         = {{1997}},
}

@inproceedings{3258,
  author       = {{Rensink, Arend and Wehrheim, Heike}},
  booktitle    = {{Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}},
  editor       = {{Pr{\'{\i}}vara, Igor and Ruzicka, Peter}},
  pages        = {{468----477}},
  title        = {{{Dependency-Based Action Refinement}}},
  doi          = {{10.1007/BFb0029990}},
  year         = {{1997}},
}

@inproceedings{3259,
  author       = {{Rensink, Arend and Wehrheim, Heike}},
  booktitle    = {{Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}},
  editor       = {{Pr{\'{\i}}vara, Igor and Ruzicka, Peter}},
  pages        = {{468----477}},
  title        = {{{Dependency-Based Action Refinement}}},
  doi          = {{10.1007/BFb0029990}},
  year         = {{1997}},
}

@inbook{3526,
  author       = {{Gries, Thomas and Jungblut, Stefan}},
  booktitle    = {{Banking, International Capital Flows and Growth in Europe}},
  editor       = {{Welfens, Paul J.J. and Wolf, Holger C.}},
  isbn         = {{9783540631927}},
  pages        = {{297 -- 311}},
  publisher    = {{Springer-Verlag}},
  title        = {{{Catching-up of Economies in Transformation}}},
  year         = {{1997}},
}

@article{3527,
  author       = {{Gries, Thomas and Birk, Angela}},
  journal      = {{Wirtschaftsdienst – Zeitschrift für Wirtschaftspolitik (1949 - 2007)}},
  number       = {{2}},
  pages        = {{99--106}},
  title        = {{{Amerikanisches Job-Wunder versus deutsches Produktivitätswunder: Ein Vergleich der Arbeitsmarktstrategien}}},
  volume       = {{77}},
  year         = {{1997}},
}