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: Author="Hambrusch, S.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New algorithms for minimizing the longest wire length during circuit compaction
S.E. Hambrusch
,
Hung-Yi Tu
Algorithmica
17
, 1997, pp. 426-448
Finding maximum cliques on circular-arc graphs
A. Apostolico
,
S.E. Hambrusch
Information Processing Letters
26
(4), 1987, December, pp. 209-215
On bipartite matchings of minimum density
M.J. Atallah
,
S.E. Hambrusch
Journal of Algorithms
8
(4), 1987, December, pp. 480-502
Optimal three-dimensional layouts of complete binary trees
A.K. Gupta
,
S.E. Hambrusch
Information Processing Letters
26
(2), 1987, October, pp. 99-104
Solving tree problems on a mesh-connected processor array
M.J. Atallah
,
S.E. Hambrusch
Information and Control
69
(1-3), 1986, pp. 168-187
Solving tree problems on a mesh-connected processor array
M.J. Atallah
,
S.E. Hambrusch
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 222-231
Solving undirected graph problems on VLSI
S.E. Hambrusch
,
J. Simon
SIAM Journal on Computing
14
(3), 1985, August, pp. 527-544
VLSI algorithms for the connected component problem
S.E. Hambrusch
SIAM Journal on Computing
12
(2), 1983, May, pp. 354-365
VLSI algorithms for the connected component problem and its verification problem
S.E. Hambrusch
Applied Computer Science
, 1982, pp. 231-241