Journals in DBLP

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

1. 
   The Zagreb coindices of graph operations. [Citation Graph (, )][DBLP]
   
   
2. 
   Sorting with networks of data structures. [Citation Graph (, )][DBLP]
   
   
3. 
   Total domination critical and stable graphs upon edge removal. [Citation Graph (, )][DBLP]
   
   
4. 
   Recognizing line-polar bipartite graphs in time O(n). [Citation Graph (, )][DBLP]
   
   
5. 
   A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. [Citation Graph (, )][DBLP]
   
   
6. 
   Disjoint dominating and total dominating sets in graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Finding monotone paths in edge-ordered graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   The smallest values of algebraic connectivity for unicyclic graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   The k-in-a-tree problem for graphs of girth at least k. [Citation Graph (, )][DBLP]
   
   
10. 
    On orthogonal ray graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph. [Citation Graph (, )][DBLP]
    
    
12. 
    Tighter bounds of the First Fit algorithm for the bin-packing problem. [Citation Graph (, )][DBLP]
    
    
13. 
    Matching interdiction. [Citation Graph (, )][DBLP]
    
    
14. 
    Random walks and the effective resistance sum rules. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing an eigenvector of an inverse Monge matrix in max-plus algebra. [Citation Graph (, )][DBLP]
    
    
16. 
    A note on the weakly convex and convex domination numbers of a torus. [Citation Graph (, )][DBLP]
    
    
17. 
    Ordering connected graphs having small degree distances. [Citation Graph (, )][DBLP]