Journals in DBLP

Discrete Applied Mathematics
2006, volume: 154, number: 16

1. Naoki Katoh, Hiro Ito
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2239-2240 [Journal]
   
2. Martin Anthony, Peter L. Hammer
   A Boolean measure of similarity. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2242-2246 [Journal]
   
3. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
   How to collect balls moving in the Euclidean plane. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2247-2262 [Journal]
   
4. Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
   Density condensation of Boolean formulas. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2263-2270 [Journal]
   
5. Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
   The vehicle routing problem with flexible time windows and traveling times. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2271-2290 [Journal]
   
6. Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura
   A competitive and cooperative approach to propositional satisfiability. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2291-2306 [Journal]
   
7. Toshimasa Ishii, Masayuki Hagiwara
   Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2307-2329 [Journal]
   
8. Hiro Ito, Hiroshi Nagamochi
   Two equivalent measures on weighted hypergraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2330-2334 [Journal]
   
9. Naoki Katoh, Taihei Yano
   An approximation algorithm for the pickup and delivery vehicle routing problem on trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2335-2349 [Journal]
   
10. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
    An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2350-2372 [Journal]
    
11. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum edge ranking spanning trees of split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2373-2386 [Journal]
    
12. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log²n) algorithm for the optimal sink location problem in dynamic tree networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2387-2401 [Journal]
    
13. Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
    Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2402-2410 [Journal]
    
14. Hiroshi Nagamochi
    Sparse connectivity certificates via MA orderings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2411-2417 [Journal]
    
15. Mingjun Edward Yan, Tsunehiko Kameda
    Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2418-2429 [Journal]
    
16. Dao-Zhi Zeng, Liping Fang, Keith W. Hipel, D. Marc Kilgour
    Generalized metarationalities in the graph model for conflict resolution. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2430-2443 [Journal]