TY - GEN AU - Eke, Norbert Otto ED - Brunner, Horst ED - Moritz, Rainer ID - 19480 T2 - Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik TI - Bürgerliches Trauerspiel ER - TY - GEN AU - Eke, Norbert Otto ED - Brunner, Horst ED - Moritz, Rainer ID - 19483 T2 - Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik TI - DDR-Literatur ER - TY - GEN AU - Eke, Norbert Otto ED - Brunner, Horst ED - Moritz, Rainer ID - 19485 T2 - Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik TI - Tragödie ER - TY - THES AU - Bäumker, Armin ID - 19631 SN - 3-931466-27-2 TI - Communication Efficient Parallel Searching VL - 28 ER - TY - THES AU - Dittrich, Wolfgang ID - 19636 SN - 3-931466-26-4 TI - Communication and I/O Efficient Parallel Data Structures VL - 27 ER - TY - THES AU - Strothmann, Willy-Bernhard ID - 19637 SN - 3-931466-34-5 TI - Bounded Degree Spanning Trees VL - 35 ER - TY - CONF AB - 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$. AU - Czumaj, Artur AU - Strothmann, Willy-Bernhard ID - 19869 SN - 0302-9743 T2 - Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97) TI - Bounded degree spanning trees ER - TY - CONF AU - Brune, Matthias AU - Hellmann, Christian AU - Keller, Axel ID - 2013 T2 - Proc. Workshop Hypercomputing at ITG/GI-Conference Architekur von Rechensystemen TI - A Closer Step towards Management of Metacomputing-Resources ER - TY - CONF AU - Simon, Jens AU - Weicker, Reinhold AU - Vieth, Marco ID - 2438 SN - 978-3-540-69549-3 T2 - Proc. European Conf. on Parallel Processing (Euro-Par) TI - Workload Analysis of Computation Intensive Tasks: Case Study on SPEC CPU95 Benchmarks VL - 1300 ER - TY - CONF AU - Heinz, Oliver AU - Simon, Jens ID - 2439 T2 - Proc. Int. Conf. on Architecture of Computing Systems (ARCS) TI - Experiences with a SCI Multiprocessor Workstation Cluster ER - TY - CONF AU - Simon, Jens AU - Heinz, Oliver ID - 2440 T2 - Proc. Workshops im Rahmen der 14. ITG/GI-Fachtagung Architektur von Rechensystemen TI - SCI multiprocessor PC cluster in a WindowsNT environment ER - TY - CONF AU - Fischer, Markus AU - Simon, Jens ID - 2441 T2 - Proc. European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting (EuroPVM/MPI) TI - Embedding SCI into PVM VL - 1332 ER - TY - CONF AU - Reinefeld, Alexander AU - Baraglia, Ranieri AU - Decker, Thomas AU - Gehring, Jörn AU - Laforenza, Domenico AU - Ramme, Friedhelm AU - Römke, Thomas AU - Simon, Jens ID - 2442 T2 - Proc. Heterogenous Computing Workshop (HCW) TI - The MOL Project: An Open, Extensible Metacomputer ER - TY - GEN AU - Betz, Stefan ID - 2580 TI - Zum Abbau der Diskriminierung von Frauenarbeit im Rahmen kostenminimaler Produktionen VL - 5 ER - TY - JOUR AU - Toeller, M AU - Buyken, Anette AU - Heitkamp, G AU - Milne, R AU - Klischan, A AU - Gries, FA ID - 25930 IS - 2 JF - Eur J Clin Nutr SN - 0954-3007 TI - Repeatability of three-day dietary records in the EURODIAB IDDM Complications Study. VL - 51 ER - TY - GEN AU - Betz, Stefan ID - 2671 TI - Die Zielkostenrechnung als Controllinginstrument VL - Neue Folge Nr. 49 ER - TY - CONF AU - Rensink, Arend AU - Wehrheim, Heike ED - Pr{\'{\i}}vara, Igor ED - Ruzicka, Peter ID - 3258 T2 - Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings TI - Dependency-Based Action Refinement ER - TY - CONF AU - Rensink, Arend AU - Wehrheim, Heike ED - Pr{\'{\i}}vara, Igor ED - Ruzicka, Peter ID - 3259 T2 - Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings TI - Dependency-Based Action Refinement ER - TY - CHAP AU - Gries, Thomas AU - Jungblut, Stefan ED - Welfens, Paul J.J. ED - Wolf, Holger C. ID - 3526 SN - 9783540631927 T2 - Banking, International Capital Flows and Growth in Europe TI - Catching-up of Economies in Transformation ER - TY - JOUR AU - Gries, Thomas AU - Birk, Angela ID - 3527 IS - 2 JF - Wirtschaftsdienst – Zeitschrift für Wirtschaftspolitik (1949 - 2007) TI - Amerikanisches Job-Wunder versus deutsches Produktivitätswunder: Ein Vergleich der Arbeitsmarktstrategien VL - 77 ER -