Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=114
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of finding a join of maximum weight
A.A. Ageev
Discrete Applied Mathematics
114
(1-3), 2001, pp. 3-7
Perfect binary
(n,3)
codes: The structure of graphs of minimum distances
S.V. Avgustinovich
Discrete Applied Mathematics
114
(1-3), 2001, pp. 9-11
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
V.L. Beresnev
Discrete Applied Mathematics
114
(1-3), 2001, pp. 13-22
Edge and total coloring of interval graphs
V.A. Bojarshinov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 23-28
Acyclic colouring of 1-planar graphs
O.V. Borodin
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Discrete Applied Mathematics
114
(1-3), 2001, pp. 29-41
Average case complexity for finite Boolean functions
A.V. Chashkin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 43-59
Lower bounds for the complexity of restrictions of Boolean functions
A.V. Chashkin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 61-93
On an infinite sequence of improving Boolean bases
D.U. Cherukhin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 95-108
Minimal enumerations of subsets of a finite set and the middle level problem
A.A. Evdokimov
,
A.L. Perezhogin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 109-114
On the subword complexity of iteratively generated infinite words
A.E. Frid
Discrete Applied Mathematics
114
(1-3), 2001, pp. 115-120
On factor graphs of DOL words
A.E. Frid
Discrete Applied Mathematics
114
(1-3), 2001, pp. 121-130
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
Victor P. Il'ev
Discrete Applied Mathematics
114
(1-3), 2001, pp. 131-146
On minimal coverings of the Boolean cube by centered antichains
O.M. Kasim-Zade
Discrete Applied Mathematics
114
(1-3), 2001, pp. 147-153
On combinatorial properties of the Arshon sequence
A.V. Klepinin
,
E.V. Sukhanov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 155-169
On the asymptotics of the number of binary words with a given length of a maximal series
A.D. Korshunov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 171-201
A
-closed classes of idempotent functions of many-valued logic definable by binary relations
S.S. Marchenkov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 203-225
Upper bounds for the complexity of sequences generated by symmetric Boolean functions
Yu.V. Merekin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 227-231
On the number of connected sets with the neighborhood of a given size in a graph
A.A. Sapozhenko
Discrete Applied Mathematics
114
(1-3), 2001, pp. 233-247
On finding a maximum spanning tree of bounded radius
A.I. Serdjukov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 249-253
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
K.N. Kashyrskikh
,
C.N. Potts
,
S.V. Sevastianov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 255-271
Linear time approximation scheme for the multiprocessor open shop problem
S.V. Sevastianov
,
G.J. Woeginger
Discrete Applied Mathematics
114
(1-3), 2001, pp. 273-288
Cyclic distance-preserving codes on a constant-weight basis
A.J. van Zanten
Discrete Applied Mathematics
114
(1-3), 2001, pp. 289-294
On connected list colorings of graphs
V.G. Vizing
Discrete Applied Mathematics
114
(1-3), 2001, pp. 295-300
Locally bounded hereditary subclasses of
k
-colourable graphs
I.E. Zverovich
Discrete Applied Mathematics
114
(1-3), 2001, pp. 301-311