@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{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}
}
@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}
}
@book{Feuerriegel2016,
  author    = {Feuerriegel, Uwe},
  title     = {Verfahrenstechnik mit EXCEL: Verfahrenstechnische Berechnungen effektiv durchf{\"u}hren und professionell dokumentieren},
  publisher = {Springer Fachmedien},
  address   = {Wiesbaden},
  isbn      = {978-3-658-02902-9},
  doi       = {10.1007/978-3-658-02903-6},
  pages     = {XVII, 381 Seiten},
  year      = {2016},
  language  = {de}
}
@article{Wollert2016,
  author    = {Wollert, J{\"o}rg},
  title     = {Industrial Internet of Things : Seifenblase oder Revolution},
  series = {Elektronik},
  journal   = {Elektronik},
  number    = {7},
  publisher = {WEKA-Fachmedien},
  address   = {M{\"u}nchen},
  issn      = {0013-5658},
  pages     = {39 -- 45},
  year      = {2016},
  language  = {de}
}
@article{Wollert2016,
  author    = {Wollert, J{\"o}rg},
  title     = {Rapid Application Development},
  series = {Design \& Elektronik},
  journal   = {Design \& Elektronik},
  number    = {4},
  publisher = {WEKA-Fachmedien},
  address   = {M{\"u}nchen},
  issn      = {0933-8667},
  pages     = {8 -- 11},
  year      = {2016},
  abstract  = {Das IoT ist ohne eingebettete Systeme undenkbar. Erst kleine und kleinste Mikrocontroller mit intelligenten Kommunikationsschnittstellen und Anbindung ans Internet erm{\"o}glichen sinnvolles und fl{\"a}chendeckendes Einsammeln von Daten. Doch wie kompliziert ist der Einstieg in die Embedded-Welt? Dieser Artikel gibt Einblick, wie die »Arduino-Plattform« die Einstiegsh{\"u}rden f{\"u}r eingebettete Systeme dramatisch reduzieren kann.},
  language  = {de}
}