Journals in DBLP

Discrete Applied Mathematics
2008, volume: 156, number: 17

1. 
   Preface for CTW2005 special issue. [Citation Graph (, )][DBLP]
   
   
2. 
   On the coverings of the d-cube for d<=6. [Citation Graph (, )][DBLP]
   
   
3. 
   Parameterized algorithmics for linear arrangement problems. [Citation Graph (, )][DBLP]
   
   
4. 
   Discrete approximations to real-valued leaf sequencing problems in radiation therapy. [Citation Graph (, )][DBLP]
   
   
5. 
   Counting preimages of TCP reordering patterns. [Citation Graph (, )][DBLP]
   
   
6. 
   On a relation between the domination number and a strongly connected bidirection of an undirected graph. [Citation Graph (, )][DBLP]
   
   
7. 
   Equivalences and the complete hierarchy of intersection graphs of paths in a tree. [Citation Graph (, )][DBLP]
   
   
8. 
   A clique-difference encoding scheme for labelled k-path graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   A new formulation for the Traveling Deliveryman Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximation algorithms for group prize-collecting and location-routing problems. [Citation Graph (, )][DBLP]
    
    
11. 
    The stack loading and unloading problem. [Citation Graph (, )][DBLP]
    
    
12. 
    Preemptive scheduling and antichain polyhedra. [Citation Graph (, )][DBLP]
    
    
13. 
    Topological sweep of the complete graph. [Citation Graph (, )][DBLP]
    
    
14. 
    Efficiency in exponential time for domination-type problems. [Citation Graph (, )][DBLP]
    
    
15. 
    Semi-preemptive routing on trees. [Citation Graph (, )][DBLP]
    
    
16. 
    Randomized strategies for the plurality problem. [Citation Graph (, )][DBLP]
    
    
17. 
    An efficient algorithm for the three-guard problem. [Citation Graph (, )][DBLP]
    
    
18. 
    The connectivity of a graph and its complement. [Citation Graph (, )][DBLP]
    
    
19. 
    Constructions for normal graphs and some consequences. [Citation Graph (, )][DBLP]