Suchergebnisse - Classificació AMS::05 Combinatorics::05B Designs and configurations

Pharmacokinetics in Morbid Obesity: Influence of Two Bariatric Surgery Techniques on Paracetamol and Caffeine Metabolism von Goday Arno, Albert, Farré, Magí, Rodríguez-Morató, Jose, Ramon, Jose M., Pérez-Mañá, Clara, Papaseit, Esther, Civit, Ester, Langohr, Klaus, lí Carbó, Marcel, Boix, David Benaiges, Nino, Olga Castañer, Le Roux, Juana Antonia Flores, Pera, Manuel, Grande, Luis, de la Torre, Rafael

“… Purpose The purpose of the study was to study the impact of the two most common bariatric surgery techniques on paracetamol pharmacokinetics (a marker of …”
Volltext

Transformation and decomposition of clutters into matroids von Martí-Farré, Jaume, de Mier, Anna

“… A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters …”
Volltext

A novel model for arc territory design: promoting Eulerian districts von Garcia Ayala, Gariela, González Velarde, José Luis, Rios Mercados, Roger, Fernández Aréizaga, Elena

“… The problem of district design for the implementation of arc routing activities is addressed …”
Volltext

Empty Triangles in Good Drawings of the Complete Graph von Aichholzer, Oswin, Hackl, Thomas, Pilz, Alexander, Ramos, Pedro, Sacristán, Vera, Vogtenhuber, Birgit

“… A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as …”
Volltext

Extending Brickell–Davenport theorem to non-perfect secret sharing schemes von Farràs, Oriol, Padró, Carles

“… One important result in secret sharing is the Brickell–Davenport theorem: every ideal perfect secret sharing scheme defines a matroid that is uniquely …”
Volltext

Lattice path matroids: Structural properties von Bonin, Joseph E., de Mier, Anna

“… This paper studies structural aspects of lattice path matroids. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats …”
Volltext

On secret sharing schemes, matroids and polymatroids von Martí-Farré Jaume, Padró Carles

“… The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of …”
Volltext