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=SIAM J. Disc.~Math. AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of nonnegative box-greedy matrices
Ulrich Faigle
,
Alan J. Hoffman
,
Walter Kern
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 1-6
Efficient gossiping by packets in networks with random faults
Krzysztof Diks
,
Andrzej Pelc
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 7-18
Short random walks on graphs
Greg Barnes
,
Uriel Feige
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 19-28
The biased coin problem
Ravi B. Boppana
,
Babu O. Narayanan
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 29-36
Spanners of hypercube-derived networks
Marie-Claude Heydemann
,
Joseph G. Peters
,
Dominique Sotteau
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 37-54
Lower bounds on representing Boolean functions as polynomials in
Z_m
Shi-Chun Tsai
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 55-62
On convex subsets in tournaments
David J. Haglin
,
Marty J. Wolf
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 63-70
Horizontal principal structure of layered mixed matrices: Decomposition of discrete systems by design-variable selections
Satoru Iwata
,
Kazuo Murota
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 71-86
Data security equals graph connectivity
Ming-Yang Kao
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 87-100
On linear recognition of tree-width at most four
Daniel P. Sanders
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 101-117
Chip-firing games on mutating graphs
Kimmo Eriksson
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 118-128
Linear algorithms for partitioning embedded graphs of bounded genus
L. Aleksandrov
,
H. Djidjev
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 129-150
Nowhere-zero 4-flows and Cayley graphs on solvable groups
Brian Alspach
,
Yi-Ping Liu
,
Cun-Quan Zhang
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 151-154
Tight bounds for dynamic storage allocation
Michael G. Luby
,
Joseph (Seffi) Naor
,
Ariel Orda
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 155-166
Finding a domatic partition of an interval graph in time
O(n)
Glen K. Manacher
,
Terrance A. Mankus
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 167-172
On a question of Erdŏs on subsequence sums
Don Coppersmith
,
Steven Phillips
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 173-177
Spanning trees-Short or small
R. Ravi
,
R. Sundaram
,
M.V. Marathe
,
D.J. Rosenkrantz
,
S.S. Ravi
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 178-200
On the nonexistence of perfect codes in the Johnson scheme
Tuvi Etzion
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 201-209
A graph-coloring result and its consequences for polygon-guarding problems
Frank Hoffmann
,
Klaus Kriegel
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 210-224
Classifying hyperplanes in hypercubes
Oswin Aichholzer
,
Franz Aurenhammer
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 225-232
Packing Steiner trees: Separation algorithms
M. Grötschel
,
A. Martin
,
R. Weismantel
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 233-257
On the power of democratic networks
E.N. Mayoraz
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 258-268
Bounding functions and rigid graphs
Michael O. Albertson
,
Ruth Haas
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 269-273
A linear algorithm for maximum weight cliques in proper circular arc graphs
Binay Bhattacharya
,
Pavol Hell
,
Jing Huang
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 274-289
The ultimate categorical independence ratio of a graph
Jason I. Brown
,
Richard J. Nowakowski
,
Douglas Rall
SIAM Journal on Discrete Mathematics
9
(2), 1996, pp. 290-300
Seiten 1
2
>