Journals in DBLP

Discrete Applied Mathematics
2001, volume: 114, number: 1-3

1. Oleg V. Borodin
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:1- [Journal]
   
2. Alexander A. Ageev
   Complexity of finding a join of maximum weight. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:3-7 [Journal]
   
3. Sergey V. Avgustinovich
   Perfect binary (n, 3) codes: the structure of graphs of minimum distances. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:9-11 [Journal]
   
4. V. L. Beresnev
   An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:13-22 [Journal]
   
5. V. A. Bojarshinov
   Edge and total coloring of interval graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:23-28 [Journal]
   
6. Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena
   Acyclic colouring of 1-planar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:29-41 [Journal]
   
7. A. V. Chashkin
   Average case complexity for finite Boolean functions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:43-59 [Journal]
   
8. A. V. Chashkin
   Lower bounds for the complexity of restrictions of Boolean functions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:61-93 [Journal]
   
9. D. U. Cherukhin
   On an infinite sequence of improving Boolean bases. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:95-108 [Journal]
   
10. A. A. Evdokimov, A. L. Perezhogin
    Minimal enumerations of subsets of a finite set and the middle level problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:109-114 [Journal]
    
11. Anna E. Frid
    On the subword complexity of iteratively generated infinite words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:115-120 [Journal]
    
12. Anna E. Frid
    On factor graphs of DOL words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:121-130 [Journal]
    
13. Victor P. Il'ev
    An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:131-146 [Journal]
    
14. O. M. Kasim-Zade
    On minimal coverings of the Boolean cube by centered antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:147-153 [Journal]
    
15. A. V. Klepinin, E. V. Sukhanov
    On combinatorial properties of the Arshon sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:155-169 [Journal]
    
16. A. D. Korshunov
    On the asymptotics of the number of binary words with a given length of a maximal series. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:171-201 [Journal]
    
17. S. S. Marchenkov
    A-closed classes of idempotent functions of many-valued logic definable by binary relations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:203-225 [Journal]
    
18. Yu. V. Merekin
    Upper bounds for the complexity of sequences generated by symmetric Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:227-231 [Journal]
    
19. Alexander A. Sapozhenko
    On the number of connected sets with the neighborhood of a given size in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:233-247 [Journal]
    
20. A. I. Serdjukov
    On finding a maximum spanning tree of bounded radius. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:249-253 [Journal]
    
21. K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
    A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:255-271 [Journal]
    
22. Sergey V. Sevastianov, Gerhard J. Woeginger
    Linear time approximation scheme for the multiprocessor open shop problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:273-288 [Journal]
    
23. A. J. van Zanten
    Cyclic distance-preserving codes on a constant-weight basis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:289-294 [Journal]
    
24. V. G. Vizing
    On connected list colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:295-300 [Journal]
    
25. Igor E. Zverovich
    Locally bounded hereditary subclasses of k-colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:301-311 [Journal]