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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sorting strings by reversals and by transpositions
David A. Christie
,
Robert W. Irving
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 193-206
Preserving and increasing local edge-connectivity in mixed graphs
Jrgen Bang-Jensen
,
András Frank
,
Bill Jackson
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 155-178
Competition graphs of strongly connected and Hamiltonian digraphs
Kathryn F. Fraughnaugh
,
J. Richard Lundgren
,
Sarah K. Merz
,
John S. Maybee
,
Norman J. Pullman
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 179-185
A competitive strong spanning tree algorithm for the maximum bipartite matching problem
Jaime González
,
Osvaldo Landaeta
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 186-195
Bounds for binary codes that are multiple coverings of the farthest-off points
Heikki O. Hämäläinen
,
Iiro S. Honkala
,
Simon N. Litsyn
,
Patric R.J. östergÅrd
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 196-207
The existence of homomorphisms to oriented cycles
Pavol Hell
,
Xuding Zhu
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 208-222
Chernoff-Hoeffding bounds for applications with limited independence
Jeanette P. Schmidt
,
Alan Siegel
,
Aravind Srinivasan
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 223-250
Nonredundant 1's in
\Gamma
-free matrices
Jeremy P. Spinrad
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 251-257
Sliceable floorplanning by graph dualization
Gary K.H. Yeap
,
Majid Sarrafzadeh
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 258-280
Two-way rounding
Donald E. Knuth
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 281-290
Degree-constrained network spanners with nonconstant delay
Arthur L. Liestman
,
Thomas C. Shermer
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 291-321
Analysis of a recurrence arising from a construction for nonblocking networks
Nicholas Pippenger
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 322-345
An inequality for probability moments with applications
Earl R. Barnes
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 347-358
Tree spanners
Leizhen Cai
,
Derek G. Corneil
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 359-387
Combinatorial algorithm for a lower bound on frame rigidity
D.S. Franzblau
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 388-400
Approximation algorithms for minimum-time broadcast
Guy Kortsarz
,
David Peleg
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 401-427
Multidimensional divide-and-conquer maximin recurrences
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 428-447
P-components and the homogeneous decomposition of graphs
Beverly Jamison
,
Stephan Olariu
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 448-463
The complexity of the Hajós calculus
Toniann Pitassi
,
Alasdair Urquhart
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 464-483
On-line and first-fit colouring of graphs that do not induce
P_5
Henry A. Kierstead
,
Stephen G. Penrice
,
William T. Trotter
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 485-498
On the
\lambda
-number of
Q_n
and related graphs
Marshall A. Whittlesey
,
John P. Georges
,
David W. Mauro
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 499-506
The median procedure in a formal theory of consensus
F.R. McMorris
,
R.C. Powers
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 507-516
Symmetric matrices representable by weighted trees over a cancellative abelian monoid
Hans-Jürgen Bandelt
,
Michael Anthony Steel
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 517-525
Correlation of boolean functions and pathology in recursion trees
Ingo Althöfer
,
Imre Leader
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 526-535
Lower bounds on formula size of boolean functions using hypergraph entropy
Ilan Newman
,
Avi Wigderson
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 536-542
Seiten 1
2
>