Strong properties in partially ordered sets I. - Konrad Engel (Discret. Math., 1983)

About the number of pairs of elements of Enk whose distances have given values. - Konrad Engel (Discret. Math., 1983)

An Erdös - Ko- Rado theorem for the subcubes of a cube. - Konrad Engel (Comb., 1984)

Strong properties in partially ordered sets II. - Konrad Engel (Discret. Math., 1984)

An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets. - Konrad Engel; Nikolai N. Kuzjurin (J. Comb. Theory A, 1984)

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. - Konrad Engel; Nikolai N. Kuzjurin (Comb., 1985)

An intersection-union theorem for integer sequences. - Konrad Engel; Hans-Dietrich O. F. Gronau (Discret. Math., 1985)

A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. - Konrad Engel (J. Comb. Theory A, 1985)

An Erdős-Ko-Rado Type Theorem II. - Konrad Engel; Hans-Dietrich O. F. Gronau (Acta Cybern., 1986)

A Continuous Version of a Sperner-type Theorem. - Konrad Engel (J. Inf. Process. Cybern., 1986)

Optimal Representations of Partially Ordered Sets and a Limit Sperner Theorem. - Konrad Engel (Eur. J. Comb., 1986)

An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank. - Konrad Engel; Peter Frankl (Eur. J. Comb., 1986)

About k-optimal Representations of Posets. - Konrad Engel (J. Inf. Process. Cybern., 1989)

Sperner families satisfying additional conditions and their convex hulls. - Konrad Engel; Péter L. Erdös (Graphs Comb., 1989)

Polytopes determined by complementfree Sperner families. - Konrad Engel; Péter L. Erdös (Discret. Math., 1990)

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. - Mostafa Blidia; Konrad Engel (Graphs Comb., 1992)

On the Average Rank of an Element in a Filter of the Partition Lattice. - Konrad Engel (J. Comb. Theory A, 1994)

An Algorithm for the Determination of the Variance of a Partially Ordered Set. - Konrad Engel (J. Algorithms, 1995)

Interval Packing and Covering in the Boolean Lattice. - Konrad Engel (Comb. Probab. Comput., 1996)

The order-interval hypergraph of a finite poset and the König property. - Isma Bouchemakh; Konrad Engel (Discret. Math., 1997)

An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. - E. Rodney Canfield; Konrad Engel (Discret. Appl. Math., 1999)

An Asymptotic Complete Intersection Theorem for Chain Products. - Christian Bey; Konrad Engel (Eur. J. Comb., 1999)

Minimal Sample Databases for Global Cardinality Constraints. - Konrad Engel; Sven Hartmann (FoIKS, 2002)

On the average size of sets in intersecting Sperner families. - Christian Bey; Konrad Engel; Gyula O. H. Katona; Uwe Leck (Discret. Math., 2002)

The t-intersection Problem in the Truncated Boolean Lattice. - Rudolf Ahlswede; Christian Bey; Konrad Engel; Levon H. Khachatrian (Eur. J. Comb., 2002)

Testing Bandwidth k for k-Connected Graphs. - Konrad Engel; Sven Guttmann (SIAM J. Discret. Math., 2003)

Preface: ODSA. - Andreas Brandstädt; Konrad Engel; Hans-Dietrich O. F. Gronau; Roger Labahn (Discret. Appl. Math., 2004)

A new algorithm for optimal multileaf collimator field segmentation. - Konrad Engel (Discret. Appl. Math., 2005)

Algorithms for Leakage Reduction with Dual Threshold Design Techniques. - Konrad Engel; Thomas Kalinowski; Roger Labahn; Frank Sill; Dirk Timmermann (SoC, 2006)

Preface. - Andreas Brandstädt; Konrad Engel; Hans-Dietrich O. F. Gronau; Van Bang Le (Discret. Appl. Math., 2009)

Optimal matrix-segmentation by rectangles. - Konrad Engel (Discret. Appl. Math., 2009)

A generalization of Sperner's theorem and an application to graph orientations. - Jianguo Qian; Konrad Engel; Wei Xu (Discret. Appl. Math., 2009)

A note on full transversals and mixed orthogonal arrays. - Harout K. Aydinian; Éva Czabarka; Konrad Engel; Péter L. Erdös; László A. Székely (Australas. J Comb., 2010)

A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy. - Danny Z. Chen; Konrad Engel; Chao Wang 002 (Algorithmica, 2011)

Approximated matrix decomposition for IMRT planning with multileaf collimators. - Konrad Engel; Antje Kiesel (OR Spectr., 2011)

Solution of a problem on non-negative subset sums. - Konrad Engel; Caterina Nardi (Eur. J. Comb., 2012)

Properties of Graded Posets Preserved by Some Operations. - Sergei L. Bezrukov; Konrad Engel (The Mathematics of Paul Erdős II, 2013)

Partition into almost straight trails. - Harald Birkholz; Konrad Engel (Discret. Appl. Math., 2014)

Preface. - Andreas Brandstädt; Konrad Engel; Hans-Dietrich O. F. Gronau; Roger Labahn; Van Bang Le; Florian Pfender (Discret. Appl. Math., 2014)

Optimal integer partitions. - Konrad Engel; Tadeusz Radzik; Jan-Christoph Schlage-Puchta (Eur. J. Comb., 2014)

Reconstruction of cell-electrode-adjacencies on multielectrode arrays. - Konrad Engel; Sebastian Hanisch (J. Comput. Neurosci., 2014)

The Dilworth Number of Auto-Chordal Bipartite Graphs. - Anne Berry; Andreas Brandstädt; Konrad Engel (Graphs Comb., 2015)

Incremental Network Design with Minimum Spanning Trees. - Konrad Engel; Thomas Kalinowski; Martin W. P. Savelsbergh (J. Graph Algorithms Appl., 2017)

Bandwidth of Graphs Resulting from the Edge Clique Covering Problem. - Konrad Engel; Sebastian Hanisch (Electron. J. Comb., 2018)

Boundary optimization for rough sets. - Konrad Engel; Tran Dan Thu (Discret. Math., 2018)

An Identity Theorem for the Fourier-Laplace Transform of Polytopes on Nonzero Complex Multiples of Rationally Parameterizable Hypersurfaces. - Konrad Engel (Discret. Comput. Geom., 2023)