The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1991, volume: 88, number: 2-3

  1. Martin Aigner, Rudolf Wille
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:111- [Journal]
  2. Martin Aigner, Dwight Duffus, Daniel J. Kleitman
    Partitioning a power set into union-free classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:113-119 [Journal]
  3. Thomas Andreae
    A search problem on graphs which generalizes some group testing problems with two defectives. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:121-127 [Journal]
  4. Graham Brightwell, Jaroslav Nesetril
    Reorientations of covering graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:129-132 [Journal]
  5. Vincent Duquenne
    The core of finite lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:133-147 [Journal]
  6. Bernhard Ganter, Hans-Dietrich O. F. Gronau
    Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:149-155 [Journal]
  7. Gerhard Gierz, Ferdinand Hergert
    The bandwidth problem for distributive lattices of breadth 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:157-177 [Journal]
  8. Daniel Grieser
    Some results on the complexity of families of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:179-192 [Journal]
  9. Jerrold R. Griggs
    Iterated exponentials of two numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:193-209 [Journal]
  10. Michel Habib, David Kelly, Rolf H. Möhring
    Interval dimension is a comparability invariant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:211-229 [Journal]
  11. Hal A. Kierstead
    A polynomial time approximation algorithm for dynamic storage allocation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:231-237 [Journal]
  12. Wei-Ping Liu, Ivan Rival
    Enumerating orientations of ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:239-247 [Journal]
  13. Peter Luksch
    Distributive lattices freely generated by an ordered set of width two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:249-258 [Journal]
  14. Tom Madej, Douglas B. West
    The interval inclusion number of a partially ordered set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:259-277 [Journal]
  15. Oliver Pretzel, Dale Youngs
    Balanced graphs and noncovering graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:279-287 [Journal]
  16. Klaus Reuter
    The jump number and the lattice of maximal antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:289-307 [Journal]
  17. Rudolf Wille
    The skeletons of free distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:309-320 [Journal]
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