@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{WulfhorstDuweMerseburgetal.2016,
  author    = {Wulfhorst, Helene and Duwe, Anna-Maria and Merseburg, Johannes and Tippk{\"o}tter, Nils},
  title     = {Compositional analysis of pretreated (beech) wood using differential scanning calorimetry and multivariate data analysis},
  series = {Tetrahedron},
  volume    = {72},
  journal   = {Tetrahedron},
  number    = {46},
  publisher = {Elsevier},
  address   = {Amsterdam},
  doi       = {10.1016/j.tet.2016.04.029},
  pages     = {7329 -- 7334},
  year      = {2016},
  abstract  = {The composition of plant biomass varies depending on the feedstock and pre-treatment conditions and influences its processing in biorefineries. In order to ensure optimal process conditions, the quantitative proportion of the main polymeric components of the pre-treated biomass has to be determined. Current standard procedures for biomass compositional analysis are complex, the measurements are afflicted with errors and therefore often not comparable. Hence, new powerful analytical methods are urgently required to characterize biomass. In this contribution, Differential Scanning Calorimetry (DSC) was applied in combination with multivariate data analysis (MVA) to detect the cellulose content of the plant biomass pretreated by Liquid Hot Water (LHW) and Organosolv processes under various conditions. Unlike conventional techniques, the developed analytic method enables the accurate quantification of monosaccharide content of the plant biomass without any previous sample preparation. It is easy to handle and avoids errors in sample preparation.},
  language  = {en}
}
@article{SchoppDollGraeseretal.2016,
  author    = {Schopp, Christoph and Doll, Timo and Gr{\"a}ser, Ulrich and Harzheim, Thomas and Heuermann, Holger and Kling, Rainer and Marso, Michael},
  title     = {Capacitively Coupled High-Pressure Lamp Using Coaxial Line Networks},
  series = {IEEE Transactions on Microwave Theory and Techniques},
  volume    = {64},
  journal   = {IEEE Transactions on Microwave Theory and Techniques},
  number    = {10},
  publisher = {IEEE},
  address   = {New York, NY},
  issn      = {0018-9480},
  doi       = {10.1109/TMTT.2016.2600326},
  pages     = {3363 -- 3368},
  year      = {2016},
  abstract  = {This paper describes the development of a capacitively coupled high-pressure lamp with input power between 20 and 43 W at 2.45 GHz, using a coaxial line network. Compared with other electrodeless lamp systems, no cavity has to be used and a reduction in the input power is achieved. Therefore, this lamp is an alternative to the halogen incandescent lamp for domestic lighting. To serve the demands of domestic lighting, the filling of the lamp is optimized over all other resulting requirements, such as high efficacy at low induced powers and fast startups. A workflow to develop RF-driven plasma applications is presented, which makes use of the hot S-parameter technique. Descriptions of the fitting process inside a circuit and FEM simulator are given. Results of the combined ignition and operation network from simulations and measurements are compared. An initial prototype is built and measurements of the lamp's lighting properties are presented along with an investigation of the efficacy optimizations using large signal amplitude modulation. With this lamp, an efficacy of 135 lmW -1 is achieved.},
  language  = {en}
}
@article{SchifferFerrein2016,
  author    = {Schiffer, Stefan and Ferrein, Alexander},
  title     = {Decision-Theoretic Planning with Fuzzy Notions in GOLOG},
  series = {International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems},
  volume    = {24},
  journal   = {International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems},
  number    = {Issue Suppl. 2},
  publisher = {World Scientific},
  address   = {Singapur},
  issn      = {1793-6411},
  doi       = {10.1142/S0218488516400134},
  pages     = {123 -- 143},
  year      = {2016},
  abstract  = {In this paper we present an extension of the action language Golog that allows for using fuzzy notions in non-deterministic argument choices and the reward function in decision-theoretic planning. Often, in decision-theoretic planning, it is cumbersome to specify the set of values to pick from in the non-deterministic-choice-of-argument statement. Also, even for domain experts, it is not always easy to specify a reward function. Instead of providing a finite domain for values in the non-deterministic-choice-of-argument statement in Golog, we now allow for stating the argument domain by simply providing a formula over linguistic terms and fuzzy uents. In Golog's forward-search DT planning algorithm, these formulas are evaluated in order to find the agent's optimal policy. We illustrate this in the Diner Domain where the agent needs to calculate the optimal serving order.},
  language  = {en}
}
@article{FerreinSteinbauer2016,
  author    = {Ferrein, Alexander and Steinbauer, Gerald},
  title     = {The Interplay of Aldebaran and RoboCup},
  series = {KI - K{\"u}nstliche Intelligenz},
  volume    = {30},
  journal   = {KI - K{\"u}nstliche Intelligenz},
  number    = {3-4},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1610-1987},
  doi       = {10.1007/s13218-016-0440-1},
  pages     = {325 -- 326},
  year      = {2016},
  language  = {en}
}
@article{SteinbauerFerrein2016,
  author    = {Steinbauer, Gerald and Ferrein, Alexander},
  title     = {20 Years of RoboCup},
  series = {KI - K{\"u}nstliche Intelligenz},
  volume    = {30},
  journal   = {KI - K{\"u}nstliche Intelligenz},
  number    = {3-4},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1610-1987},
  doi       = {10.1007/s13218-016-0442-z},
  pages     = {221 -- 224},
  year      = {2016},
  language  = {en}
}
@article{FerreinSteinbauer2016,
  author    = {Ferrein, Alexander and Steinbauer, Gerald},
  title     = {Looking back on 20 Years of RoboCup},
  series = {KI - K{\"u}nstliche Intelligenz},
  volume    = {30},
  journal   = {KI - K{\"u}nstliche Intelligenz},
  number    = {3-4},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1610-1987},
  doi       = {10.1007/s13218-016-0443-y},
  pages     = {321 -- 323},
  year      = {2016},
  language  = {en}
}