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
[1]
Hilfe
Suche: Journal=SIAM J. Algebraic Discrete Methods AND Volume=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Index two linear time-varying singular systems of differential equations
Stephen L. Campbell
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 237-243
The concept of two-chord tiesets and its application to an algebraic characterization of non-series-parallel graphs
Shoji Shinoda
,
Wai-Kai Chen
,
Shu-Park Chan
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 244-252
The maximum coverage location problem
N. Megiddo
,
E. Zemel
,
S.L. Hakimi
SIAM Journal on Algebraic Discrete Methods
4
(2), 1983, June, pp. 253-261
Determinacy in linear systems and networks
J.S. Provan
SIAM Journal on Algebraic Discrete Methods
4
(2), 1983, June, pp. 262-278
Equivalence classes of Hermitian matrices and their Schur parametrization
Philippe Delsarte
,
Y. Genin
,
Y. Kamp
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 279-289
Threshold-bounded interval orders and a theory of picycles
Peter C. Fishburn
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 290-305
On the harmonious coloring of graphs
J.E. Hopcroft
,
M.S. Krishnamoorthy
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 306-311
Crossing number is
NP
-complete
M.R. Garey
,
D.S. Johnson
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 312-316
Weight enumerators of normalized codes II. The Hermitian case
Stephen M., Jr. Gagola
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 317-354
On some problems in the design of plane skeletal structures
Kökichi Sugihara
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 355-362
A class of balanced matrices arising from location problems
A. Tamir
SIAM Journal on Algebraic Discrete Methods
4
(3), 1983, September, pp. 363-370
Isolating error effects in solving ill-posed problems
C. Mark Aulick
,
Thomas M. Gallie
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 371-376
Matrix diagonal stability and its implications
Abraham Berman
,
Daniel Hershkowitz
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 377-382
Approximation algorithms for maximizing the number of squares packed into a rectangle
B.S. Baker
,
A.R. Calderbank
,
E.G., Jr. Coffman
,
J.C. Lagarias
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 383-397
A combinatorial construction of perfect codes
K.T. Phelps
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 398-403
Estimation of sparse Jacobian matrices
Garry N. Newsam
,
John D. Ramsdell
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 404-418
Erdös-Ko-Rado theorem - 22 years laters
M. Deza
,
P. Frankl
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 419-431
On the matrix equation
AX+X^*A^* = C
P. Lancaster
,
P. Rozsa
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 432-436
Signs of terms in a combinatorial recursion
Stephen M. Tanny
,
Michael Zuker
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 437-441
The Banzhaf index for multicandidate presidential elections
Edward M. Bolger
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 442-458
Runs, slides and moments
Louis W. Shapiro
,
Wen-Jin Woan
,
Seyoum Getu
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 459-466
A matroid abstraction of the Bott-Duffin constrained inverse
Seth Chaiken
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 467-475
A class of
M
-matrices with tree graphs
Charles R. Johnson
,
D.D. Olesky
,
P. van den Driessche
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 476-480
The algebraic geometry of stresses in frameworks
Neil L. White
,
Walter Whiteley
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 481-511
Efficient optimization of monotonic functions on trees
Yehoshua Perl
,
Yossi Shiloach
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 512-516
Seiten
<
1
2
3
>