Konrad Engel

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 5

Top Topics

Bipartite Graph

Top Venues

Discret. Appl. Math.

J. Comput. Neurosci.

Discret. Comput. Geom.

Publications

Konrad Engel
An Identity Theorem for the Fourier-Laplace Transform of Polytopes on Nonzero Complex Multiples of Rationally Parameterizable Hypersurfaces. Discret. Comput. Geom. 69 (1) (2023)
Konrad Engel, Sebastian Hanisch
Bandwidth of Graphs Resulting from the Edge Clique Covering Problem. Electron. J. Comb. 25 (4) (2018)
Konrad Engel, Tran Dan Thu
Boundary optimization for rough sets. Discret. Math. 341 (9) (2018)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21 (4) (2017)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. 31 (5) (2015)
Konrad Engel, Tadeusz Radzik, Jan-Christoph Schlage-Puchta
Optimal integer partitions. Eur. J. Comb. 36 (2014)
Harald Birkholz, Konrad Engel
Partition into almost straight trails. Discret. Appl. Math. 163 (2014)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
Preface. Discret. Appl. Math. 163 (2014)
Konrad Engel, Sebastian Hanisch
Reconstruction of cell-electrode-adjacencies on multielectrode arrays. J. Comput. Neurosci. 37 (3) (2014)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR (2013)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. CoRR (2013)
Konrad Engel, Caterina Nardi
Solution of a problem on non-negative subset sums. Eur. J. Comb. 33 (6) (2012)
Danny Z. Chen, Konrad Engel, Chao Wang
A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy. Algorithmica 61 (3) (2011)
Konrad Engel, Antje Kiesel
Approximated matrix decomposition for IMRT planning with multileaf collimators. OR Spectr. 33 (1) (2011)
Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48 (2010)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
Preface. Discret. Appl. Math. 157 (9) (2009)
Konrad Engel
Optimal matrix-segmentation by rectangles. Discret. Appl. Math. 157 (9) (2009)
Jianguo Qian, Konrad Engel, Wei Xu
A generalization of Sperner's theorem and an application to graph orientations. Discret. Appl. Math. 157 (9) (2009)
Konrad Engel
Optimal matrix-segmentation by rectangles. Electron. Notes Discret. Math. 27 (2006)
Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann
Algorithms for Leakage Reduction with Dual Threshold Design Techniques. SoC (2006)
Konrad Engel
A new algorithm for optimal multileaf collimator field segmentation. Discret. Appl. Math. 152 (1-3) (2005)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn
Preface: ODSA. Discret. Appl. Math. 138 (1-2) (2004)
Konrad Engel, Sven Guttmann
Testing Bandwidth k for k-Connected Graphs. SIAM J. Discret. Math. 16 (2) (2003)
Konrad Engel, Sven Hartmann
Minimal Sample Databases for Global Cardinality Constraints. FoIKS (2002)
Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
The t-intersection Problem in the Truncated Boolean Lattice. Eur. J. Comb. 23 (5) (2002)
Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
On the average size of sets in intersecting Sperner families. Discret. Math. 257 (2-3) (2002)
E. Rodney Canfield, Konrad Engel
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. Discret. Appl. Math. 95 (1-3) (1999)
Christian Bey, Konrad Engel
An Asymptotic Complete Intersection Theorem for Chain Products. Eur. J. Comb. 20 (5) (1999)
Isma Bouchemakh, Konrad Engel
The order-interval hypergraph of a finite poset and the König property. Discret. Math. 170 (1-3) (1997)
Konrad Engel
Interval Packing and Covering in the Boolean Lattice. Comb. Probab. Comput. 5 (1996)
Konrad Engel
An Algorithm for the Determination of the Variance of a Partially Ordered Set. J. Algorithms 19 (3) (1995)
Konrad Engel
On the Average Rank of an Element in a Filter of the Partition Lattice. J. Comb. Theory, Ser. A 65 (1) (1994)
Mostafa Blidia, Konrad Engel
-solvable. Graphs Comb. 8 (2) (1992)
Konrad Engel, Péter L. Erdös
Polytopes determined by complementfree Sperner families. Discret. Math. 81 (2) (1990)
Konrad Engel
About k-optimal Representations of Posets. J. Inf. Process. Cybern. 25 (1/2) (1989)
Konrad Engel, Péter L. Erdös
Sperner families satisfying additional conditions and their convex hulls. Graphs Comb. 5 (1) (1989)
Konrad Engel
Optimal Representations of Partially Ordered Sets and a Limit Sperner Theorem. Eur. J. Comb. 7 (4) (1986)
Konrad Engel, Peter Frankl
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank. Eur. J. Comb. 7 (3) (1986)
Konrad Engel
A Continuous Version of a Sperner-type Theorem. J. Inf. Process. Cybern. 22 (1) (1986)
Konrad Engel, Hans-Dietrich O. F. Gronau
An Erdős-Ko-Rado Type Theorem II. Acta Cybern. 7 (4) (1986)
Konrad Engel, Hans-Dietrich O. F. Gronau
An intersection-union theorem for integer sequences. Discret. Math. 54 (2) (1985)
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. Comb. 5 (4) (1985)
Konrad Engel
A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. J. Comb. Theory, Ser. A 39 (1) (1985)
Konrad Engel
An Erdös - Ko- Rado theorem for the subcubes of a cube. Comb. 4 (2) (1984)
Konrad Engel
Strong properties in partially ordered sets II. Discret. Math. 48 (2-3) (1984)
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) (1984)
Konrad Engel
whose distances have given values. Discret. Math. 45 (2-3) (1983)
Konrad Engel
Strong properties in partially ordered sets I. Discret. Math. 47 (1983)