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="Vishwanathan, Sundar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Metrical service systems with multiple servers
Ashish Chiplunkar
,
Sundar Vishwanathan
Lecture Notes in Computer Science
7936
, 2013, pp. 481-492
Circumference, chromatic number and online coloring
Ajit A. Diwan
,
Sreyash Kenkre
,
Sundar Vishwanathan
Combinatorica
33
(3), 2013, pp. 319-334
Approximation algorithms for the Bipartite Multicut problem
Sreyash Kenkre
,
Sundar Vishwanathan
Information Processing Letters
110
(8-9), 2010, pp. 282-287
A polynomial space proof of the Graham-Pollak theorem
Sundar Vishwanathan
Journal of Combinatorial Theory Series A
115
(4), 2008, pp. 674-676
The common prefix problem on trees
Sreyash Kenkre
,
Sundar Vishwanathan
Information Processing Letters
105
(6), 2007, pp. 245-248
A bound on the chromatic number using the longest odd cycle length
Sreyash Kenkre
,
Sundar Vishwanathan
Journal of Graph Theory
54
(4), 2007, pp. 267-276
Matched-factor
d
-domatic coloring of graphs
K.S. Sudeep
,
Sundar Vishwanathan
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1071-1082
An approximation algorithm for finding long paths in Hamiltonian graphs
Sundar Vishwanathan
Journal of Algorithms
50
(2), 2004, pp. 246-256
On 2-coloring certain
k
-uniform hypergraphs
Sundar Vishwanathan
Journal of Combinatorial Theory Series A
101
(1), 2003, pp. 168-172
Approximation algorithms for the achromatic number
Amitabh Chaudhary
,
Sundar Vishwanathan
Journal of Algorithms
41
(2), 2001, pp. 404-416
Depth-3 arithmetic circuits for
S_n^2(X)
and extensions of the Graham-Pollack theorem
Jaikumar Radhakrishnan
,
Pranab Sen
,
Sundar Vishwanathan
Lecture Notes in Computer Science
1974
, 2000, pp. 176-187
Multilinear polynomials and a conjecture of Frankl and Füredi
Arvind Sankar
,
Sundar Vishwanathan
Journal of Combinatorial Theory Series A
86
(1), 1999, pp. 182-186
Competitive algorithms for layered graph traversal
Amos Fiat
,
Dean P. Foster
,
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
,
Sundar Vishwanathan
SIAM Journal on Computing
28
(2), 1998, pp. 447-462
An
O(\log^* n)
approximation algorithm for the asymmetric
p
-center problem
Rina Panigrahy
,
Sundar Vishwanathan
Journal of Algorithms
27
(2), 1998, pp. 259-268
Approximation algorithms for the achromatic number
Amitabh Chaudhary
,
Sundar Vishwanathan
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 558-563
An
O(\log^*n)
approximation algorithm for the asymmetric
p
-center problem
Sundar Vishwanathan
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 1-5
Constructing reliable communication networks of small weight online
Barun Chandra
,
Sundar Vishwanathan
Journal of Algorithms
18
(1), 1995, pp. 159-175
Locality based graph coloring
Mario Szegedy
,
Sundar Vishwanathan
Proceedings of Theory of Computing (San Diego, California, May 16--18, 1993)
, 1993, pp. 201-207
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Sundar Vishwanathan
Information Processing Letters
44
(6), 1992, pp. 297-302
Randomized online graph coloring
Sundar Vishwanathan
Journal of Algorithms
13
, 1992, pp. 657-669
Competitive algorithms for layered graph traversal
Amos Fiat
,
Dean P. Foster
,
Howard Karloff
,
Yuval Rabani
,
Yiftach Ravid
,
Sundar Vishwanathan
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 288-297