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=81
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On variations of the subset sum problem
J.L. Ramírez Alfonsín
Discrete Applied Mathematics
81
(1-3), 1998, pp. 1-7
Minimum matrix representation of Sperner systems
F.E. Bennett
,
L. Wu
Discrete Applied Mathematics
81
(1-3), 1998, pp. 9-17
Exact classification with two-layer neural nets in
n
dimensions
Catherine Z.W. Hassell Sweatman
,
Gavin J. Gibson
,
Bernard Mulgrew
Discrete Applied Mathematics
81
(1-3), 1998, pp. 19-39
Routing a vehicle of capacity greater than one
D.J. Guan
Discrete Applied Mathematics
81
(1-3), 1998, pp. 41-57
The maximal clique and colourability of curve contact graphs
Petr Hlinȇný
Discrete Applied Mathematics
81
(1-3), 1998, pp. 59-68
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
Yanpei Liu
,
Aurora Morgana
,
Bruno Simeone
Discrete Applied Mathematics
81
(1-3), 1998, pp. 69-91
Performance of Coffman-Graham schedules in the presence of unit communication delays
C. Hanen
,
A. Munier
Discrete Applied Mathematics
81
(1-3), 1998, pp. 93-108
Panelling planar graphs
James Oxley
,
Don Row
Discrete Applied Mathematics
81
(1-3), 1998, pp. 109-122
A strongly polynomial algorithm for the uniform balanced network flow problem
Maria Grazia Scutellà
Discrete Applied Mathematics
81
(1-3), 1998, pp. 123-131
Sensitivity analysis for knapsack problems: A negative result
Charles Blair
Discrete Applied Mathematics
81
(1-3), 1998, pp. 133-139
Polyhedral characterizatons and perfection of line graphs
Dasong Cao
,
George L. Nemhauser
Discrete Applied Mathematics
81
(1-3), 1998, pp. 141-154
On the number of Abelian square-free words on four letters
Arturo Carpi
Discrete Applied Mathematics
81
(1-3), 1998, pp. 155-167
Edge-packing planar graphs by cyclic graphs
Lenwood S. Heath
,
John Paul C. Vergara
Discrete Applied Mathematics
81
(1-3), 1998, pp. 169-180
Steiner intervals in graphs
Ewa Kubicka
,
Grzegorz Kubicki
,
Ortrud R. Oellermann
Discrete Applied Mathematics
81
(1-3), 1998, pp. 181-190
A fast parallel algorithm to recognize
P4
-sparse graphs
Rong Lin
,
Stephan Olariu
Discrete Applied Mathematics
81
(1-3), 1998, pp. 191-215
Interchange graphs and the Hamiltonian cycle polytope
Gerard Sierksma
Discrete Applied Mathematics
81
(1-3), 1998, pp. 217-224
Polynomial invariants for trees - A statistical mechanics approach
Roberto Conti
,
Pierluigi Contucci
,
Corrado Falcolini
Discrete Applied Mathematics
81
(1-3), 1998, pp. 225-237
Better approximations of non-Hamiltonian graphs
Kazuo Iwama
,
Eiji Miyano
Discrete Applied Mathematics
81
(1-3), 1998, pp. 239-261