@inproceedings{KesslerBalcGebhardtetal.2017,
  author    = {Kessler, Julia and Balc, Nicolae and Gebhardt, Andreas and Abbas, Karim},
  title     = {Basic research on lattice structures focused on the reliance of the cross sectional area and additional coatings},
  series = {The 4th International Conference on Computing and Solutions in Manufacturing Engineering 2016 - CoSME'16},
  booktitle = {The 4th International Conference on Computing and Solutions in Manufacturing Engineering 2016 - CoSME'16},
  edition   = {Vol. 94},
  doi       = {10.1051/matecconf/20179403008},
  pages     = {7 S.},
  year      = {2017},
  language  = {en}
}
@inproceedings{SchleupenEngemannBagherietal.2017,
  author    = {Schleupen, Josef and Engemann, Heiko and Bagheri, Mohsen and Kallweit, Stephan and Dahmann, Peter},
  title     = {Developing a climbing maintenance robot for tower and rotor blade service of wind turbines},
  series = {Advances in Robot Design and Intelligent Control : Proceedings of the 25th Conference on Robotics in Alpe-Adria-Danube Region (RAAD16)},
  booktitle = {Advances in Robot Design and Intelligent Control : Proceedings of the 25th Conference on Robotics in Alpe-Adria-Danube Region (RAAD16)},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-319-49058-8},
  doi       = {10.1007/978-3-319-49058-8_34},
  pages     = {310 -- 319},
  year      = {2017},
  language  = {en}
}
@article{Thomas2016,
  author    = {Thomas, Axel},
  title     = {Genussrechte als Instrument der Unternehmensfinanzierung von kommunalen Wohnungs- baugesellschaften},
  series = {VM Verwaltung und Management},
  volume    = {22},
  journal   = {VM Verwaltung und Management},
  number    = {6},
  publisher = {Nomos},
  address   = {Baden-Baden},
  issn      = {0947-9856},
  doi       = {10.5771/0947-9856-2016-6-322},
  pages     = {322 -- 327},
  year      = {2016},
  abstract  = {Die kommunalen Wohnungsbaugesellschaften und ihr Gesch{\"a}ftszweck bzw. Versorgungsauftrag erfahren aus gesamtgesellschaftlichen Gr{\"u}nden aktuell einen erheblichen Bedeutungszuwachs. Der kommunale Wohnungsbau soll und muss intensiviert werden, da z.B. zunehmend Wohnungsbindungen auslaufen. Bezahlbare Neubauten fehlen speziell Familien, Senioren, Studenten und Fl{\"u}chtlingen. Um das Investitionsvolumen zu bew{\"a}ltigen, bedarf es nicht nur der F{\"o}rderkredite, sondern auch der Zuf{\"u}hrung „frischen Kapitals". Der Beitrag stellt dar, dass Genussrechte ein interessantes und oft unbekanntes Finanzierungsinstrument f{\"u}r kommunale Wohnungsbaugesellschaften mit passgenauen Ausgestaltungsm{\"o}glichkeiten sind. Mit Hilfe von Genussrechten k{\"o}nnen die notwendigen Neubau-Investitionen solide mit Quasi-Eigenkapital unterlegt werden und den sozialen Wohnungsbau wiederbeleben. Genussrechte als Hybridkapital lassen sich mangels gesetzlicher Eingrenzung exakt und individuell ebenso an die Bed{\"u}rfnisse der kommunalen Wohnungsbaugesellschaft anpassen wie an die der Gesellschafter und des jeweiligen Neubauvorhabens.},
  language  = {de}
}
@inproceedings{KesslerBalcGebhardt2016,
  author    = {Kessler, Julia and Balc, Nicolae and Gebhardt, Andreas},
  title     = {Basic research on lattice structures focused on the strut shape and welding beads},
  series = {Physics Procedia},
  volume    = {Vol. 83},
  booktitle = {Physics Procedia},
  issn      = {1875-3884},
  doi       = {10.1016/j.phpro.2016.08.086},
  pages     = {833 -- 838},
  year      = {2016},
  language  = {en}
}
@article{KilicRaatschenKoerfgenetal.2017,
  author    = {Kilic, S. A. and Raatschen, Hans-J{\"u}rgen and K{\"o}rfgen, B. and Apaydin, N. M. and Astaneh-Asl, A.},
  title     = {FE Model of the Fatih Sultan Mehmet Suspension Bridge Using Thin Shell Finite Elements},
  series = {Arabian Journal for Science and Engineering},
  volume    = {42},
  journal   = {Arabian Journal for Science and Engineering},
  number    = {3},
  publisher = {Springer Nature},
  issn      = {2191-4281},
  doi       = {10.1007/s13369-016-2316-y},
  pages     = {1103 -- 1116},
  year      = {2017},
  abstract  = {This paper presents the results of an eigenvalue analysis of the Fatih Sultan Mehmet Bridge. A high-resolution finite element model was created directly from the available design documents. All physical properties of the structural components were included in detail, so no calibration to the measured data was necessary. The deck and towers were modeled with shell elements. A nonlinear static analysis was performed before the eigenvalue calculation. The calculated natural frequencies and corresponding mode shapes showed good agreement with the available measured ambient vibration data. The calculation of the effective modal mass showed that nine modes had single contributions higher than 5 \% of the total mass. They were in a frequency range up to 1.2 Hz. The comparison of the results for the torsional modes especially demonstrated the advantage of using thin shell finite elements over the beam modeling approach.},
  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}
}
@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}
}
@book{Gebhardt2016,
  author    = {Gebhardt, Andreas},
  title     = {Additive Fertigungsverfahren : Additive Manufacturing und 3D-Drucken f{\"u}r Prototyping - Tooling - Produktion},
  edition   = {5. aktualisierte und erweiterte Auflage},
  publisher = {Hanser},
  address   = {M{\"u}nchen},
  isbn      = {978-3-446-44401-0 ; 978-3-446-44539-0},
  doi       = {10.3139/9783446445390},
  pages     = {XXIV, 711 S. : zahlr. Ill. u. graph. Darst.},
  year      = {2016},
  language  = {de}
}