Journals in DBLP

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

1. 
   A min-max theorem for plane bipartite graphs. [Citation Graph (, )][DBLP]
   
   
2. 
   A polyhedral approach to the stability of a family of coalitions. [Citation Graph (, )][DBLP]
   
   
3. 
   On the connectivity and superconnected graphs with small diameter. [Citation Graph (, )][DBLP]
   
   
4. 
   Maintaining dynamic minimum spanning trees: An experimental study. [Citation Graph (, )][DBLP]
   
   
5. 
   The induced path function, monotonicity and betweenness. [Citation Graph (, )][DBLP]
   
   
6. 
   On end-vertices of Lexicographic Breadth First Searches. [Citation Graph (, )][DBLP]
   
   
7. 
   Additive edge labelings. [Citation Graph (, )][DBLP]
   
   
8. 
   A new approximation algorithm for the multilevel facility location problem. [Citation Graph (, )][DBLP]
   
   
9. 
   Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Parallel cleaning of a network with brushes. [Citation Graph (, )][DBLP]
    
    
11. 
    The lattice of embedded subsets. [Citation Graph (, )][DBLP]
    
    
12. 
    On the distribution of distances between specified nodes in increasing trees. [Citation Graph (, )][DBLP]
    
    
13. 
    Optimal radio labellings of complete m-ary trees. [Citation Graph (, )][DBLP]
    
    
14. 
    The existence and upper bound for two types of restricted connectivity. [Citation Graph (, )][DBLP]
    
    
15. 
    Bounds for short covering codes and reactive tabu search. [Citation Graph (, )][DBLP]
    
    
16. 
    Backbone colorings of graphs with bounded degree. [Citation Graph (, )][DBLP]
    
    
17. 
    Real-time data gathering in sensor networks. [Citation Graph (, )][DBLP]
    
    
18. 
    The independence polynomial of rooted products of graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Greedy approaches for a class of nonlinear Generalized Assignment Problems. [Citation Graph (, )][DBLP]
    
    
20. 
    Forcing matching numbers of fullerene graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    A note on scheduling identical coupled tasks in logarithmic time. [Citation Graph (, )][DBLP]
    
    
22. 
    A tournament of order 14 with disjoint Banks and Slater sets. [Citation Graph (, )][DBLP]
    
    
23. 
    Complexity of two coloring problems in cubic planar bipartite mixed graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Robust network optimization under polyhedral demand uncertainty is NP-hard. [Citation Graph (, )][DBLP]