Konrad Engel An Erdös - Ko- Rado theorem for the subcubes of a cube. [Citation Graph (0, 0)][DBLP] Combinatorica, 1984, v:4, n:2, pp:133-140 [Journal]
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. [Citation Graph (0, 0)][DBLP] Combinatorica, 1985, v:5, n:4, pp:301-309 [Journal]
Konrad Engel Interval Packing and Covering in the Boolean Lattice. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:373-384 [Journal]
E. Rodney Canfield, Konrad Engel An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:169-180 [Journal]
Konrad Engel A new algorithm for optimal multileaf collimator field segmentation. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:35-51 [Journal]
Konrad Engel A Continuous Version of a Sperner-type Theorem. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:1, pp:45-50 [Journal]
Konrad Engel About k-optimal Representations of Posets. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:1/2, pp:3-10 [Journal]
Konrad Engel An Algorithm for the Determination of the Variance of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:19, n:3, pp:441-448 [Journal]
Konrad Engel A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1985, v:39, n:1, pp:19-24 [Journal]
Konrad Engel On the Average Rank of an Element in a Filter of the Partition Lattice. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1994, v:65, n:1, pp:67-78 [Journal]
Konrad Engel Strong properties in partially ordered sets I. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:47, n:, pp:229-234 [Journal]
Konrad Engel Strong properties in partially ordered sets II. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:48, n:2-3, pp:187-196 [Journal]
Konrad Engel About the number of pairs of elements of Enk whose distances have given values. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:45, n:2-3, pp:209-216 [Journal]