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 Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum to ''Edge-bandwidth of graphs''
Tao Jiang
,
Dhruv Mubayi
,
Aditya Shastri
,
Douglas B. West
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 1-1
Bounds for dispersers, extractors, and depth-two superconcentrators
Jaikumar Radhakrishnan
,
Amnon Ta-Shma
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 2-24
Nonhamiltonian 3-connected cubic planar graphs
R.E.L. Aldred
,
S. Bau
,
D.A. Holton
,
Brendan D. McKay
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 25-32
Completely disconnecting the complete graph
John Ginsburg
,
Bill Sands
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 33-47
Recognizing perfect 2-split graphs
Chính T. Hoàng
,
Van Bang Le
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 48-55
A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine
J.A. Hoogeveen
,
A.P.A. Vestjens
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 56-63
Multiprocessor scheduling with rejection
Yair Bartal
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Jiȓí Sgall
,
Leen Stougie
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 64-78
The weight hierarchy of Hermitian codes
Angela I. Barbero
,
Carlos Munuera
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 79-104
Weight divisibility of cyclic codes, highly nonlinear functions on
F_2m
, and crosscorrelation of maximum-length sequences
Anne Canteaut
,
Pascale Charpin
,
Hans Dobbertin
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 105-138
On isoperimetric connectivity in vertex-transitive graphs
Y.O. Hamidoune
,
A.S. Lladó
,
O. Serra
,
R. Tindell
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 139-144
Optimal rounding of instantaneous fractional flows over time
Lisa Fleischer
,
James B. Orlin
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 145-153
Overlap and covering polynomials with applications to designs and self-dual codes
Gerald J. Janusz
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 154-178
Convex-round and concave-round graphs
Jrgen Bang-Jensen
,
Jing Huang
,
Anders Yeo
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 179-193
Lattice-simplex coverings and the 84-shape
Rod Forcade
,
Jack Lamoreaux
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 194-201
Connected domination and spanning trees with many leaves
Yair Caro
,
Douglas B. West
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 202-211
Boolean normal forms, shellability, and reliability computations
Endre Boros
,
Yves Crama
,
Oya Ekin
,
Peter L. Hammer
,
Toshihide Ibaraki
,
Alexander Kogan
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 212-226
A study on
r
-configurations - A resource assignment problem on graphs
Satoshi Fujita
,
Masafumi Yamashita
,
Tiko Kameda
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 227-254
Approximating minimum subset feedback sets in undirected graphs with applications
Guy Even
,
Joseph (Seffi) Naor
,
Baruch Schieber
,
Leonid Zosin
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 255-267
Directional routing via generalized
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 268-279
Two-dimensional Gantt charts and a scheduling algorithm of Lawler
Michel X. Goemans
,
David P. Williamson
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 281-294
The size of a graph without topological complete subgraphs
M. Cera
,
A. Diánez
,
A. Márquez
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 295-301
Evaluation, strength, and relevance of variables of Boolean functions
Peter L. Hammer
,
Alexander Kogan
,
Uriel G. Rothblum
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 302-312
A tight bound on the irregularity strength of graphs
Till Nierhoff
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 313-323
Computing functions of a shared secret
Amos Beimel
,
Mike Burmester
,
Yvo Desmedt
,
Eyal Kushilevitz
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 324-345
An optimization problem in statistical databases
Ljiljana Branković
,
Peter Horak
,
Mirka Miller
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 346-353
Seiten 1
2
>