Journals in DBLP

Discrete Applied Mathematics
2007, volume: 155, number: 8

1. Stavros G. Kolliopoulos, George Steiner
   Partially ordered knapsack and applications to scheduling. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:889-897 [Journal]
   
2. Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati
   Faster deterministic wakeup in multiple access channels. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:898-903 [Journal]
   
3. Kejun Chen, Ruizhong Wei
   Super-simple (v, 5, 4) designs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:904-913 [Journal]
   
4. Magnus Bordewich, Charles Semple
   Computing the minimum number of hybridization events for a consistent evolutionary history. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:914-928 [Journal]
   
5. Sergey Kitaev
   Introduction to partially ordered patterns. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:929-944 [Journal]
   
6. Joseph Y.-T. Leung, Haibing Li, Michael Pinedo
   Scheduling orders for multiple product types to minimize total weighted completion time. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:945-970 [Journal]
   
7. Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho
   On CCE graphs of doubly partial orders. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:971-978 [Journal]
   
8. Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
   Efficient algorithms for decomposing graphs under degree constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:979-988 [Journal]
   
9. Elizabeth Goode, Dennis Pixton
   Recognizing splicing languages: Syntactic monoids and simultaneous pumping. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:8, pp:989-1006 [Journal]
   
10. Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw
    Distance-two labelings of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1007-1013 [Journal]
    
11. Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini
    On Sturmian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1014-1030 [Journal]
    
12. Sunghyu Han, June Bok Lee
    Nonexistence of near-extremal formally self-dual even codes of length divisible by 8. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1031-1037 [Journal]
    
13. Jiping Liu, Yuejian Peng, Cheng Zhao
    Characterization of P₆-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1038-1043 [Journal]
    
14. Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu
    Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1044-1054 [Journal]
    
15. Brian Lucena
    Achievable sets, brambles, and sparse treewidth obstructions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1055-1065 [Journal]
    
16. A. M. Youssef
    Generalized hyper-bent functions over GF(p). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1066-1070 [Journal]
    
17. W. Kook
    Edge-rooted forests and the alpha-invariant of cone graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1071-1075 [Journal]