Journals in DBLP

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

1. Arnold Knopfmacher, Robert F. Tichy, Stephan Wagner, Volker Ziegler
   Graphs, partitions and Fibonacci numbers. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1175-1187 [Journal]
   
2. Ma-Lian Chia, David Kuo, Mei-Feng Tung
   The multiple originator broadcasting problem in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1188-1199 [Journal]
   
3. Wen-Qing Xu, Solomon W. Golomb
   Optimal interleaving schemes for correcting two-dimensional cluster errors. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1200-1212 [Journal]
   
4. Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao
   On the uniform edge-partition of a tree. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1213-1223 [Journal]
   
5. Kazuyuki Amano, Akira Maruoka
   Better upper bounds on the QOBDD size of integer multiplication. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1224-1232 [Journal]
   
6. Dieter Rautenbach, Christian Szegedy, Jürgen Werber
   The delay of circuits whose inputs have specified arrival times. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1233-1243 [Journal]
   
7. Abdo Y. Alfakih
   On dimensional rigidity of bar-and-joint frameworks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1244-1253 [Journal]
   
8. Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
   Integral trees of diameter 6. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1254-1266 [Journal]
   
9. Zemin Jin, Huifang Yan, Qinglin Yu
   Generalization of matching extensions in graphs (II). [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:10, pp:1267-1274 [Journal]
   
10. Dekel Tsur
    Tree-edges deletion problems with bounded diameter obstruction sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1275-1293 [Journal]
    
11. Tomislav Doslic, Damir Vukicevic
    Computing the bipartite edge frustration of fullerene graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1294-1301 [Journal]
    
12. Changhong Lu, Lei Chen, Mingqing Zhai
    Extremal problems on consecutive L(2, 1)-labelling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1302-1313 [Journal]
    
13. Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland
    The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1314-1325 [Journal]
    
14. Roberto Cordone
    A subexponential algorithm for the coloured tree partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1326-1335 [Journal]
    
15. Douglas Bauer, Hajo Broersma, N. Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec
    Tutte sets in graphs II: The complexity of finding maximum Tutte sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1336-1343 [Journal]