Journals in DBLP

Discrete Applied Mathematics
2009, volume: 157, number: 2

1. 
   Dichotomy for bounded degree H-colouring. [Citation Graph (, )][DBLP]
   
   
2. 
   Global defensive k-alliances in graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   On the global offensive alliance number of a graph. [Citation Graph (, )][DBLP]
   
   
4. 
   Quasi-median hulls in Hamming space are Steiner hulls. [Citation Graph (, )][DBLP]
   
   
5. 
   On strong unimodality of multivariate discrete distributions. [Citation Graph (, )][DBLP]
   
   
6. 
   Representation of graphs by OBDDs. [Citation Graph (, )][DBLP]
   
   
7. 
   A polynomial-time algorithm for the paired-domination problem on permutation graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. [Citation Graph (, )][DBLP]
   
   
9. 
   Periodic schedules for linear precedence constraints. [Citation Graph (, )][DBLP]
   
   
10. 
    2-extendability of toroidal polyhexes and Klein-bottle polyhexes. [Citation Graph (, )][DBLP]
    
    
11. 
    Transforming a graph into a 1-balanced graph. [Citation Graph (, )][DBLP]
    
    
12. 
    Highly connected random geometric graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Forwarding and optical indices of a graph. [Citation Graph (, )][DBLP]
    
    
14. 
    Fall colouring of bipartite graphs and cartesian products of graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. [Citation Graph (, )][DBLP]
    
    
16. 
    On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. [Citation Graph (, )][DBLP]
    
    
17. 
    Idle regulation in non-clairvoyant scheduling of parallel jobs. [Citation Graph (, )][DBLP]
    
    
18. 
    Graph structural properties of non-Yutsis graphs allowing fast recognition. [Citation Graph (, )][DBLP]
    
    
19. 
    Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix. [Citation Graph (, )][DBLP]
    
    
20. 
    On extremal unicyclic molecular graphs with maximal Hosoya index. [Citation Graph (, )][DBLP]
    
    
21. 
    Note on non-separating and removable cycles in highly connected graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    A comment to: Two classes of edge domination in graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    On a new code, [2ⁿ-1, n, 2^n-1]. [Citation Graph (, )][DBLP]
    
    
24. 
    Order statistics and estimating cardinalities of massive data sets. [Citation Graph (, )][DBLP]
    
    
25. 
    On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2. [Citation Graph (, )][DBLP]
    
    
26. 
    A note on list improper coloring of plane graphs. [Citation Graph (, )][DBLP]