Journals in DBLP

Discrete Applied Mathematics
2001, volume: 115, number: 1-3

1. David Avis, Antoine Deza
   On the binary solitaire cone. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:3-14 [Journal]
   
2. Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone
   Combinatorial problems related to origin-destination matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:15-36 [Journal]
   
3. András Frank, Tibor Jordán, Zoltán Szigeti
   Combinatorial problems related to origin-destination matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:37-47 [Journal]
   
4. Harold N. Gabow, Tibor Jordán
   Bipartition constrained edge-splitting in directed graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:49-62 [Journal]
   
5. Ito Hiro, Uehara Hideyuki, Yokoyama Mitsuo
   Lengths of tours and permutations on a vertex set of a convex polygon. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:63-71 [Journal]
   
6. Atsushi Kaneko
   Spanning trees with constraints on the leaf degree. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:73-76 [Journal]
   
7. Gyula Károlyi, Emo Welzl
   Crossing-free segments and triangles in point configurations. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:77-88 [Journal]
   
8. Kenji Kashiwabara
   Subdivisions of integral base polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:89-97 [Journal]
   
9. Gyula Y. Katona
   A large set of non-Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:99-115 [Journal]
   
10. Ton Kloks, Richard B. Tan
    Bandwidth and topological bandwidth of graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:117-133 [Journal]
    
11. Tetsushi Koide, S. Shinmori, H. Ishii
    Topological optimization with a network reliability constraint. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:135-149 [Journal]
    
12. Kazuo Murota, Akiyoshi Shioura
    Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:151-176 [Journal]
    
13. Takao Nishizeki, Jens Vygen, Xiao Zhou
    The edge-disjoint paths problem is NP-complete for series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:177-186 [Journal]
    
14. Norbert Radics
    Rigidity of multi-story buildings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:187-198 [Journal]
    
15. András Recski
    Some polynomially solvable subcases of the detailed routing problem in VLSI design. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:199-208 [Journal]
    
16. Tadashi Sakuma
    On kernel-less clique-acyclic orientations of minimally imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:209-219 [Journal]