Journals in DBLP

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

1. Amir Averbuch, Yehuda Roditty, Barack Shoham
   Efficient line broadcasting in a d-dimensional grid. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:129-141 [Journal]
   
2. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
   Diameter determination on restricted graph families. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:143-166 [Journal]
   
3. T. Easton, R. Gary Parker
   On completing latin squares. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:167-181 [Journal]
   
4. David Hartvigsen
   A strongly polynomial time algorithm for a constrained submodular optimization problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:183-194 [Journal]
   
5. Kiyoshi Hosono, Henk Meijer, David Rappaport
   On the visibility graph of convex translates. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:195-210 [Journal]
   
6. Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee
   Deterministic inverse zero-patterns. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:211-236 [Journal]
   
7. Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha
   Bounds for isoperimetric constants of infinite plane graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:237-241 [Journal]
   
8. Malwina J. Luczak, Steven D. Noble
   Optimal arrangement of data in a tree directory. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:243-253 [Journal]
   
9. Celina M. Herrera de Figueiredo, Kristina Vuskovic
   Recognition of quasi-Meyniel graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:255-260 [Journal]
   
10. Jean-Luc Fouquet, Gena Hahn
    Cycle regular graphs need not be transitive. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:261-264 [Journal]
    
11. J. Freixas, M. A. Puente
    A note about games-composition dimension. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:265-273 [Journal]
    
12. Alan J. Hoffman, Baruch Schieber
    The edge versus path incidence matrix of series-parallel graphs and greedy packing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:275-284 [Journal]
    
13. Juha Honkala
    Easy cases of the D0L sequence equivalence problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:285-290 [Journal]
    
14. Kiyoshi Hosono
    On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:291-298 [Journal]
    
15. Frank K. Hwang, J. S. Lee
    Optimal quantitative group testing on cycles and paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:299-302 [Journal]
    
16. Pranava K. Jha
    Smallest independent dominating sets in Kronecker products of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:303-306 [Journal]
    
17. Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang
    On the equitable chromatic number of complete n-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:307-310 [Journal]
    
18. Xiangwen Li, Bing Wei, Fan Yang
    A degree condition of 2-factors in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:311-318 [Journal]
    
19. Weifa Liang
    Finding the k most vital edges with respect to minimum spanning trees for fixed k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:319-327 [Journal]
    
20. Mei Lu, Zhengguang Yu
    Cycles of length 1 modulo 3 in graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:329-336 [Journal]
    
21. Jovanka Pantovic, Ratko Tosic, Gradimir Vojvodic
    Relative completeness with respect to two unary functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:337-342 [Journal]