@incollection{Schloesser2016, author = {Schl{\"o}sser, Karl Helmut}, title = {Leistungsbeschreibung und Bauvertrag}, series = {Zahlentafeln f{\"u}r den Baubetrieb}, booktitle = {Zahlentafeln f{\"u}r den Baubetrieb}, edition = {9., {\"u}berarb. und aktual. Aufl.}, publisher = {Springer Vieweg}, address = {Wiesbaden}, isbn = {978-3-658-02838-1 (Online)}, doi = {10.1007/978-3-658-02838-1_6}, pages = {635 -- 961}, year = {2016}, abstract = {Das Gesetz gegen Wettbewerbsbeschr{\"a}nkungen bildet die Grundlage f{\"u}r die Verordnung {\"u}ber die Vergabe {\"o}ffentlicher Auftr{\"a}ge, aus der sich die Vergabe- und Vertragsordnungen f{\"u}r Freiberufliche Leistungen (VOF), f{\"u}r Lieferungen und Leistungen (VOL) und f{\"u}r Bauleistungen (VOB) ableiten. Die dabei in Frage kommenden Vergabeverfahren und die einzelnen Schwellenwerte gem{\"a}ß EU-Recht werden detailliert aufbereitet und im Zusammenhang dargestellt. Die f{\"u}r die Ausgestaltung von Bauvertr{\"a}gen notwendigen Grundlagen des Werkvertragsrecht nach BGB sowie die branchenspezifischen Allgemeinen Gesch{\"a}ftsbedingungen in Form der Vertragsordnung f{\"u}r Bauleistungen (VOB) mit ihren Zus{\"a}tzlichen und Besonderen Vertragsbedingungen werden intensiv aufbereitet. Das Zustandekommen eines Bauvertrages ergibt sich dann aus der notwendigen Leistungsbeschreibung mit einem Leistungsverzeichnis und verschiedenen Positionen oder in Form einer Funktionalen Leistungsbeschreibung (Beschreibung mit Leistungsprogramm). Das Auslandsgesch{\"a}ft der Baubranche (Bauausf{\"u}hrende Unternehmen sowie Beratende Ingenieure und Consultants) wird von den jeweils vorliegenden Internationalen Wettbewerbsbedingungen bestimmt, deren Zusammenh{\"a}nge anhand umfangreicher statistischer Daten und anhand von Beispielen dargestellt werden.}, language = {de} } @inproceedings{TranTranMatthiesetal.2016, author = {Tran, Ngoc Trinh and Tran, Thanh Ngoc and Matthies, Hermann G. and Stavroulakis, Georgios Eleftherios and Staat, Manfred}, title = {FEM Shakedown of uncertain structures by chance constrained programming}, series = {PAMM Proceedings in Applied Mathematics and Mechanics}, volume = {16}, booktitle = {PAMM Proceedings in Applied Mathematics and Mechanics}, number = {1}, issn = {1617-7061}, doi = {10.1002/pamm.201610346}, pages = {715 -- 716}, year = {2016}, language = {en} } @book{GebhardtKesslerThurn2016, author = {Gebhardt, Andreas and Kessler, Julia and Thurn, Laura}, title = {3D-Drucken: Grundlagen und Anwendungen des additive manufacturing (AM)}, edition = {2., neu bearbeitete und erweiterte Auflage}, publisher = {Hanser}, address = {M{\"u}nchen}, isbn = {978-3-446-44672-4}, doi = {10.3139/9783446448452}, pages = {XVI, 218 Seiten}, year = {2016}, language = {de} } @article{LeversStaatLaack2016, author = {Levers, A. and Staat, Manfred and Laack, Walter van}, title = {Analysis of the long-term effect of the MBST® nuclear magnetic resonance therapy on gonarthrosis}, series = {Orthopedic Practice}, volume = {47}, journal = {Orthopedic Practice}, number = {11}, pages = {521 -- 528}, year = {2016}, language = {en} } @article{KosterScheidweilerTieves2016, author = {Koster, Arie and Scheidweiler, Robert and Tieves, Martin}, title = {A flow based pruning scheme for enumerative equitable coloring algorithms}, series = {A flow based pruning scheme for enumerative equitable coloring algorithms}, journal = {A flow based pruning scheme for enumerative equitable coloring algorithms}, doi = {10.48550/arXiv.1607.08754}, pages = {1 -- 30}, year = {2016}, abstract = {An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved. Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement.}, language = {en} } @article{BeckenbachScheidweiler2016, author = {Beckenbach, Isabel and Scheidweiler, Robert}, title = {Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach}, series = {Discrete Mathematics}, volume = {240}, journal = {Discrete Mathematics}, number = {10}, publisher = {Elsevier}, address = {Amsterdam}, issn = {2192-7782}, doi = {10.1016/j.disc.2017.05.005}, pages = {2499 -- 2506}, year = {2016}, abstract = {We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.}, language = {en} } @article{ScheidweilerTriesch2016, author = {Scheidweiler, Robert and Triesch, Eberhard}, title = {A note on the duality between matchings and vertex covers in balanced hypergraphs}, series = {Journal of Combinatorial Optimization}, volume = {32}, journal = {Journal of Combinatorial Optimization}, number = {2}, publisher = {Springer}, address = {Berlin}, issn = {1573-2886}, doi = {10.1007/s10878-015-9887-5}, pages = {639 -- 644}, year = {2016}, abstract = {We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig's Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32-40, 1970; Fulkerson et al. in Math Progr Study 1:120-132, 1974) and Hall's Theorem (Conforti et al. in Combinatorica 16:325-329, 1996) for balanced hypergraphs.}, language = {en} } @article{NiedermeyerZhouDursunetal.2016, author = {Niedermeyer, Angela and Zhou, Bei and Dursun, G{\"o}zde and Temiz Artmann, Ayseg{\"u}l and Markert, Bernd}, title = {An examination of tissue engineered scaffolds in a bioreactor}, series = {Proceedings in Applied Mathematics and Mechanics PAMM}, volume = {16}, journal = {Proceedings in Applied Mathematics and Mechanics PAMM}, number = {1}, publisher = {Wiley-VCH}, address = {Weinheim}, issn = {1617-7061}, doi = {10.1002/pamm.201610038}, pages = {99 -- 100}, year = {2016}, abstract = {Replacement tissues, designed to fill in articular cartilage defects, should exhibit the same properties as the native material. The aim of this study is to foster the understanding of, firstly, the mechanical behavior of the material itself and, secondly, the influence of cultivation parameters on cell seeded implants as well as on cell migration into acellular implants. In this study, acellular cartilage replacement material is theoretically, numerically and experimentally investigated regarding its viscoelastic properties, where a phenomenological model for practical applications is developed. Furthermore, remodeling and cell migration are investigated.}, language = {en} } @inproceedings{HeuermannSadeghfam2016, author = {Heuermann, Holger and Sadeghfam, Arash}, title = {Analog Amplitude-Locked Loop Circuit to Support RF Energy Solutions}, series = {IEEE MTT-S International Microwave Symposium Digest}, booktitle = {IEEE MTT-S International Microwave Symposium Digest}, isbn = {978-150900698-4}, doi = {10.1109/MWSYM.2016.7540092}, pages = {4 Seiten}, year = {2016}, language = {de} } @inproceedings{HafnerOchsWeickertetal.2016, author = {Hafner, David and Ochs, Peter and Weickert, Joachim and Reißel, Martin}, title = {FSI Schemes : Fast Semi-Iterative Solvers for PDEs and Optimisation Methods}, series = {Pattern Recognition : 38th German Conference, GCPR 2016, Hannover, Germany, September 12-15, 2016, Proceedings}, booktitle = {Pattern Recognition : 38th German Conference, GCPR 2016, Hannover, Germany, September 12-15, 2016, Proceedings}, editor = {Rosenhahn, Bodo}, publisher = {Springer}, isbn = {978-3-319-45886-1}, doi = {10.1007/978-3-319-45886-1_8}, pages = {91 -- 102}, year = {2016}, language = {de} }