@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}
}
@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{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{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{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{KoenigVoelkerWolfetal.2016,
  author    = {K{\"o}nig, Johannes Alexander and V{\"o}lker, Veronika and Wolf, Martin R. and Schuba, Marko},
  title     = {Gamified Hacking Offence Simulation-based Training (GHOST)},
  series = {Crisis Prevention},
  volume    = {2016},
  journal   = {Crisis Prevention},
  number    = {3},
  publisher = {Beta},
  address   = {Bonn},
  pages     = {44 -- 46},
  year      = {2016},
  language  = {de}
}
@article{PinkenburgSchiffelsSelmer2016,
  author    = {Pinkenburg, Olaf and Schiffels, Johannes and Selmer, Thorsten},
  title     = {Das CoLibry-Konzept - ein Werkzeugkasten f{\"u}r die Synthetische Biologie: Bioproduktion},
  series = {BIOspektrum},
  volume    = {22},
  journal   = {BIOspektrum},
  number    = {6},
  publisher = {Springer},
  address   = {Berlin},
  doi       = {10.1007/s12268-016-0734-8},
  pages     = {593 -- 595},
  year      = {2016},
  abstract  = {Regardless of size or destination, synthetic biology starts with com-parably small information units, which need to be combined and properly arranged in order to achieve a certain goal. This may be the de novo synthesis of individual genes from oligonucleotides, a shuffling of protein domains in order to create novel biocatalysts, the assembly of multiple enzyme encoding genes in metabolic pathway design, or strain development at the production stage. The CoLibry concept has been designed in order to close the gap between recombinant production of individual genes and genome editing.},
  language  = {de}
}
@article{LopesLeandroCarvalhoetal.2017,
  author    = {Lopes, Pedro and Leandro, Jorge and Carvalho, Rita F. and Bung, Daniel Bernhard},
  title     = {Alternating skimming flow over a stepped spillway},
  series = {Environmental Fluid Mechanics},
  volume    = {17},
  journal   = {Environmental Fluid Mechanics},
  number    = {2},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1573-1510},
  doi       = {10.1007/s10652-016-9484-x},
  pages     = {303 -- 322},
  year      = {2017},
  language  = {en}
}
@article{RieperGebhardtStucker2016,
  author    = {Rieper, Harald and Gebhardt, Andreas and Stucker, Brent},
  title     = {Selective Laser Melting of the Eutectic Silver-Copper Alloy Ag 28 wt \% Cu},
  series = {RTejournal - Forum f{\"u}r Rapid Technologie},
  volume    = {13},
  journal   = {RTejournal - Forum f{\"u}r Rapid Technologie},
  issn      = {1614-0923},
  url       = {http://nbn-resolving.de/nbn:de:0009-2-44141},
  year      = {2016},
  abstract  = {The aim of this work was to perform a detailed investigation of the use of Selective Laser Melting (SLM) technology to process eutectic silver-copper alloy Ag 28 wt. \% Cu (also called AgCu28). The processing occurred with a Realizer SLM 50 desktop machine. The powder analysis (SEM-topography, EDX, particle distribution) was reported as well as the absorption rates for the near-infrared (NIR) spectrum. Microscope imaging showed the surface topography of the manufactured parts. Furthermore, microsections were conducted for the analysis of porosity. The Design of Experiments approach used the response surface method in order to model the statistical relationship between laser power, spot distance and pulse time.},
  language  = {en}
}
@article{Kern2016,
  author    = {Kern, Alexander},
  title     = {Blitz- und {\"U}berspannungsschutz von Kernkraftwerken - Nachweisf{\"u}hrung der ausreichenden Sicherheit f{\"u}r leittechnische Einrichtungen auch bei Blitzeinschl{\"a}gen mit extremen Parametern},
  series = {Atw. International Journal for Nuclear Power},
  volume    = {61},
  journal   = {Atw. International Journal for Nuclear Power},
  number    = {8/9},
  publisher = {Inforum},
  address   = {Berlin},
  issn      = {1431-5254},
  pages     = {534 -- 543},
  year      = {2016},
  abstract  = {F{\"u}r das Auftreten extremer Wetterereignisse werden f{\"u}r Kernkraftwerke Eintrittsh{\"a}ufigkeiten f{\"u}r nicht mehr beherrschbare Zust{\"a}nde von unter 10⁻⁴/a gefordert. Dies gilt auch f{\"u}r die Einwirkung von Blitzeinschl{\"a}gen. Die bisherige Nachweisf{\"u}hrung zu Blitz- und {\"U}berspannungsschutz eines KKW in Deutschland ist deterministisch. In diesem Bericht werden das Vorgehen f{\"u}r einen entsprechenden Nachweis f{\"u}r leittechnische Einrichtungen der Sicherheitstechnik von KKW, der zur geforderten Zielgr{\"o}ße der Eintrittsh{\"a}ufigkeit f{\"u}hrt. Die Ergebnisse werden zusammenfassend bewertet.},
  language  = {de}
}