@incollection{FissabreWilson2016,
  author    = {Fissabre, Anke and Wilson, Ariane},
  title     = {"Lehmbaupropaganda" : On the tradition of earth building literature},
  series = {Earth Construction and Tradition. Vol. I},
  booktitle = {Earth Construction and Tradition. Vol. I},
  editor    = {Feiglstorfer, Hubert},
  publisher = {IVA Institut f{\"u}r vergleichende Architekturforschung},
  address   = {Wien},
  isbn      = {978-3-900265-34-2},
  pages     = {47 -- 69},
  year      = {2016},
  language  = {en}
}
@inproceedings{StaatDuong2016,
  author    = {Staat, Manfred and Duong, Minh Tuan},
  title     = {Smoothed Finite Element Methods for Nonlinear Solid Mechanics Problems: 2D and 3D Case Studies},
  series = {Proceedings of the National Science and Technology Conference on Mechanical - Transportation Engineering (NSCMET 2016), 13th October 2016, Hanoi, Vietnam, Vol.2},
  booktitle = {Proceedings of the National Science and Technology Conference on Mechanical - Transportation Engineering (NSCMET 2016), 13th October 2016, Hanoi, Vietnam, Vol.2},
  pages     = {440 -- 445},
  year      = {2016},
  abstract  = {The Smoothed Finite Element Method (SFEM) is presented as an edge-based and a facebased techniques for 2D and 3D boundary value problems, respectively. SFEMs avoid shortcomings of the standard Finite Element Method (FEM) with lower order elements such as overly stiff behavior, poor stress solution, and locking effects. Based on the idea of averaging spatially the standard strain field of the FEM over so-called smoothing domains SFEM calculates the stiffness matrix for the same number of degrees of freedom (DOFs) as those of the FEM. However, the SFEMs significantly improve accuracy and convergence even for distorted meshes and/or nearly incompressible materials. Numerical results of the SFEMs for a cardiac tissue membrane (thin plate inflation) and an artery (tension of 3D tube) show clearly their advantageous properties in improving accuracy particularly for the distorted meshes and avoiding shear locking effects.},
  language  = {en}
}
@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}
}
@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}
}
@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}
}
@inproceedings{ValeroBungCrookstonetal.2016,
  author    = {Valero, Daniel and Bung, Daniel B. and Crookston, B. M. and Matos, J.},
  title     = {Numerical investigation of USBR type III stilling basin performance downstream of smooth and stepped spillways},
  series = {Hydraulic Structures and Water System Management. 6th IAHR International Symposium on Hydraulic Structures, Portland, OR, 27-30 June 2016},
  booktitle = {Hydraulic Structures and Water System Management. 6th IAHR International Symposium on Hydraulic Structures, Portland, OR, 27-30 June 2016},
  editor    = {Crookston, B. and Tullis, B.},
  isbn      = {978-1-884575-75-4},
  doi       = {10.15142/T340628160853},
  pages     = {635 -- 646},
  year      = {2016},
  language  = {en}
}