Konrad Engel

49 papers Journal 46Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
An Identity Theorem for the Fourier-Laplace Transform of Polytopes on Nonzero Complex Multiples of Rationally Parameterizable Hypersurfaces.
Discret. Comput. Geom.
Konrad Engel
2018 J jnl
Bandwidth of Graphs Resulting from the Edge Clique Covering Problem.
Electron. J. Comb.
Konrad Engel, Sebastian Hanisch
2018 J jnl
Boundary optimization for rough sets.
Discret. Math.
Konrad Engel, Tran Dan Thu
2017 J jnl
Incremental Network Design with Minimum Spanning Trees.
J. Graph Algorithms Appl.
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
2015 J jnl
The Dilworth Number of Auto-Chordal Bipartite Graphs.
Graphs Comb.
Anne Berry, Andreas Brandstädt, Konrad Engel
2014 J jnl
Optimal integer partitions.
Eur. J. Comb.
Konrad Engel, Tadeusz Radzik, Jan-Christoph Schlage-Puchta
2014 J jnl
Partition into almost straight trails.
Discret. Appl. Math.
Harald Birkholz, Konrad Engel
2014 J jnl
Preface.
Discret. Appl. Math.
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
2014 J jnl
Reconstruction of cell-electrode-adjacencies on multielectrode arrays.
J. Comput. Neurosci.
Konrad Engel, Sebastian Hanisch
2013 J jnl
Incremental Network Design with Minimum Spanning Trees.
CoRR
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
2013 — ch.
Properties of Graded Posets Preserved by Some Operations.
The Mathematics of Paul Erdős II
Sergei L. Bezrukov, Konrad Engel
2013 J jnl
The Dilworth Number of Auto-Chordal-Bipartite Graphs.
CoRR
Anne Berry, Andreas Brandstädt, Konrad Engel
2012 J jnl
Solution of a problem on non-negative subset sums.
Eur. J. Comb.
Konrad Engel, Caterina Nardi
2011 J jnl
A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy.
Algorithmica
Danny Z. Chen, Konrad Engel, Chao Wang
2011 J jnl
Approximated matrix decomposition for IMRT planning with multileaf collimators.
OR Spectr.
Konrad Engel, Antje Kiesel
2010 J jnl
A note on full transversals and mixed orthogonal arrays.
Australas. J Comb.
Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely
2009 J jnl
A generalization of Sperner's theorem and an application to graph orientations.
Discret. Appl. Math.
Jianguo Qian, Konrad Engel, Wei Xu
2009 J jnl
Optimal matrix-segmentation by rectangles.
Discret. Appl. Math.
Konrad Engel
2009 J jnl
Preface.
Discret. Appl. Math.
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
2006 — conf
Algorithms for Leakage Reduction with Dual Threshold Design Techniques.
SoC
Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann
2006 J jnl
Optimal matrix-segmentation by rectangles.
Electron. Notes Discret. Math.
Konrad Engel
2005 J jnl
A new algorithm for optimal multileaf collimator field segmentation.
Discret. Appl. Math.
Konrad Engel
2004 J jnl
Preface: ODSA.
Discret. Appl. Math.
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn
2003 J jnl
Testing Bandwidth k for k-Connected Graphs.
SIAM J. Discret. Math.
Konrad Engel, Sven Guttmann
2002 — conf
Minimal Sample Databases for Global Cardinality Constraints.
FoIKS
Konrad Engel, Sven Hartmann
2002 J jnl
On the average size of sets in intersecting Sperner families.
Discret. Math.
Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
2002 J jnl
The t-intersection Problem in the Truncated Boolean Lattice.
Eur. J. Comb.
Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
1999 J jnl
An Asymptotic Complete Intersection Theorem for Chain Products.
Eur. J. Comb.
Christian Bey, Konrad Engel
1999 J jnl
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.
Discret. Appl. Math.
E. Rodney Canfield, Konrad Engel
1997 J jnl
The order-interval hypergraph of a finite poset and the König property.
Discret. Math.
Isma Bouchemakh, Konrad Engel
1996 J jnl
Interval Packing and Covering in the Boolean Lattice.
Comb. Probab. Comput.
Konrad Engel
1995 J jnl
An Algorithm for the Determination of the Variance of a Partially Ordered Set.
J. Algorithms
Konrad Engel
1994 J jnl
On the Average Rank of an Element in a Filter of the Partition Lattice.
J. Comb. Theory A
Konrad Engel
1992 J jnl
Perfectly orderable graphs and almost all perfect graphs are kernel
Graphs Comb.
Mostafa Blidia, Konrad Engel
1990 J jnl
Polytopes determined by complementfree Sperner families.
Discret. Math.
Konrad Engel, Péter L. Erdös
1989 J jnl
About k-optimal Representations of Posets.
J. Inf. Process. Cybern.
Konrad Engel
1989 J jnl
Sperner families satisfying additional conditions and their convex hulls.
Graphs Comb.
Konrad Engel, Péter L. Erdös
1986 J jnl
A Continuous Version of a Sperner-type Theorem.
J. Inf. Process. Cybern.
Konrad Engel
1986 J jnl
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.
Eur. J. Comb.
Konrad Engel, Peter Frankl
1986 J jnl
An Erdős-Ko-Rado Type Theorem II.
Acta Cybern.
Konrad Engel, Hans-Dietrich O. F. Gronau
1986 J jnl
Optimal Representations of Partially Ordered Sets and a Limit Sperner Theorem.
Eur. J. Comb.
Konrad Engel
1985 J jnl
A New Proof of a Theorem of Harper on the Sperner-Erdös Problem.
J. Comb. Theory A
Konrad Engel
1985 J jnl
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets.
Comb.
Konrad Engel, Nikolai N. Kuzjurin
1985 J jnl
An intersection-union theorem for integer sequences.
Discret. Math.
Konrad Engel, Hans-Dietrich O. F. Gronau
1984 J jnl
An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets.
J. Comb. Theory A
Konrad Engel, Nikolai N. Kuzjurin
1984 J jnl
An Erdös - Ko- Rado theorem for the subcubes of a cube.
Comb.
Konrad Engel
1984 J jnl
Strong properties in partially ordered sets II.
Discret. Math.
Konrad Engel
1983 J jnl
About the number of pairs of elements of E
Discret. Math.
Konrad Engel
1983 J jnl
Strong properties in partially ordered sets I.
Discret. Math.
Konrad Engel