Journals in DBLP

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

1. 
   Labeling bipartite permutation graphs with a condition at distance two. [Citation Graph (, )][DBLP]
   
   
2. 
   On the complement graph and defensive k-alliances. [Citation Graph (, )][DBLP]
   
   
3. 
   Riordan group involutions and the Delta-sequence. [Citation Graph (, )][DBLP]
   
   
4. 
   Disjoint congruence classes and a timetabling application. [Citation Graph (, )][DBLP]
   
   
5. 
   Treelike comparability graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   LDPC codes from Singer cycles. [Citation Graph (, )][DBLP]
   
   
7. 
   Optimal strong (kappa, d)-orientation of complete k-partite graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   The clique-separator graph for chordal graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   L(p, q)-labeling of digraphs. [Citation Graph (, )][DBLP]
   
   
10. 
    On the number of components of (k, g)-cages after vertex deletion. [Citation Graph (, )][DBLP]
    
    
11. 
    On a conjecture of the Randic index. [Citation Graph (, )][DBLP]
    
    
12. 
    Independent sets in bounded-degree hypergraphs. [Citation Graph (, )][DBLP]
    
    
13. 
    On b-colorings in regular graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Some results related to the tenacity and existence of k-trees. [Citation Graph (, )][DBLP]
    
    
15. 
    On the NBC-complexes and beta-invariants of abstract convex geometries. [Citation Graph (, )][DBLP]
    
    
16. 
    The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. [Citation Graph (, )][DBLP]
    
    
17. 
    Scheduling jobs with release dates on parallel batch processing machines. [Citation Graph (, )][DBLP]
    
    
18. 
    Norm statistics and the complexity of clustering problems. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximating minimum-power edge-covers and 2, 3-connectivity. [Citation Graph (, )][DBLP]
    
    
20. 
    A new characterization of group action-based perfect nonlinearity. [Citation Graph (, )][DBLP]
    
    
21. 
    Collision-free path coloring with application to minimum-delay gathering in sensor networks. [Citation Graph (, )][DBLP]
    
    
22. 
    Fractional weak discrepancy and interval orders. [Citation Graph (, )][DBLP]
    
    
23. 
    On the two-dimensional orthogonal drawing of series-parallel graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Distance-two labellings of Hamming graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    The signed domatic number of some regular graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Edge searching weighted graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    Global defensive alliances in star graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    2-rainbow domination of generalized Petersen graphs P(n, 2). [Citation Graph (, )][DBLP]
    
    
29. 
    Reinforcement numbers of digraphs. [Citation Graph (, )][DBLP]
    
    
30. 
    On explicit formulas for bandwidth and antibandwidth of hypercubes. [Citation Graph (, )][DBLP]
    
    
31. 
    Note on the m-step competition numbers of paths and cycles. [Citation Graph (, )][DBLP]
    
    
32. 
    A simple algorithm for multicuts in planar graphs with outer terminals. [Citation Graph (, )][DBLP]
    
    
33. 
    A sufficient connectivity condition for generic rigidity in the plane. [Citation Graph (, )][DBLP]
    
    
34. 
    On total domination vertex critical graphs of high connectivity. [Citation Graph (, )][DBLP]
    
    
35. 
    New permutation statistics: Variation and a variant. [Citation Graph (, )][DBLP]