Journals in DBLP

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

1. 
   Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] [Citation Graph (, )][DBLP]
   
   
2. 
   The competition number of a graph with exactly h holes, all of which are independent. [Citation Graph (, )][DBLP]
   
   
3. 
   On the spanning fan-connectivity of graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Superconnectivity of regular graphs with small diameter. [Citation Graph (, )][DBLP]
   
   
5. 
   Short containers in Cayley graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   Polynomial reduction of time-space scheduling to time scheduling. [Citation Graph (, )][DBLP]
   
   
7. 
   Conjugated trees with minimum general Randic index. [Citation Graph (, )][DBLP]
   
   
8. 
   The number of independent sets in unicyclic graphs with a given diameter. [Citation Graph (, )][DBLP]
   
   
9. 
   Approximation algorithms and hardness results for the clique packing problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximation algorithms for constrained generalized tree alignment problem. [Citation Graph (, )][DBLP]
    
    
11. 
    Improved book-embeddings of incomplete hypercubes. [Citation Graph (, )][DBLP]
    
    
12. 
    Kinetic maintenance of mobile k-centres on trees. [Citation Graph (, )][DBLP]
    
    
13. 
    Enumeration aspects of maximal cliques and bicliques. [Citation Graph (, )][DBLP]
    
    
14. 
    Lower bounds for three algorithms for transversal hypergraph generation. [Citation Graph (, )][DBLP]
    
    
15. 
    Minimum-weight cycle covers and their approximability. [Citation Graph (, )][DBLP]
    
    
16. 
    On randomized algorithms for the majority problem. [Citation Graph (, )][DBLP]
    
    
17. 
    Exact wirelength of hypercubes on a grid. [Citation Graph (, )][DBLP]
    
    
18. 
    Simple games and weighted games: A theoretical and computational viewpoint. [Citation Graph (, )][DBLP]
    
    
19. 
    Gray codes for non-crossing partitions and dissections of a convex polygon. [Citation Graph (, )][DBLP]
    
    
20. 
    Conflict-free coloring of unit disks. [Citation Graph (, )][DBLP]
    
    
21. 
    Laminar structure of ptolemaic graphs with applications. [Citation Graph (, )][DBLP]
    
    
22. 
    Molecular graphs and the inverse Wiener index problem. [Citation Graph (, )][DBLP]
    
    
23. 
    On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. [Citation Graph (, )][DBLP]
    
    
24. 
    The upper connected geodetic number and forcing connected geodetic number of a graph. [Citation Graph (, )][DBLP]
    
    
25. 
    Nonadaptive algorithms for threshold group testing. [Citation Graph (, )][DBLP]
    
    
26. 
    On the 3-restricted edge connectivity of permutation graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    Extension problems with degree bounds. [Citation Graph (, )][DBLP]
    
    
28. 
    The vertex PI index and Szeged index of bridge graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    RNA secondary structure, permutations, and statistics. [Citation Graph (, )][DBLP]
    
    
30. 
    Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. [Citation Graph (, )][DBLP]
    
    
31. 
    On reciprocal complementary Wiener number. [Citation Graph (, )][DBLP]
    
    
32. 
    Upper bounds on the k-domination number and the k-Roman domination number. [Citation Graph (, )][DBLP]
    
    
33. 
    An improved randomized approximation algorithm for maximum triangle packing. [Citation Graph (, )][DBLP]
    
    
34. 
    On the diameter of a domination dot-critical graph. [Citation Graph (, )][DBLP]
    
    
35. 
    Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees. [Citation Graph (, )][DBLP]
    
    
36. 
    Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. [Citation Graph (, )][DBLP]
    
    
37. 
    On the number of connected convex subgraphs of a connected acyclic digraph. [Citation Graph (, )][DBLP]
    
    
38. 
    A connection between circular colorings and periodic schedules. [Citation Graph (, )][DBLP]
    
    
39. 
    On intermediate factorial languages. [Citation Graph (, )][DBLP]