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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Heat conduction on graphs
Nafiz Abu-Jaradeh
,
David L. Powers
Discrete Applied Mathematics
52
(1), 1994, pp. 1-16
Faster isometric embedding in products of complete graphs
Franz Aurenhammer
,
Michael Formann
,
Ramana M. Idury
,
Alejandro A. Schäffer
,
Frank Wagner
Discrete Applied Mathematics
52
(1), 1994, pp. 17-28
A new competitive algorithm for group testing
Amotz Bar-Noy
,
Frank K. Hwang
,
Ilan Kessler
,
Shay Kutten
Discrete Applied Mathematics
52
(1), 1994, pp. 29-38
An isomorphism between the
p
-adic integers and a ring associated with a tiling of
N
-space by permutohedra
Wei Z. Kitto
,
Andrew Vince
,
David C. Wilson
Discrete Applied Mathematics
52
(1), 1994, pp. 39-51
Computing maximum mean cuts
Thomas S. McCormick
,
Thomas R. Ervolina
Discrete Applied Mathematics
52
(1), 1994, pp. 53-70
Recognition of
d
-dimensional Monge arrays
Rüdiger Rudolf
Discrete Applied Mathematics
52
(1), 1994, pp. 71-82
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems
Hanif D. Sherali
,
Warren P. Adams
Discrete Applied Mathematics
52
(1), 1994, pp. 83-106
A review of combinatorial problems arising in feedforward neural network design
E. Amaldi
,
E. Mayoraz
,
D. de Werra
Discrete Applied Mathematics
52
(2), 1994, pp. 111-138
An efficient matching algorithm applied in statistical physics
J. Bendisch
,
U. Derigs
,
A. Metz
Discrete Applied Mathematics
52
(2), 1994, pp. 139-153
Bounds on certain multiplications of affine combinations
Joan Boyar
,
Faith Fich
,
Kim S. Larsen
Discrete Applied Mathematics
52
(2), 1994, pp. 155-167
Some results on greedy algorithm conjectures
T. Cole
Discrete Applied Mathematics
52
(2), 1994, pp. 169-194
Intersection graphs of concatenable subtrees of graphs
F. Gavril
,
J. Urrutia
Discrete Applied Mathematics
52
(2), 1994, pp. 195-209
On
(q,1)
-subnormal
q
-ary covering codes
Iiro Honkala
Discrete Applied Mathematics
52
(3), 1994, pp. 213-221
Analysis of scheduling problems with typed task systems
Klaus Jansen
Discrete Applied Mathematics
52
(3), 1994, pp. 223-232
A special planar satisfiability problem and a consequence of its NP-completeness
Jan Kratochvíl
Discrete Applied Mathematics
52
(3), 1994, pp. 233-252
Two machine open shop scheduling problem with bi-criteria
Teruo Masuda
,
Hiroaki Ishii
Discrete Applied Mathematics
52
(3), 1994, pp. 253-259
The parallel solution of domination problems on chordal and strongly chordal graphs
Elias Dahlhaus
,
Peter Damaschke
Discrete Applied Mathematics
52
(3), 1994, pp. 261-273
On sparse languages
L
such that
LL = \Sigma^*
Per Enflo
,
Andrew Granville
,
Jeffrey Shallit
,
Sheng Yu
Discrete Applied Mathematics
52
(3), 1994, pp. 275-285
Z-cyclic whist tournaments with a patterned starter initial round
Norman J. Finizio
Discrete Applied Mathematics
52
(3), 1994, pp. 287-293
Packing problems in edge-colored graphs
P. Hell
,
Y. Manoussakis
,
Zs. Tuza
Discrete Applied Mathematics
52
(3), 1994, pp. 295-306
Linear recognition of pseudo-split graphs
Frédéric Maffray
,
Myriam Preissmann
Discrete Applied Mathematics
52
(3), 1994, pp. 307-312