AAAAAA
Results: 1-25/1470
Authors:
Borodin, O
Citation: O. Borodin, Special issue - Discrete Analysis and Operations Research (DAOR) - Selected papers - Preface, DISCR APP M, 114(1-3), 2001, pp. 1-1
Authors:
Ageev, AA
Citation: Aa. Ageev, Complexity of finding a join of maximum weight, DISCR APP M, 114(1-3), 2001, pp. 3-7
Authors:
Avgustinovich, SV
Citation: Sv. Avgustinovich, Perfect binary (n, 3) codes: the structure of graphs of minimum distances, DISCR APP M, 114(1-3), 2001, pp. 9-11
Authors:
Beresnev, VL
Citation: Vl. Beresnev, An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix, DISCR APP M, 114(1-3), 2001, pp. 13-22
Authors:
Bojarshinov, VA
Citation: Va. Bojarshinov, Edge and total coloring of interval graphs, DISCR APP M, 114(1-3), 2001, pp. 23-28
Authors:
Borodin, OV
Kostochka, AV
Raspaud, A
Sopena, E
Citation: Ov. Borodin et al., Acyclic colouring of 1-planar graphs, DISCR APP M, 114(1-3), 2001, pp. 29-41
Authors:
Chashkin, AV
Citation: Av. Chashkin, Average case complexity for finite Boolean functions, DISCR APP M, 114(1-3), 2001, pp. 43-59
Authors:
Chashkin, AV
Citation: Av. Chashkin, Lower bounds for the complexity of restrictions of Boolean functions, DISCR APP M, 114(1-3), 2001, pp. 61-93
Authors:
Cherukhin, DU
Citation: Du. Cherukhin, On an infinite sequence of improving Boolean bases, DISCR APP M, 114(1-3), 2001, pp. 95-108
Authors:
Evdokimov, AA
Perezhogin, AL
Citation: Aa. Evdokimov et Al. Perezhogin, Minimal enumerations of subsets of a finite set and the middle level problem, DISCR APP M, 114(1-3), 2001, pp. 109-114
Authors:
Frid, AE
Citation: Ae. Frid, On the subword complexity of iteratively generated infinite words, DISCR APP M, 114(1-3), 2001, pp. 115-120
Authors:
Frid, AE
Citation: Ae. Frid, On factor graphs of DOL words, DISCR APP M, 114(1-3), 2001, pp. 121-130
Authors:
Il'ev, VP
Citation: Vp. Il'Ev, An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function, DISCR APP M, 114(1-3), 2001, pp. 131-146
Authors:
Kasim-Zade, OM
Citation: Om. Kasim-zade, On minimal coverings of the Boolean cube by centered antichains, DISCR APP M, 114(1-3), 2001, pp. 147-153
Authors:
Klepinin, AV
Sukhanov, EV
Citation: Av. Klepinin et Ev. Sukhanov, On combinatorial properties of the Arshon sequence, DISCR APP M, 114(1-3), 2001, pp. 155-169
Authors:
Korshunov, AD
Citation: Ad. Korshunov, On the asymptotics of the number of binary words with a given length of a maximal series, DISCR APP M, 114(1-3), 2001, pp. 171-201
Authors:
Marchenkov, SS
Citation: Ss. Marchenkov, A-closed classes of idempotent functions of many-valued logic definable bybinary relations, DISCR APP M, 114(1-3), 2001, pp. 203-225
Authors:
Merekin, YV
Citation: Yv. Merekin, Upper bounds for the complexity of sequences generated by symmetric Boolean functions, DISCR APP M, 114(1-3), 2001, pp. 227-231
Authors:
Sapozhenko, AA
Citation: Aa. Sapozhenko, On the number of connected sets with the neighborhood of a given size in agraph, DISCR APP M, 114(1-3), 2001, pp. 233-247
Authors:
Serdjukov, AI
Citation: Ai. Serdjukov, On finding a maximum spanning tree of bounded radius, DISCR APP M, 114(1-3), 2001, pp. 249-253
Authors:
Kashyrskikh, KN
Potts, CN
Sevastianov, SV
Citation: Kn. Kashyrskikh et al., A 3/2-approximation algorithm for two-machine flow-shop sequencing subjectto release dates, DISCR APP M, 114(1-3), 2001, pp. 255-271
Authors:
Sevastianov, SV
Woeginger, GJ
Citation: Sv. Sevastianov et Gj. Woeginger, Linear time approximation scheme for the multiprocessor open shop problem, DISCR APP M, 114(1-3), 2001, pp. 273-288
Authors:
van Zanten, AJ
Citation: Aj. Van Zanten, Cyclic distance-preserving codes on a constant-weight basis, DISCR APP M, 114(1-3), 2001, pp. 289-294
Authors:
Vizing, VG
Citation: Vg. Vizing, On connected list colorings of graphs, DISCR APP M, 114(1-3), 2001, pp. 295-300
Authors:
Zverovich, IE
Citation: Ie. Zverovich, Locally bounded hereditary subclasses of k-colourable graphs, DISCR APP M, 114(1-3), 2001, pp. 301-311