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="Sundaram, Ravi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget
Nikolaos Laoutaris
,
Laura Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
Journal of Computer and System Sciences
80
(7), 2014, pp. 1266-1284
Reducibility among fractional stability problems
Shiva Kintali
,
Laura J. Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
SIAM Journal on Computing
42
(6), 2013, pp. 2063-2113
(Almost) tight bounds and existence theorems for single-commodity confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Journal of the ACM
54
(4), 2007, pp. 16: 1-32
On completing Latin squares
Iman Hajirasouliha
,
Hossein Jowhari
,
Ravi Kumar
,
Ravi Sundaram
Lecture Notes in Computer Science
4393
, 2007, pp. 524-535
Meet and merge: Approximation algorithms for confluent flows
Jiangzhuo Chen
,
Rajmohan Rajaraman
,
Ravi Sundaram
Journal of Computer and System Sciences
72
(3), 2006, pp. 468-489
A methodology for estimating interdomain Web traffic
Anna Feldmann
,
Nils Kammenhuber
,
Olaf Maennel
,
Bruce Maggs
,
Roberto De Prisco
,
Ravi Sundaram
HNI-Verlagsschriftenreihe
181
, 2006, pp. 7-11
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia
,
Guolong Lin
,
Guevara Noubir
,
Rajmohan Rajaraman
,
Ravi Sundaram
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 386-395
(Almost) tight bounds and existence theorems for confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 529-538
Meet and merge: Approximation algorithms for confluent flows
Jiangzhuo Chen
,
Rajmohan Rajaraman
,
Ravi Sundaram
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 373-382
Bicriteria network design problems
Madhav V. Marathe
,
R. Ravi
,
Ravi Sundaram
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Harry B. Hunt III
Journal of Algorithms
28
(1), 1998, pp. 142-171
A note on optical routing on trees
S. Ravi Kumar
,
Rina Panigrahy
,
Alexander Russell
,
Ravi Sundaram
Information Processing Letters
62
(6), 1997, pp. 295-300
Approximating Latin square extensions
S. Ravi Kumar
,
Alexander Russell
,
Ravi Sundaram
Lecture Notes in Computer Science
1090
, 1996, pp. 280-289
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Alexander Russell
,
Ravi Sundaram
Information Processing Letters
53
, 1995, pp. 61-68
Treewidth of circular-arc graphs
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
SIAM Journal on Discrete Mathematics
7
(4), 1994, November, pp. 647-655
Optimal path cover problem on block graphs and bipartite permutation graphs
R. Srikant
,
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
Theoretical Computer Science
115
(2), 1993, pp. 351-357
Treewidth of circular-arc graphs
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
Lecture Notes in Computer Science
519
, 1991, pp. 41-41