Journals in DBLP

Discrete Applied Mathematics
2008, volume: 156, number: 10

1. 
   Rotation symmetric Boolean functions - Count and cryptographic properties. [Citation Graph (, )][DBLP]
   
   
2. 
   Formulas for approximating pseudo-Boolean random variables. [Citation Graph (, )][DBLP]
   
   
3. 
   Self-duality of bounded monotone boolean functions and related problems. [Citation Graph (, )][DBLP]
   
   
4. 
   Models and quantifier elimination for quantified Horn formulas. [Citation Graph (, )][DBLP]
   
   
5. 
   An algorithm for the difference between set covers. [Citation Graph (, )][DBLP]
   
   
6. 
   An improvement on the complexity of factoring read-once Boolean functions. [Citation Graph (, )][DBLP]
   
   
7. 
   The extent to which triangular sub-patterns explain minimum rank. [Citation Graph (, )][DBLP]
   
   
8. 
   Polar cographs. [Citation Graph (, )][DBLP]
   
   
9. 
   On cyclic edge-connectivity of fullerenes. [Citation Graph (, )][DBLP]
   
   
10. 
    Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))). [Citation Graph (, )][DBLP]
    
    
11. 
    Using solution properties within an enumerative search to solve a sports league scheduling problem. [Citation Graph (, )][DBLP]
    
    
12. 
    On the existence of sports schedules with multiple venues. [Citation Graph (, )][DBLP]
    
    
13. 
    Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    A sharp lower bound of the Randic index of cacti with r pendants. [Citation Graph (, )][DBLP]
    
    
15. 
    Strategies of loop recombination in ciliates. [Citation Graph (, )][DBLP]
    
    
16. 
    Sums of squares based approximation algorithms for MAX-SAT. [Citation Graph (, )][DBLP]
    
    
17. 
    Vertex and edge PI indices of Cartesian product graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    The general sigma all-ones problem for trees. [Citation Graph (, )][DBLP]
    
    
19. 
    Edge-bipancyclicity of a hypercube with faulty vertices and edges. [Citation Graph (, )][DBLP]
    
    
20. 
    Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system. [Citation Graph (, )][DBLP]
    
    
21. 
    Digraph searching, directed vertex separation and directed pathwidth. [Citation Graph (, )][DBLP]
    
    
22. 
    The convexity spectra of graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Cost thresholds for dynamic resource location. [Citation Graph (, )][DBLP]
    
    
24. 
    Generating non-jumping numbers recursively. [Citation Graph (, )][DBLP]
    
    
25. 
    Graph parameters measuring neighbourhoods in graphs - Bounds and applications. [Citation Graph (, )][DBLP]
    
    
26. 
    Facet defining inequalities among graph invariants: The system GraPHedron. [Citation Graph (, )][DBLP]
    
    
27. 
    On the crossing numbers of K_msquare C_n and K_{m, l}square P_n. [Citation Graph (, )][DBLP]
    
    
28. 
    On the complexity of the multicut problem in bounded tree-width graphs and digraphs. [Citation Graph (, )][DBLP]
    
    
29. 
    Vertex coloring acyclic digraphs and their corresponding hypergraphs. [Citation Graph (, )][DBLP]
    
    
30. 
    Large gaps in one-dimensional cutting stock problems. [Citation Graph (, )][DBLP]
    
    
31. 
    Feedback vertex set on AT-free graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    Super-connected edge transitive graphs. [Citation Graph (, )][DBLP]