Journals in DBLP

Discrete Applied Mathematics
1989, volume: 25, number: 3

1. 
   Low complexity normal bases. [Citation Graph (, )][DBLP]
   
   
2. 
   The steepest descent gravitational method for linear programming. [Citation Graph (, )][DBLP]
   
   
3. 
   Patterns in trees. [Citation Graph (, )][DBLP]
   
   
4. 
   Better understanding of batcher's merging networks. [Citation Graph (, )][DBLP]
   
   
5. 
   Knots in random walks. [Citation Graph (, )][DBLP]
   
   
6. 
   On spanning subgraphs of 4-connected planar graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Optimal and near-optimal broadcast in random graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Scheduling periodic events. [Citation Graph (, )][DBLP]
   
   
9. 
   The absolute center of a unicyclic network. [Citation Graph (, )][DBLP]
   
   
10. 
    On the orderability problem for PLA folding. [Citation Graph (, )][DBLP]
    
    
11. 
    An O(n^1.5) algorithm to color proper circular arcs. [Citation Graph (, )][DBLP]