7 hasil untuk "Helmut Alt"
Menampilkan 1–7 · 4,82 detik · RSS
-
Artikel Jurnal Teks lengkap
Diamido Complexes of Titanium and Zirconium as Catalyst Precursors for Ethylene Polymerization
A series of 8 new complexes of titanium and zirconium with diamido ligands bearing an ethylene and propylene bridge between the two amido groups were synthesized and tested for ethylene polymerization. Titanium complexes bearing an ethylene bridge between the two amido groups showed higher…
-
Artikel Jurnal Teks lengkap
The effect of iodo substituents in bis(phenoxyimine) zirconium complexes on the catalytic performance of homogeneous ethylene polymerization reactions
Eight different zirconium phenoxyimine complexes were synthesized, characterized and tested as catalysts for ethylene polymerization. The phenoxyimine compounds were prepared by condensation of substituted salicylaldehydes with aliphatic and aromatic amines, the substituted salicylaldehydes from…
-
Artikel Jurnal Teks lengkap
Halogen substituted iron(III) di(imino)pyridine complexes as catalysts for 1- pentene/1-hexene co-oligomerization reactions
Nine different bis(arylimino)pyridine complexes of Fe(III) with different halide substituents (F, Cl, Br, I) at different positions of the iminophenyl group of the ligand have been synthesized, characterized and applied for homogeneous 1-pentene and 1-hexene oligomerization and co-oligomerization…
-
Artikel Jurnal Teks lengkap
Homogeneous and heterogeneous oligomerization reactions of olefins with unbridged metallocene catalysts
1-Pentene, respectively 1-hexene, were reacted with 13 homogeneous metallocene catalysts to give linear oligomerization products, predominantly dimers, with selectivities above 90%. The product distributions of the codimerization reactions of 1-pentene with 1-hexene reflected a binomial behaviour…
-
Artikel Jurnal
Approximating minimum-area rectangular and convex containers for packing convex polygons
We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient…
-
Artikel Jurnal
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons
This note corrects an error in the paper Approximating minimum-area rectangular and convex containers for packing convex polygons, which appeared in JoCG, Vol.~8(1), pages~1--10.
-
Artikel Jurnal
Placing your coins on a shelf
We consider the problem of packing a family of disks "on a shelf," that is, such that each disk touches the x-axis from above and such that no two disks overlap. We study the problem of minimizing the distance between the leftmost point and the rightmost point of any disk in such a packing. We show…