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=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering with latin transversals
Noga Alon
,
Joel Spencer
,
Prasad Tetali
Discrete Applied Mathematics
57
, 1995, pp. 1-10
Almost fully-parallel parentheses matching
Omer Berkman
,
Uzi Vishkin
Discrete Applied Mathematics
57
, 1995, pp. 11-28
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Elias Dahlhaus
Discrete Applied Mathematics
57
, 1995, pp. 29-44
A combinatorial approach to the problem of self-assembly
Yakov S. Smetanich
,
Yakov B. Kazanovich
,
Vyacheslav V. Kornilov
Discrete Applied Mathematics
57
, 1995, pp. 45-65
Using local adaptations to reconfigure a spanning tree of a network
Kirk R. Pruhs
Discrete Applied Mathematics
57
, 1995, pp. 67-74
The Hamiltonicity of directed
\sigma-\tau
Cayley graphs (Or: A tale of backtracking)
Frank Ruskey
,
Ming Jiang
,
Andrew Weston
Discrete Applied Mathematics
57
, 1995, pp. 75-83
The permutahedron of series-parallel posets
Andreas S. Schulz
Discrete Applied Mathematics
57
, 1995, pp. 85-90
The complexities of the coefficients of the Tutte polynomial
J.D. Annan
Discrete Applied Mathematics
57
, 1995, pp. 93-103
Optimal match-up strategies in stochastic scheduling
John R. Birge
,
M.A.H. Dempster
Discrete Applied Mathematics
57
, 1995, pp. 105-120
Regularity of matrices in min-algebra and its time-complexity
P. Butkovic̑
Discrete Applied Mathematics
57
, 1995, pp. 121-132
The complexity of harmonious colouring for trees
Keith Edwards
,
Colin McDiarmid
Discrete Applied Mathematics
57
, 1995, pp. 133-144
Stochastic scheduling and forwards induction
K.D. Glazebrook
Discrete Applied Mathematics
57
, 1995, pp. 145-165
A study of the cyclic scheduling problem on parallel processors
Claire Hanen
,
Alix Munier
Discrete Applied Mathematics
57
, 1995, pp. 167-192
Expected complexity of graph partitioning problems
Ludȇk Kuc̑era
Discrete Applied Mathematics
57
, 1995, pp. 193-212
Rooted routing in the plane
Bruce Reed
Discrete Applied Mathematics
57
, 1995, pp. 213-227
Nearly on line scheduling of preemptive independent tasks
Eric Sanlaville
Discrete Applied Mathematics
57
, 1995, pp. 229-241
A polynomial approximation scheme for the subset sum problem
Nei Yoshihiro Soma
,
Alan Solon Ivor Zinober
,
Horacio Hideki Yanasse
,
Peter John Harley
Discrete Applied Mathematics
57
, 1995, pp. 243-253
Weighted fractional and integral
k
-matching in hypergraphs
Anand Srivastav
,
Peter Stangier
Discrete Applied Mathematics
57
, 1995, pp. 255-269