The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Konrad Engel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Konrad Engel, Sven Hartmann
    Minimal Sample Databases for Global Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2002, pp:268-288 [Conf]
  2. Konrad Engel, Hans-Dietrich O. F. Gronau
    An Erös - Ko - Rado Type Theorem II. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1986, v:7, n:4, pp:405-411 [Journal]
  3. Konrad Engel
    An Erdös - Ko- Rado theorem for the subcubes of a cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:133-140 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:301-309 [Journal]
  5. Konrad Engel
    Interval Packing and Covering in the Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:373-384 [Journal]
  6. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn
    Preface: ODSA. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:1- [Journal]
  7. E. Rodney Canfield, Konrad Engel
    An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:169-180 [Journal]
  8. Konrad Engel
    A new algorithm for optimal multileaf collimator field segmentation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:35-51 [Journal]
  9. Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
    On the average size of sets in intersecting Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:259-266 [Journal]
  10. Konrad Engel
    A Continuous Version of a Sperner-type Theorem. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:1, pp:45-50 [Journal]
  11. Konrad Engel
    About k-optimal Representations of Posets. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:1/2, pp:3-10 [Journal]
  12. Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
    The t-intersection Problem in the Truncated Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:471-487 [Journal]
  13. Christian Bey, Konrad Engel
    An Asymptotic Complete Intersection Theorem for Chain Products. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:5, pp:321-327 [Journal]
  14. Konrad Engel
    An Algorithm for the Determination of the Variance of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:3, pp:441-448 [Journal]
  15. Konrad Engel
    A New Proof of a Theorem of Harper on the Sperner-Erdös Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:39, n:1, pp:19-24 [Journal]
  16. Konrad Engel
    On the Average Rank of an Element in a Filter of the Partition Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:65, n:1, pp:67-78 [Journal]
  17. Konrad Engel, Nikolai N. Kuzjurin
    An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:337-347 [Journal]
  18. Konrad Engel, Sven Guttmann
    Testing Bandwidth k for k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:301-312 [Journal]
  19. Konrad Engel, Hans-Dietrich O. F. Gronau
    An intersection-union theorem for integer sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:153-159 [Journal]
  20. Konrad Engel
    Strong properties in partially ordered sets I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:229-234 [Journal]
  21. Konrad Engel
    Strong properties in partially ordered sets II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:2-3, pp:187-196 [Journal]
  22. Konrad Engel
    About the number of pairs of elements of Enk whose distances have given values. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:209-216 [Journal]
  23. Isma Bouchemakh, Konrad Engel
    The order-interval hypergraph of a finite poset and the König property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:51-61 [Journal]
  24. Konrad Engel, Péter L. Erdös
    Polytopes determined by complementfree Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:165-169 [Journal]

  25. A generalization of Sperner's theorem and an application to graph orientations. [Citation Graph (, )][DBLP]


  26. Preface. [Citation Graph (, )][DBLP]


  27. Optimal matrix-segmentation by rectangles. [Citation Graph (, )][DBLP]


Search in 0.140secs, Finished in 0.142secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002