Refine
Year of publication
Document Type
- Article (5464)
- Conference Proceeding (1393)
- Book (1056)
- Part of a Book (544)
- Patent (172)
- Bachelor Thesis (156)
- Report (81)
- Doctoral Thesis (78)
- Other (68)
- Contribution to a Periodical (19)
- Master's Thesis (17)
- Review (17)
- Working Paper (8)
- Talk (5)
- Habilitation (4)
- Preprint (4)
- Diploma Thesis (3)
- Poster (3)
- Part of Periodical (2)
- Examination Thesis (1)
- Video (1)
Language
Has Fulltext
- no (9096) (remove)
Keywords
- Corporate Design (9)
- Illustration (9)
- Erscheinungsbild (8)
- Gamification (8)
- Nachhaltigkeit (8)
- Redesign (7)
- Animation (6)
- Datenschutz (6)
- Digitalisierung (6)
- avalanche (6)
- App (5)
- Earthquake (5)
- Editorial (5)
- Enterprise Architecture (5)
- Fotografie (5)
- Geschichte (5)
- MINLP (5)
- solar sail (5)
- Aktionskunst (4)
- Design (4)
Institute
- Fachbereich Medizintechnik und Technomathematik (1907)
- Fachbereich Elektrotechnik und Informationstechnik (1116)
- Fachbereich Wirtschaftswissenschaften (1100)
- Fachbereich Energietechnik (1056)
- Fachbereich Chemie und Biotechnologie (829)
- Fachbereich Maschinenbau und Mechatronik (799)
- Fachbereich Luft- und Raumfahrttechnik (749)
- Fachbereich Bauingenieurwesen (658)
- IfB - Institut für Bioengineering (623)
- INB - Institut für Nano- und Biotechnologien (584)
- Solar-Institut Jülich (334)
- Fachbereich Gestaltung (333)
- Fachbereich Architektur (161)
- ECSM European Center for Sustainable Mobility (106)
- MASKOR Institut für Mobile Autonome Systeme und Kognitive Robotik (66)
- Nowum-Energy (64)
- ZHQ - Bereich Hochschuldidaktik und Evaluation (62)
- Institut fuer Angewandte Polymerchemie (32)
- Sonstiges (24)
- IBB - Institut für Baustoffe und Baukonstruktionen (21)
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.
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.
Analysis of the long-term effect of the MBST® nuclear magnetic resonance therapy on gonarthrosis
(2016)
Regardless of size or destination, synthetic biology starts with com-parably small information units, which need to be combined and properly arranged in order to achieve a certain goal. This may be the de novo synthesis of individual genes from oligonucleotides, a shuffling of protein domains in order to create novel biocatalysts, the assembly of multiple enzyme encoding genes in metabolic pathway design, or strain development at the production stage. The CoLibry concept has been designed in order to close the gap between recombinant production of individual genes and genome editing.