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

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

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

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

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

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

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

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

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

Properties of Graded Posets Preserved by Some Operations. - Bezrukov, Sergei L.; Engel, Konrad (2013)

Incremental Network Design with Minimum Spanning Trees. - Engel, Konrad; Kalinowski, Thomas; Savelsbergh, Martin W. P. (CoRR, 2013)

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

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

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

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

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

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

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

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

Optimal matrix-segmentation by rectangles. - Engel, Konrad (Electron. Notes Discret. Math., 2006)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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