Journals in DBLP

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

1. 
   On shortest crucial words avoiding abelian powers. [Citation Graph (, )][DBLP]
   
   
2. 
   A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges. [Citation Graph (, )][DBLP]
   
   
3. 
   First-Fit coloring of {P₅, K₄-e}-free graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem. [Citation Graph (, )][DBLP]
   
   
5. 
   Interlace polynomials: Enumeration, unimodality and connections to codes. [Citation Graph (, )][DBLP]
   
   
6. 
   Variance of the subgraph count for sparse Erdos-Rényi graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Bounds for visual cryptography schemes. [Citation Graph (, )][DBLP]
   
   
8. 
   A forbidden subgraph characterization of line-polar bipartite graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree. [Citation Graph (, )][DBLP]
   
   
10. 
    L(j, k)-labelling and maximum ordering-degrees for trees. [Citation Graph (, )][DBLP]
    
    
11. 
    On the kth smallest and kth greatest modified Wiener indices of trees. [Citation Graph (, )][DBLP]
    
    
12. 
    Dimension-2 poset competition numbers and dimension-2 poset double competition numbers. [Citation Graph (, )][DBLP]
    
    
13. 
    Approximation algorithms for art gallery problems in polygons. [Citation Graph (, )][DBLP]
    
    
14. 
    Local edge-connectivity augmentation in hypergraphs is NP-complete. [Citation Graph (, )][DBLP]
    
    
15. 
    Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987] [Citation Graph (, )][DBLP]