Kavitha Telikepalli

Telikepalli Kavitha

Information about the author Telikepalli Kavitha will soon be added to the site.
Found 4 papers in total
Faster Algorithms for All‐Pairs Small Stretch Distances in Weighted Graphs
Faster Algorithms for All‐Pairs Small Stretch Distances in Weighted Graphs
2012
Let G =( V , E ) be a weighted undirected graph, with non‐negative edge...
Bounded Unpopularity Matchings
Bounded Unpopularity Matchings
2011
We investigate the following problem: given a set of jobs and a set of people with...
New Approximation Algorithms for Minimum Cycle Bases of Graphs
New Approximation Algorithms for Minimum Cycle Bases of Graphs
2011
We consider the problem of computing an approximate minimum cycle basis of an...
Assigning papers to referees
Assigning papers to referees
2010
Refereed conferences require every submission to be reviewed by members of a program...
Papers per page: