Sundar Vishwanathan

Available identifiers

zbMath Open vishwanathan.sundarMaRDI QIDQ879398

List of research outcomes

Publication	Date of Publication	Type
Improved bounds for covering hypergraphs	2022-08-26	Paper
Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems	2021-12-16	Paper
Multicovering hypergraphs	2021-04-28	Paper
A coding perspective on the lower bound for diagonal Ramsey numbers	2021-04-27	Paper
Maximum matching on trees in the online preemptive and the incremental graph models	2019-10-17	Paper
Bounds for the Graham-Pollak theorem for hypergraphs	2019-09-11	Paper
Random Walks, Electric Networks and The Transience Class problem of Sandpiles	2019-05-10	Paper
On hard instances of approximate vertex cover	2018-11-05	Paper
On the approximability of the minimum rainbow subgraph problem and other related problems	2017-11-09	Paper
Maximum matching on trees in the online preemptive and the incremental dynamic graph models	2017-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q5275362	2017-07-13	Paper
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems	2016-01-11	Paper
On Randomized Algorithms for Matching in the Online Preemptive Model	2015-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q5501834	2015-08-14	Paper
Locality based graph coloring	2015-05-07	Paper
On graph parameters guaranteeing fast sandpile diffusion	2015-03-11	Paper
Metrical service systems with multiple servers	2015-03-02	Paper
Circumference, chromatic number and online coloring	2014-03-17	Paper
Metrical Service Systems with Multiple Servers	2013-06-11	Paper
A counting proof of the Graham-Pollak theorem	2013-03-19	Paper
Improved bounds on the sandpile diffusions on Grid graphs	2012-10-16	Paper
Approximation algorithms for the Bipartite Multicut problem	2010-09-07	Paper
Bipartite coverings and the chromatic number	2010-03-26	Paper
The common prefix problem on trees	2010-03-24	Paper
Matched-Factor d-Domatic Coloring of Graphs	2008-12-05	Paper
A polynomial space proof of the Graham-Pollak theorem	2008-05-13	Paper
Some results in square-free and strong square-free edge-colorings of graphs	2007-05-11	Paper
A bound on the chromatic number using the longest odd cycle length	2007-05-11	Paper
A technique for multicoloring triangle-free hexagonal graphs	2005-10-26	Paper
An approximation algorithm for finding long paths in Hamiltonian graphs	2004-10-01	Paper
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem	2004-08-04	Paper
On 2-coloring certain \(k\)-uniform hypergraphs	2003-03-26	Paper
Approximation Algorithms for the Achromatic Number	2002-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4952685	2001-03-12	Paper
Multilinear polynomials and a conjecture of Frankl and Füredi	1999-07-07	Paper
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem	1998-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4875162	1996-11-26	Paper
Constructing Reliable Communication Networks of Small Weight Online	1995-04-09	Paper
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two	1993-05-16	Paper
Randomized online graph coloring	1993-01-12	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sundar Vishwanathan