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="Srinivasan, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Use of multiple profiles corresponding to a sequence alignment enables effective detection of remote homologues
B. Anand
,
V.S. Gowri
,
N. Srinivasan
Bioinformatics
21
(12), 2005, pp. 2821-2826
PALI: A database of alignments and phylogeny of homologous protein structures
S. Sujatha
,
S. Balaji
,
N. Srinivasan
Bioinformatics
17
(4), 2001, pp. 375-376
DCC linear congruential graphs: A new class of interconnection networks
Jaroslav Opatrny
,
Dominique Sotteau
,
N. Srinivasan
,
K. Thulasiraman
IEEE Transactions on Computers
45
(2), 1996, pp. 156-164
Hamiltonian cycles and closed trails in iterated line graphs
Paul A. Catlin
,
Iqbalunnisa
,
T.N. Janakiraman
,
N. Srinivasan
Journal of Graph Theory
14
(3), 1990, pp. 347-364
Bigeodetic graphs
N. Srinivasan
,
J. Opatrny
,
V.S. Alagar
Graphs and Combinatorics
4
, 1988, pp. 379-392
Geodetic blocks of diameter three
K.R. Parthasarathy
,
N. Srinivasan
Combinatorica
4
, 1984, pp. 197-206
Some general constructions of geodetic blocks
K.R. Parthasarathy
,
N. Srinivasan
Journal of Combinatorial Theory Series B
33
, 1982, pp. 121-136