The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2001, volume: 110, number: 2-3

  1. Susanne Albers, Günter Schmidt
    Scheduling with unexpected machine breakdowns. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:85-99 [Journal]
  2. Sergei L. Bezrukov
    Embedding complete trees into the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:101-119 [Journal]
  3. Katarína Cechlárová, Vladimír Lacko
    Persistency in combinatorial optimization problems on matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:121-132 [Journal]
  4. Bo Chen, Donglei Du, Jiye Han, Jianjun Wen
    On-line scheduling of small open shops. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:133-150 [Journal]
  5. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower bounds for computing geometric spanners and approximate shortest paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:151-167 [Journal]
  6. Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
    Efficient algorithms on distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:169-187 [Journal]
  7. Toru Hasunuma, Hiroshi Nagamochi
    Independent spanning trees with small depths in iterated line digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:189-211 [Journal]
  8. Dusan Hvalica
    Searching for a minimal solution subgraph in explicit AND/OR graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:213-225 [Journal]
  9. Dimitrios Kagaris, Spyros Tragoudas
    Computational analysis of counter-based schemes for VLSI test pattern generation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:227-250 [Journal]
  10. Igor Pak, Van H. Vu
    On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:251-272 [Journal]
  11. Han Ren, Yanpei Liu
    Enumerating near-4-regular maps on the sphere and the torus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:273-288 [Journal]
  12. Irena Rusu, Jeremy Spinrad
    Domination graphs: examples and counterexamples. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:289-300 [Journal]
  13. F. Bruce Shepherd, Lisa Zhang
    A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:301-315 [Journal]
  14. Koichi Yamazaki
    On approximation intractability of the path-distance-width problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:317-325 [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