| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Konrad Engel, Caterina Nardi |
Solution of a problem on non-negative subset sums.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Konrad Engel, Chao Wang |
A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le |
Preface. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianguo Qian, Konrad Engel, Wei Xu |
A generalization of Sperner's theorem and an application to graph orientations. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
Optimal matrix-segmentation by rectangles. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
Optimal matrix-segmentation by rectangles. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
A new algorithm for optimal multileaf collimator field segmentation. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn |
Preface: ODSA. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel, Sven Guttmann |
Testing Bandwidth k for k-Connected Graphs. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck |
On the average size of sets in intersecting Sperner families. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian |
The t-intersection Problem in the Truncated Boolean Lattice. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel, Sven Hartmann |
Minimal Sample Databases for Global Cardinality Constraints. |
FoIKS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Bey, Konrad Engel |
An Asymptotic Complete Intersection Theorem for Chain Products. |
Eur. J. Comb. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Rodney Canfield, Konrad Engel |
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Isma Bouchemakh, Konrad Engel |
The order-interval hypergraph of a finite poset and the König property. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
Interval Packing and Covering in the Boolean Lattice. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
An Algorithm for the Determination of the Variance of a Partially Ordered Set. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
On the Average Rank of an Element in a Filter of the Partition Lattice. |
J. Comb. Theory, Ser. A |
1994 |
DBLP BibTeX RDF |
|
| 1 | Mostafa Blidia, Konrad Engel |
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. |
Graphs and Combinatorics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel, Péter L. Erdös |
Polytopes determined by complementfree Sperner families. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
About k-optimal Representations of Posets. |
Elektronische Informationsverarbeitung und Kybernetik |
1989 |
DBLP BibTeX RDF |
|
| 1 | Konrad Engel, Péter L. Erdös |
Sperner families satisfying additional conditions and their convex hulls. |
Graphs and Combinatorics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel, Hans-Dietrich O. F. Gronau |
An Erös - Ko - Rado Type Theorem II. |
Acta Cybern. |
1986 |
DBLP BibTeX RDF |
|
| 1 | Konrad Engel |
A Continuous Version of a Sperner-type Theorem. |
Elektronische Informationsverarbeitung und Kybernetik |
1986 |
DBLP BibTeX RDF |
|
| 1 | Konrad Engel |
A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. |
J. Comb. Theory, Ser. A |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel, Hans-Dietrich O. F. Gronau |
An intersection-union theorem for integer sequences. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
Strong properties in partially ordered sets II. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
An Erdös - Ko- Rado theorem for the subcubes of a cube. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
Strong properties in partially ordered sets I. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Engel |
About the number of pairs of elements of Enk whose distances have given values. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")