Journals in DBLP

Discrete Applied Mathematics
2000, volume: 101, number: 1-3

1. Mourad Baïou, Michel Balinski
   Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:1-12 [Journal]
   
2. Lorenzo Brunetta, Michele Conforti, Matteo Fischetti
   A polyhedral approach to an integer multicommodity flow problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:13-36 [Journal]
   
3. Lorenzo Brunetta, Francesco Maffioli, Marco Trubian
   Solving the feedback vertex set problem on undirected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:37-51 [Journal]
   
4. Dominique Buset
   Maximal cubic graphs with diameter 4. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:53-61 [Journal]
   
5. Gi-Sang Cheon, Bryan L. Shader
   Sparse orthogonal matrices and the Haar wavelet. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:63-76 [Journal]
   
6. Bruno Courcelle, Stephan Olariu
   Upper bounds to the clique width of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:77-114 [Journal]
   
7. Norman J. Finizio, Adele J. Merritt
   Some new Z-cyclic whist tournaments. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:115-130 [Journal]
   
8. Deborah S. Franzblau
   Generic rigidity of molecular graphs via ear decomposition. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:131-155 [Journal]
   
9. Martin Charles Golumbic, Moshe Lewenstein
   New results on induced matchings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:157-165 [Journal]
   
10. Atsushi Kaneko, Mikio Kano
    Straight line embeddings of rooted star forests in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:167-175 [Journal]
    
11. Kenji Kashiwabara, Bunpei Nakano
    Envelopes and clutters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:177-185 [Journal]
    
12. Tak Wah Lam, Hing-Fung Ting
    Selecting the k largest elements with parity tests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:187-196 [Journal]
    
13. Xuemin Lin
    On the computational complexity of edge concentration. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:197-205 [Journal]
    
14. Y. Lu, Zhang Shengyuan
    Existence of whist tournaments with the three-person property 3PWh(v). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:207-219 [Journal]
    
15. Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers
    The median function on median graphs and semilattices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:221-230 [Journal]
    
16. Stephanie Perkins, Derek H. Smith
    A scheme for the synchronization of variable length codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:231-245 [Journal]
    
17. Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams
    Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:247-267 [Journal]
    
18. Jacques Verriet
    Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:269-289 [Journal]