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
[2]
Hilfe
Suche: Author="Spencer, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the Ramsey numbers of trees with small diameter
Patrick Bahls
,
T. Scott Spencer
Graphs and Combinatorics
29
(1), 2013, pp. 39-44
A new parallel algorithm for the maximal independent set problem
M. Goldberg
,
T. Spencer
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 161-165
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
H.N. Gabow
,
Z. Galil
,
T. Spencer
,
R.E. Tarjan
Combinatorica
6
(2), 1986, pp. 109-122
A new parallel algorithm for the maximal independent set problem
M. Goldberg
,
T. Spencer
Technical Report (86-26), 1986, November
Efficient implementation of graph algorithms using contraction
H.N. Gabow
,
Z. Galil
,
T.H. Spencer
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 347-357
Node weighted matching
T.H. Spencer
,
E.W. Mayr
Lecture Notes in Computer Science
172
, 1984, pp. 454-464