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: Author="Subramanian, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational proteomics: Genome-scale analysis of protein structure, function, & evolution
Mark Gerstein
,
P. Harrison
,
J. Qian
,
R. Jansen
,
V. Alexandrov
,
P. Bertone
,
R. Das
,
D. Greenbaum
,
W. Krebs
,
Y. Liu
,
H. Hegyi
,
N. Echols
,
J. Lin
,
C. Wilson
,
A. Drawid
,
Z. Zhang
,
Y. Kluger
,
N. Lan
,
N. Luscombe
,
S. Balasubramanian
Proceedings of the German Conference on Bioinformatics, Volume I - Oral Presentations, GCB'2003 (Garching, Germany, October 12-14, 2003)
I
, 2003, pp. 53-53
On the hardness of approximating minimum monopoly problems
S. Mishra
,
J. Radhakrishnan
,
S. Sivasubramanian
Lecture Notes in Computer Science
2556
, 2002, pp. 277-288
A fully dynamic approximation scheme for shortest paths in planar graphs
P.N. Klein
,
S. Subramanian
Algorithmica
22
(3), 1998, pp. 235-249
Storage management for evolving databases
J. Kleinberg
,
R. Motwani
,
P. Raghavan
,
S. Venkatasubramanian
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 353-362
Buy-at-bulk network design: Approximating the single-sink edge installation problem
F.S. Salman
,
J. Cheriyan
,
R. Ravi
,
S. Subramanian
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 619-628
An efficient parallel algorithm for shortest paths in planar layered digraphs
S. Subramanian
,
R. Tamassia
,
J.S. Vitter
Algorithmica
14
, 1995, pp. 322-339