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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP