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="Ramkumar, G.D.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On approximating the longest path in a graph
D. Karger
,
R. Motwani
,
G.D.S. Ramkumar
Algorithmica
18
(1), 1997, pp. 82-98
Efficient parallel shuffle recognition
M. Nivat
,
G.D.S. Ramkumar
,
C. Pandu Rangan
,
A. Saoudi
,
R. Sundaram
Parallel Processing Letters
4
(4), 1994, pp. 455-463
On approximating the longest path in a graph
David Karger
,
Rajeev Motwani
,
G.D.S. Ramkumar
Proceedings of the 3rd Workshop on Algorithms and Data Structures. WADS '93 (Montréal, Canada, August 1993)
LNCS 709
, 1993, pp. 421-432
On some largest empty orthoconvex polygons in a point set
Amitava Datta
,
G.D.S. Ramkumar
Lecture Notes in Computer Science
472
, 1990, pp. 270-285
Parallel algorithms on interval graphs
G.D.S. Ramkumar
,
C. Pandu Rangan
Proceedings of the 1990 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'90 (St.~Charles, IL, August 13-17, 1990)
, 1990, pp. 72-74