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="Narayanan, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on optimal covering augmentation for graphic polymatroids
Sachin B. Patkar
,
H. Narayanan
Information Processing Letters
79
(6), 2001, pp. 285-290
Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
Sachin B. Patkar
,
H. Narayanan
Lecture Notes in Computer Science
1974
, 2000, pp. 94-105
Approximation algorithms for Min-
k
-overlap problems using the prinicipal lattice of partitions approach
H. Narayanan
,
Subir Roy
,
Sachin Patkar
Journal of Algorithms
21
(2), 1996, pp. 306-330
Approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach
H. Narayanan
,
S. Roy
,
S. Patkar
Lecture Notes in Computer Science
841
, 1994, pp. 525-535
Randomized parallel algorithms for matroid union and intersection, with applications to arborescences and edge-disjoint spanning trees
H. Narayanan
,
Huzur Saran
,
Vijay V. Vazirani
SIAM Journal on Computing
23
(2), 1994, April, pp. 387-397
Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees
H. Narayanan
,
Huzur Saran
,
Vijay V. Vazirani
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 357-366
Fast sequential and randomized parallel algorithms for rigidity and approximate min
k
-cut
Sachin Patkar
,
H. Narayanan
Lecture Notes in Computer Science
652
, 1992, pp. 265-278
Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
Sachin Patkar
,
H. Narayanan
Lecture Notes in Computer Science
650
, 1992, pp. 41-50
A fast algorithm for the principal partition of a graph
Sachin Patkar
,
H. Narayanan
Lecture Notes in Computer Science
560
, 1991, pp. 288-306