Journals in DBLP

Discrete Applied Mathematics
2009, volume: 157, number: 9

1. 
   Preface. [Citation Graph (, )][DBLP]
   
   
2. 
   The incidence game chromatic number. [Citation Graph (, )][DBLP]
   
   
3. 
   Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. [Citation Graph (, )][DBLP]
   
   
4. 
   Algorithmic aspects of a general modular decomposition theory. [Citation Graph (, )][DBLP]
   
   
5. 
   An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. [Citation Graph (, )][DBLP]
   
   
6. 
   Optimal matrix-segmentation by rectangles. [Citation Graph (, )][DBLP]
   
   
7. 
   Intersection models of weakly chordal graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Orthogonal covers by multiplication graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   Dynamically maintaining split graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Online scheduling with general machine cost functions. [Citation Graph (, )][DBLP]
    
    
11. 
    Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. [Citation Graph (, )][DBLP]
    
    
12. 
    The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence. [Citation Graph (, )][DBLP]
    
    
13. 
    Integral point sets over Z_n^m. [Citation Graph (, )][DBLP]
    
    
14. 
    Construction of binary and ternary self-orthogonal linear codes. [Citation Graph (, )][DBLP]
    
    
15. 
    An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. [Citation Graph (, )][DBLP]
    
    
16. 
    t-wise balanced designs. [Citation Graph (, )][DBLP]
    
    
17. 
    On some algorithmic problems regarding the hairpin completion. [Citation Graph (, )][DBLP]
    
    
18. 
    Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. [Citation Graph (, )][DBLP]
    
    
19. 
    A generalization of Sperner's theorem and an application to graph orientations. [Citation Graph (, )][DBLP]
    
    
20. 
    Merging covering arrays and compressing multiple sequence alignments. [Citation Graph (, )][DBLP]
    
    
21. 
    Numerical characterization of n-cube subset partitioning. [Citation Graph (, )][DBLP]
    
    
22. 
    Calculating the extremal number ex(v;{C₃, C₄, ..., C_n}). [Citation Graph (, )][DBLP]
    
    
23. 
    Relaxation procedures on graphs. [Citation Graph (, )][DBLP]