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="Swaminathan, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for data migration
E. Anderson
,
J. Hall
,
J. Hartline
,
M. Hobbes
,
A. Karlin
,
J. Saia
,
R. Swaminathan
,
J. Wilkes
Algorithmica
57
(2), 2010, pp. 349-380
An algorithm for the class of pure implicational formulas
John Franco
,
Judy Goldsmith
,
John Schlipf
,
Ewald Speckenmeyer
,
R.P. Swaminathan
Discrete Applied Mathematics
96-97
, 1999, pp. 89-106
On testing consecutive-ones property in parallel
F.S. Annexstein
,
R.P. Swaminathan
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 (Santa Barbara, California, July 17-19, 1995)
, 1995, pp. 234-243
On finding solutions for extended Horn formulas
John S. Schlipf
,
Fred S. Annexstein
,
John V. Franco
,
R.P. Swaminathan
Information Processing Letters
54
, 1995, pp. 133-137
The pagenumber of the class of bandwidth-
k
graphs is
k-1
R.P. Swaminathan
,
D. Giriraj
,
D.K. Bhatia
Information Processing Letters
55
, 1995, pp. 71-74
The arborescence-realization problem
R.P. Donald K. Wagner Swaminathan
Discrete Applied Mathematics
59
, 1995, pp. 267-283
Decomposition of
\{0,1\}
-matrices
R. Swaminathan
,
D. Veeramani
IEEE Transactions on Computers
43
(5), 1994, May, pp. 629-633
On the consecutive-retrieval problem
R. Swaminathan
,
Donald K. Wagner
SIAM Journal on Computing
23
(2), 1994, April, pp. 398-414
A bad submatrix is easy to find
R.P. Swaminathan
Networks
24
(5), 1994, pp. 267-271
Vertex 2-isomorphism
R. Swaminathan
,
Donald K. Wagner
Journal of Graph Theory
16
(4), 1992, pp. 335-347