| 2006 |
|---|
| 25 | EE | Konrad Engel:
Optimal matrix-segmentation by rectangles.
Electronic Notes in Discrete Mathematics 27: 23-24 (2006) |
| 2005 |
|---|
| 24 | EE | Konrad Engel:
A new algorithm for optimal multileaf collimator field segmentation.
Discrete Applied Mathematics 152(1-3): 35-51 (2005) |
| 2004 |
|---|
| 23 | EE | Andreas Brandstädt,
Konrad Engel,
Hans-Dietrich O. F. Gronau,
Roger Labahn:
Preface: ODSA.
Discrete Applied Mathematics 138(1-2): 1 (2004) |
| 2003 |
|---|
| 22 | EE | Konrad Engel,
Sven Guttmann:
Testing Bandwidth k for k-Connected Graphs.
SIAM J. Discrete Math. 16(2): 301-312 (2003) |
| 2002 |
|---|
| 21 | EE | Konrad Engel,
Sven Hartmann:
Minimal Sample Databases for Global Cardinality Constraints.
FoIKS 2002: 268-288 |
| 20 | EE | Christian Bey,
Konrad Engel,
Gyula O. H. Katona,
Uwe Leck:
On the average size of sets in intersecting Sperner families.
Discrete Mathematics 257(2-3): 259-266 (2002) |
| 19 | EE | Rudolf Ahlswede,
Christian Bey,
Konrad Engel,
Levon H. Khachatrian:
The t-intersection Problem in the Truncated Boolean Lattice.
Eur. J. Comb. 23(5): 471-487 (2002) |
| 1999 |
|---|
| 18 | EE | E. Rodney Canfield,
Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.
Discrete Applied Mathematics 95(1-3): 169-180 (1999) |
| 17 | EE | Christian Bey,
Konrad Engel:
An Asymptotic Complete Intersection Theorem for Chain Products.
Eur. J. Comb. 20(5): 321-327 (1999) |
| 1997 |
|---|
| 16 | EE | Isma Bouchemakh,
Konrad Engel:
The order-interval hypergraph of a finite poset and the König property.
Discrete Mathematics 170(1-3): 51-61 (1997) |
| 1996 |
|---|
| 15 | | Konrad Engel:
Interval Packing and Covering in the Boolean Lattice.
Combinatorics, Probability & Computing 5: 373-384 (1996) |
| 1995 |
|---|
| 14 | | Konrad Engel:
An Algorithm for the Determination of the Variance of a Partially Ordered Set.
J. Algorithms 19(3): 441-448 (1995) |
| 1994 |
|---|
| 13 | | Konrad Engel:
On the Average Rank of an Element in a Filter of the Partition Lattice.
J. Comb. Theory, Ser. A 65(1): 67-78 (1994) |
| 1990 |
|---|
| 12 | EE | Konrad Engel,
Péter L. Erdös:
Polytopes determined by complementfree Sperner families.
Discrete Mathematics 81(2): 165-169 (1990) |
| 1989 |
|---|
| 11 | | Konrad Engel:
About k-optimal Representations of Posets.
Elektronische Informationsverarbeitung und Kybernetik 25(1/2): 3-10 (1989) |
| 1986 |
|---|
| 10 | | Konrad Engel,
Hans-Dietrich O. F. Gronau:
An Erös - Ko - Rado Type Theorem II.
Acta Cybern. 7(4): 405-411 (1986) |
| 9 | | Konrad Engel:
A Continuous Version of a Sperner-type Theorem.
Elektronische Informationsverarbeitung und Kybernetik 22(1): 45-50 (1986) |
| 1985 |
|---|
| 8 | | Konrad Engel,
Nikolai N. Kuzjurin:
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets.
Combinatorica 5(4): 301-309 (1985) |
| 7 | EE | Konrad Engel,
Hans-Dietrich O. F. Gronau:
An intersection-union theorem for integer sequences.
Discrete Mathematics 54(2): 153-159 (1985) |
| 6 | | Konrad Engel:
A New Proof of a Theorem of Harper on the Sperner-Erdös Problem.
J. Comb. Theory, Ser. A 39(1): 19-24 (1985) |
| 1984 |
|---|
| 5 | | Konrad Engel:
An Erdös - Ko- Rado theorem for the subcubes of a cube.
Combinatorica 4(2): 133-140 (1984) |
| 4 | EE | Konrad Engel:
Strong properties in partially ordered sets II.
Discrete Mathematics 48(2-3): 187-196 (1984) |
| 3 | | Konrad Engel,
Nikolai N. Kuzjurin:
An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets.
J. Comb. Theory, Ser. A 37(3): 337-347 (1984) |
| 1983 |
|---|
| 2 | EE | Konrad Engel:
About the number of pairs of elements of Enk whose distances have given values.
Discrete Mathematics 45(2-3): 209-216 (1983) |
| 1 | EE | Konrad Engel:
Strong properties in partially ordered sets I.
Discrete Mathematics 47: 229-234 (1983) |
