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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An application of discrete mathematics in the design of an open pit mine
L. Caccetta
,
L.M. Giannini
Discrete Applied Mathematics
21
, 1988, pp. 1-19
Bifurcation structure of a discrete neuronal equation
Michel Cosnard
,
Eric Goles Chacc
,
Driss Moumida
Discrete Applied Mathematics
21
, 1988, pp. 21-34
Trapezoid graphs and their coloring
Ido Dagan
,
Martin Charles Golumbic
,
Ron Yair Pinter
Discrete Applied Mathematics
21
, 1988, pp. 35-46
Some models of graphs for scheduling sports competitions
D. de Werra
Discrete Applied Mathematics
21
, 1988, pp. 47-65
Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
Christian Ronse
Discrete Applied Mathematics
21
, 1988, pp. 67-79
The complexity of a periodic sequence over
GF(p)
Shenquan Xie
Discrete Applied Mathematics
21
, 1988, pp. 81-86
Parametrization of knowledge structures
Jean-Paul Doignon
,
Jean-Claude Falmagne
Discrete Applied Mathematics
21
, 1988, pp. 87-100
Broadcasting in one dimension
Pavol Hell
,
Arthur L. Liestman
Discrete Applied Mathematics
21
, 1988, pp. 101-111
Strict 2-threshold graphs
N.V.R. Mahadev
,
Uri N. Peled
Discrete Applied Mathematics
21
, 1988, pp. 113-131
One-pass batching algorithms for the one-machine problem
Denis Naddef
,
Cipriano Santos
Discrete Applied Mathematics
21
, 1988, pp. 133-145
On the index of maximum density for irreducible Boolean matrices
Jia Yu Shao
,
Li Qiao
Discrete Applied Mathematics
21
, 1988, pp. 147-156
Minimizing bumps for posets of width two
Nejib Zaguia
Discrete Applied Mathematics
21
, 1988, pp. 157-162
Online algorithms for a dual version of bin packing
J. Csirik
,
V. Totik
Discrete Applied Mathematics
21
, 1988, pp. 163-167
A new reduction method in integer programming
Harold Greenberg
Discrete Applied Mathematics
21
, 1988, pp. 169-172
Finding a minimum independent dominating set in a permutation graph
Mikhail J. Atallah
,
Glenn K. Manacher
,
J. Urrutia
Discrete Applied Mathematics
21
, 1988, pp. 177-183
Lower bounds on two-terminal network reliability
Timothy B. Brecht
,
Charles J. Colbourn
Discrete Applied Mathematics
21
, 1988, pp. 185-198
A note on regular classes in special Thue systems
W. Bucher
Discrete Applied Mathematics
21
, 1988, pp. 199-205
m
-recognizability of sets closed under certain affine functions
David A. Klarner
Discrete Applied Mathematics
21
, 1988, pp. 207-214
Key storage in secure networks
Chris J. Mitchell
,
Fred C. Piper
Discrete Applied Mathematics
21
, 1988, pp. 215-228
Anomalous behavior in bin packing algorithms
Frank D. Murgolo
Discrete Applied Mathematics
21
, 1988, pp. 229-243
An intersection problem for finite automata
Michael Saks
,
Rick Statman
Discrete Applied Mathematics
21
, 1988, pp. 245-255
End vertices in interval graphs
John Gimbel
Discrete Applied Mathematics
21
, 1988, pp. 257-259
A defect property of codes with unbounded delays
Juha Honkala
Discrete Applied Mathematics
21
, 1988, pp. 261-264
A cryptanalytic observation concering systems based on language theory
Jarkko Kari
Discrete Applied Mathematics
21
, 1988, pp. 265-268