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 YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polyadic codes
Richard A. Brualdi
,
Vera S. Pless
Discrete Applied Mathematics
25
, 1989, pp. 3-17
A new complete language for DSPACE
(\log n)
Jian-er Chen
Discrete Applied Mathematics
25
, 1989, pp. 19-26
On a conjecture of Graham and Lovász about distance matrices
Karen L. Collins
Discrete Applied Mathematics
25
, 1989, pp. 27-35
Ramsey-type theorems
P. Erdŏs
,
A. Hajnal
Discrete Applied Mathematics
25
, 1989, pp. 37-52
Epidemiography with various growth functions
Aviezri S. Fraenkel
,
Mordechai Lorberbom
Discrete Applied Mathematics
25
, 1989, pp. 53-71
Coherent algebras and the graph isomorphism problem
Shmuel Friedland
Discrete Applied Mathematics
25
, 1989, pp. 73-98
Some Cayley graphs for simple groups
W.M. Kantor
Discrete Applied Mathematics
25
, 1989, pp. 99-104
A Tutte polynomial for signed graphs
Louis H. Kauffman
Discrete Applied Mathematics
25
, 1989, pp. 105-127
On the variance of the external path length in a symmetric digital trie
Peter Kirschenhofer
,
Helmut Prodinger
,
Wojciech Szpankowski
Discrete Applied Mathematics
25
, 1989, pp. 129-143
Detecting leftmost maximal periodicities
Michael G. Main
Discrete Applied Mathematics
25
, 1989, pp. 145-153
Generalized Latin squares I
Xiaojun Shen
,
Y.Z. Cai
,
C.L. Liu
,
Clyde P. Kruskal
Discrete Applied Mathematics
25
, 1989, pp. 155-178
Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
Vijay V. Vazirani
,
Mihalis Yannakakis
Discrete Applied Mathematics
25
, 1989, pp. 179-190
Low complexity normal bases
David W. Ash
,
Ian F. Blake
,
Scott A. Vanstone
Discrete Applied Mathematics
25
, 1989, pp. 191-210
The steepest descent gravitational method for linear programming
Soo Y. Chang
,
Katta G. Murty
Discrete Applied Mathematics
25
, 1989, pp. 211-239
Patterns in trees
Nachum Dershowitz
,
Shmuel Zaks
Discrete Applied Mathematics
25
, 1989, pp. 241-255
Better understanding of Batcher's merging networks
Yehoshua Perl
Discrete Applied Mathematics
25
, 1989, pp. 257-271
Knots in random walks
Nicholas Pippenger
Discrete Applied Mathematics
25
, 1989, pp. 273-278
On spanning subgraphs of 4-connected planar graphs
Moshe Rosenfeld
Discrete Applied Mathematics
25
, 1989, pp. 279-287
Optimal and near-optimal broadcast in random graphs
Edward R. Scheinerman
,
John C. Wierman
Discrete Applied Mathematics
25
, 1989, pp. 289-297
Scheduling periodic events
A. Vince
Discrete Applied Mathematics
25
, 1989, pp. 299-310
The absolute center of a unicyclic network
Pentti Hämäläinen
Discrete Applied Mathematics
25
, 1989, pp. 311-315
On the orderability problem for PLA folding
S.S. Ravi
Discrete Applied Mathematics
25
, 1989, pp. 317-320
An
O(n^{1.5})
algorithm to color proper circular arcs
Wei-Kuan Shih
,
Wen-Lian Hsu
Discrete Applied Mathematics
25
, 1989, pp. 321-323
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données
D. Arquès
Discrete Applied Mathematics
24
, 1989, pp. 3-23
A new color change to improve the coloring of a graph
C. Berge
Discrete Applied Mathematics
24
, 1989, pp. 25-28
Seiten 1
2
3
>