@inproceedings{KleineKallweitMichauxetal.2016,
  author    = {Kleine, Harald and Kallweit, Stephan and Michaux, Frank and Havermann, Marc and Olivier, Herbert},
  title     = {PIV Measurement of Shock Wave Diffraction},
  series = {18th International Symposium on Applications of Laser Techniques to Fluid Mechanics, 2016, Lissabon},
  booktitle = {18th International Symposium on Applications of Laser Techniques to Fluid Mechanics, 2016, Lissabon},
  pages     = {1 -- 14},
  year      = {2016},
  language  = {en}
}
@inproceedings{SchleupenEngemannBagherietal.2016,
  author    = {Schleupen, Josef and Engemann, Heiko and Bagheri, Mohsen and Kallweit, Stephan},
  title     = {The potential of SMART climbing robot combined with a weatherproof cabin for rotor blade maintenance},
  series = {17th European Conference on Composite Materials - ECCM, Munich, Germany},
  booktitle = {17th European Conference on Composite Materials - ECCM, Munich, Germany},
  pages     = {1 -- 8},
  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}
}
@inproceedings{KoenigWolf2016,
  author    = {K{\"o}nig, Johannes Alexander and Wolf, Martin R.},
  title     = {A new definition of competence developing games - and a framework to assess them},
  series = {ACHI 2016 : The Ninth International Conference on Advances in Computer-Human Interactions},
  booktitle = {ACHI 2016 : The Ninth International Conference on Advances in Computer-Human Interactions},
  isbn      = {978-1-61208-468-8},
  pages     = {95 -- 97},
  year      = {2016},
  abstract  = {There are different types of games that try to make use of the motivation of a gaming situation in learning contexts. This paper introduces the new terminology 'Competence Developing Game' (CDG) as an umbrella term for all games with this intention. Based on this new terminology, an assessment framework has been developed and validated in scope of an empirical study. Now, all different types of CDGs can be evaluated according to a defined and uniform set of assessment criteria and, thus, are comparable according to their characteristics and effectiveness.},
  language  = {en}
}
@article{FateriGebhardt2015,
  author    = {Fateri, Miranda and Gebhardt, Andreas},
  title     = {Additive manufactured mechanical disentanglement lock},
  series = {RTejournal - Forum f{\"u}r Rapid Technologie},
  volume    = {12},
  journal   = {RTejournal - Forum f{\"u}r Rapid Technologie},
  publisher = {Fachhochschule Aachen},
  address   = {Aachen},
  issn      = {1614-0923},
  url       = {http://nbn-resolving.de/urn:nbn:de:0009-2-42147},
  year      = {2015},
  language  = {en}
}
@inproceedings{GrossmannGabrielliHerdrichetal.2015,
  author    = {Großmann, Agnes and Gabrielli, Roland Antonius and Herdrich, Georg and Fasoulas, Stefanos and Schnauffer, Peter and Middendorf, Peter and Fateri, Miranda and Gebhardt, Andreas},
  title     = {Overview of the MultiRob 3D Lunar Industrial Development Project},
  series = {Conference Contribution for the 30th ISTS, Kobe, Japan, 04.07.-10.07.2015},
  booktitle = {Conference Contribution for the 30th ISTS, Kobe, Japan, 04.07.-10.07.2015},
  pages     = {8 S.},
  year      = {2015},
  language  = {en}
}
@article{KesslerBalcGebhardtetal.2015,
  author    = {Kessler, Julia and Balc, Nicolae and Gebhardt, Andreas and Abbas, Karim},
  title     = {Basic Research on Lattice Structures Focused on the Tensile Strength},
  series = {Applied Mechanics and Materials},
  volume    = {Vol. 808},
  journal   = {Applied Mechanics and Materials},
  publisher = {Trans Tech Publications},
  address   = {B{\"a}ch},
  issn      = {1662-7482},
  doi       = {10.4028/www.scientific.net/AMM.808.193},
  pages     = {193 -- 198},
  year      = {2015},
  language  = {en}
}
@inproceedings{FateriGebhardtGabriellietal.2015,
  author    = {Fateri, Miranda and Gebhardt, Andreas and Gabrielli, Roland Antonius and Herdrich, Georg and Fasoulas, Stefanos and Großmann, Agnes and Schnauffer, Peter and Middendorf, Peter},
  title     = {Additive Manufacturing of Lunar Regolith for Extra-terrestrial Industry Plant},
  series = {International Symposium on Space Technology and Science (ICTS). July 2015, Kobe, Japan},
  booktitle = {International Symposium on Space Technology and Science (ICTS). July 2015, Kobe, Japan},
  pages     = {5 S.},
  year      = {2015},
  language  = {en}
}