default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSundar Vishwanathan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Vaibhav Krishan, Sundar Vishwanathan:
Towards ACC Lower Bounds using Torus Polynomials. Electron. Colloquium Comput. Complex. TR24 (2024)- 2021
- [j28]Anand Babu
, Sundar Vishwanathan:
Multicovering hypergraphs. Discret. Math. 344(6): 112386 (2021) - 2020
- [j27]Ashish Chiplunkar, Sundar Vishwanathan:
Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems. ACM Trans. Algorithms 16(1): 14:1-14:28 (2020)
2010 – 2019
- 2019
- [j26]Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models. Algorithmica 81(11-12): 4275-4292 (2019) - [j25]Anand Babu, Sundar Vishwanathan:
Bounds for the Graham-Pollak theorem for hypergraphs. Discret. Math. 342(11): 3177-3181 (2019) - 2017
- [j24]Sumedh Tirodkar, Sundar Vishwanathan:
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems. Algorithmica 79(3): 909-924 (2017) - [c17]Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. COCOON 2017: 504-515 - [c16]Akanksha Patel, Sundar Vishwanathan, Bhaskaran Raman:
Multi-channel allocation to coexisting networks in TV white spaces. COMSNETS 2017: 290-297 - [i12]Sagar Kale, Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. CoRR abs/1702.02559 (2017) - 2016
- [i11]Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. CoRR abs/1612.05419 (2016) - 2015
- [j23]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. Algorithmica 71(1): 219-231 (2015) - [j22]Ayush Choure, Sundar Vishwanathan:
On Graph Parameters Guaranteeing Fast Sandpile Diffusion. Electron. J. Comb. 22(1): 1 (2015) - [c15]Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan:
On Randomized Algorithms for Matching in the Online Preemptive Model. ESA 2015: 325-336 - [c14]Ashish Chiplunkar, Sundar Vishwanathan:
Approximating the Regular Graphic TSP in Near Linear Time. FSTTCS 2015: 125-135 - [c13]Sumedh Tirodkar, Sundar Vishwanathan:
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems. ISAAC 2015: 106-115 - 2014
- [i10]Ashish Chiplunkar, Sundar Vishwanathan:
Approximating Regular Graphic TSP in near linear time. CoRR abs/1404.2396 (2014) - [i9]Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan:
On Randomized Algorithms for Matching in the Online Preemptive Model. CoRR abs/1412.8615 (2014) - 2013
- [j21]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, chromatic number and online coloring. Comb. 33(3): 319-334 (2013) - [j20]Sundar Vishwanathan:
A counting proof of the Graham-Pollak Theorem. Discret. Math. 313(6): 765-766 (2013) - [c12]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. COCOON 2013: 481-492 - [c11]Ashish Chiplunkar, Sundar Vishwanathan:
On Randomized Memoryless Algorithms for the Weighted K-Server Problem. FOCS 2013: 11-19 - [i8]Ashish Chiplunkar, Sundar Vishwanathan:
On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem. CoRR abs/1301.0123 (2013) - 2012
- [c10]Ayush Choure, Sundar Vishwanathan:
Random walks, electric networks and the transience class problem of sandpiles. SODA 2012: 1593-1611 - [i7]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. CoRR abs/1206.5392 (2012) - [i6]Ayush Choure, Sundar Vishwanathan:
On graph parameters guaranteeing fast Sandpile diffusion. CoRR abs/1207.0421 (2012) - 2011
- [i5]Ayush Choure, Sundar Vishwanathan:
Random Walks, Electric Networks and The Transience Class problem of Sandpiles. CoRR abs/1105.3368 (2011) - 2010
- [j19]Sreyash Kenkre, Sundar Vishwanathan:
Approximation algorithms for the Bipartite Multicut problem. Inf. Process. Lett. 110(8-9): 282-287 (2010) - [c9]Sashank Jakkam Reddi, Sunita Sarawagi, Sundar Vishwanathan:
MAP estimation in Binary MRFs via Bipartite Multi-cuts. NIPS 2010: 955-963
2000 – 2009
- 2009
- [j18]Dhruv Mubayi, Sundar Vishwanathan:
Bipartite Coverings and the Chromatic Number. Electron. J. Comb. 16(1) (2009) - 2008
- [j17]Sreyash Kenkre, Sundar Vishwanathan:
The common prefix problem on trees. Inf. Process. Lett. 105(6): 245-248 (2008) - [j16]Sundar Vishwanathan:
A polynomial space proof of the Graham-Pollak theorem. J. Comb. Theory A 115(4): 674-676 (2008) - [j15]K. S. Sudeep, Sundar Vishwanathan:
Matched-Factor $d$-Domatic Coloring of Graphs. SIAM J. Discret. Math. 21(4): 1071-1082 (2008) - [j14]Sundar Vishwanathan:
On hard instances of approximate vertex cover. ACM Trans. Algorithms 5(1): 7:1-7:6 (2008) - [i4]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, Chromatic Number and Online Coloring. CoRR abs/0809.1710 (2008) - 2007
- [j13]K. S. Sudeep, Sundar Vishwanathan:
Some results in square-free and strong square-free edge-colorings of graphs. Discret. Math. 307(14): 1818-1824 (2007) - [j12]Sreyash Kenkre, Sundar Vishwanathan:
A bound on the chromatic number using the longest odd cycle length. J. Graph Theory 54(4): 267-276 (2007) - 2006
- [i3]Sreyash Kenkre, Sundar Vishwanathan:
Approximation Algorithms for the Bipartite Multi-cut Problem. CoRR abs/cs/0609031 (2006) - [i2]Sreyash Kenkre, Sundar Vishwanathan:
The Common Prefix Problem On Trees. CoRR abs/cs/0612060 (2006) - 2005
- [j11]K. S. Sudeep, Sundar Vishwanathan:
A technique for multicoloring triangle-free hexagonal graphs. Discret. Math. 300(1-3): 256-259 (2005) - 2004
- [j10]Sundar Vishwanathan:
An approximation algorithm for finding long paths in Hamiltonian graphs. J. Algorithms 50(2): 246-256 (2004) - 2003
- [j9]Sundar Vishwanathan:
On 2-coloring certain k-uniform hypergraphs. J. Comb. Theory A 101(1): 168-172 (2003) - 2001
- [j8]Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number. J. Algorithms 41(2): 404-416 (2001) - [i1]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan:
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem. CoRR cs.DM/0110031 (2001) - 2000
- [c8]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan:
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. FSTTCS 2000: 176-187 - [c7]Sundar Vishwanathan:
An approximation algorithm for finding a long path in Hamiltonian graphs. SODA 2000: 680-685
1990 – 1999
- 1999
- [j7]Arvind Sankar, Sundar Vishwanathan:
Multilinear Polynomials and a Conjecture of Frankl and Füredi. J. Comb. Theory A 86(1): 182-186 (1999) - 1998
- [j6]Rina Panigrahy, Sundar Vishwanathan:
An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. J. Algorithms 27(2): 259-268 (1998) - [j5]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28(2): 447-462 (1998) - 1997
- [c6]Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number. SODA 1997: 558-563 - 1996
- [c5]Sundar Vishwanathan:
An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. SODA 1996: 1-5 - 1995
- [j4]Barun Chandra, Sundar Vishwanathan:
Constructing Reliable Communication Networks of Small Weight Online. J. Algorithms 18(1): 159-175 (1995) - 1993
- [c4]Mario Szegedy, Sundar Vishwanathan:
Locality based graph coloring. STOC 1993: 201-207 - 1992
- [j3]Sundar Vishwanathan:
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. Inf. Process. Lett. 44(6): 297-302 (1992) - [j2]Sundar Vishwanathan:
Randomized Online Graph Coloring. J. Algorithms 13(4): 657-669 (1992) - 1991
- [j1]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SIAM J. Discret. Math. 4(2): 172-181 (1991) - [c3]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297 - 1990
- [c2]Sundar Vishwanathan:
Randomized Online Graph Coloring (Preliminary Version). FOCS 1990: 464-469 - [c1]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SODA 1990: 291-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
