Journals in DBLP

Discrete Applied Mathematics
2010, volume: 158, number: 13

1. 
   On the sum minimization version of the online bin covering problem. [Citation Graph (, )][DBLP]
   
   
2. 
   Satisfiability of algebraic circuits over sets of natural numbers. [Citation Graph (, )][DBLP]
   
   
3. 
   The minimum reload s-t path, trail and walk problems. [Citation Graph (, )][DBLP]
   
   
4. 
   Graph operations that are good for greedoids. [Citation Graph (, )][DBLP]
   
   
5. 
   Covering a laminar family by leaf to leaf links. [Citation Graph (, )][DBLP]
   
   
6. 
   Hyper- and reverse-Wiener indices of F-sums of graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Network flow interdiction on planar graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   The competition number of a graph whose holes do not overlap much. [Citation Graph (, )][DBLP]
   
   
9. 
   Antiblocking decoding. [Citation Graph (, )][DBLP]