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=77
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sufficient condition for polynomial distribution-dependent learnability
Martin Anthony
,
John Shawe-Taylor
Discrete Applied Mathematics
77
(1), 1997, pp. 1-12
Anonymous secret sharing schemes
C. Blundo
,
D.R. Stinson
Discrete Applied Mathematics
77
(1), 1997, pp. 13-28
Mixed interval hypergrahs
Elena Bulgaru
,
Vitaly I. Voloshin
Discrete Applied Mathematics
77
(1), 1997, pp. 29-41
On quasi-Cayley graphs
Ginette Gauyacq
Discrete Applied Mathematics
77
(1), 1997, pp. 43-58
Unified all-pairs shortest path algorithms in the chordal hierarchy
K. Han
,
Chandra N. Sekharan
,
R. Sridhar
Discrete Applied Mathematics
77
(1), 1997, pp. 59-71
The complementary class of generalized flow cover inequalities
Jan I.A. Stallaert
Discrete Applied Mathematics
77
(1), 1997, pp. 73-80
Monotonicity of single-seat preferential election rules
Douglas R. Woodall
Discrete Applied Mathematics
77
(1), 1997, pp. 81-98
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Dominique Barth
,
Marie-Claude Heydemann
Discrete Applied Mathematics
77
(2), 1997, pp. 99-118
Uniform tag systems for paperfolding sequences
Christiane Bercoff
Discrete Applied Mathematics
77
(2), 1997, pp. 119-138
Constructing efficient simulated annealing algorithms
Manuel Duque-Antón
Discrete Applied Mathematics
77
(2), 1997, pp. 139-159
Dynamic behavior of cyclic automata networks
Martín Matamala
,
Eric Goles
Discrete Applied Mathematics
77
(2), 1997, pp. 161-184
A polynomial-time algortihm for the two-machine unit-time release-date job-shop schedule-length problem
Vadim G. Timkovsky
Discrete Applied Mathematics
77
(2), 1997, pp. 185-200
Time-optimal tree computations on sparse meshes
D. Bhagavathi
,
V. Bokka
,
H. Gurla
,
S. Olariu
,
J.L. Schwing
Discrete Applied Mathematics
77
(3), 1997, pp. 201-220
The forbidden projections of unate functions
Aaron Feigelson
,
Lisa Hellerstein
Discrete Applied Mathematics
77
(3), 1997, pp. 221-236
The VC-dimension of set systems defined by graphs
Evangelos Kranakis
,
Danny Krizanc
,
Berthold Ruf
,
Jorge Urrutia
,
Gerhard Woeginger
Discrete Applied Mathematics
77
(3), 1997, pp. 237-257
Measuring the vulnerability for classes of intersection graphs
Dieter Kratsch
,
Ton Kloks
,
Haiko Müller
Discrete Applied Mathematics
77
(3), 1997, pp. 259-270
Simple but efficient approaches for the collapsing knapsack problem
Ulrich Pferschy
,
David Pisinger
,
Gerhard J. Woeginger
Discrete Applied Mathematics
77
(3), 1997, pp. 271-280
Multiplicative circulant networks topological properties and communication algorithms
Ivan Stojmenović
Discrete Applied Mathematics
77
(3), 1997, pp. 281-305