The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2004, volume: 134, number: 1-3

  1. Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner
    Open shop scheduling problems with late work criteria. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:1-24 [Journal]
  2. Nadia Brauner, Yves Crama
    The maximum deviation just-in-time scheduling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:25-50 [Journal]
  3. Roberto Cordone, Francesco Maffioli
    On the complexity of graph tree partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:51-65 [Journal]
  4. Daniel Granot, Herbert Hamers
    On the equivalence between some local and global Chinese postman and traveling salesman graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:67-76 [Journal]
  5. Elena Grigorescu
    The insulation sequence of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:77-90 [Journal]
  6. Raj Jagannathan
    On polynomial complexity of a stochastic algorithm for mixed zero-one programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:91-103 [Journal]
  7. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    Algorithms for graphs with small octopus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:105-128 [Journal]
  8. Armen S. Asratian, Nikolai N. Kuzjurin
    Two sensitivity theorems in fuzzy integer programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:129-140 [Journal]
  9. Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
    Scheduling groups of tasks with precedence constraints on three dedicated processors. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:141-168 [Journal]
  10. Kampei Miyakawa, Hiroshi Narushima
    Lattice-theoretic properties of MPR-posets in phylogeny. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:169-192 [Journal]
  11. Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini
    Lift and project relaxations for the matching and related polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:193-212 [Journal]
  12. Asa Packer
    Polynomial-time approximation of largest simplices in V-polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:213-237 [Journal]
  13. Natasa Przulj, Derek G. Corneil, Ekkehard Köhler
    Hereditary dominating pair graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:239-261 [Journal]
  14. Joachim Rosenmüller, Peter Sudhölter
    Cartels via the modiclus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:263-302 [Journal]
  15. Akiyoshi Shioura
    Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:303-316 [Journal]
  16. Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi
    A characterization of Thompson digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:317-337 [Journal]
  17. Heping Zhang, Rijun Zha, Haiyuan Yao
    Z-transformation graphs of maximum matchings of plane bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:339-350 [Journal]
  18. Craig A. Tovey
    Non-approximability of precedence-constrained sequencing to minimize setups. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:351-360 [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