Items where Author is "Telikepalli, Kavitha"Group by: Item Type | No Grouping Jump to: Conference or Workshop Item Number of items: 3. Conference or Workshop ItemBhalgat, Anand ; Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigra, Debmalya (2008) Fast edge splitting and Edmonds' arborescence construction for unweighted graphs In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 20-22, 2008, San Francisco, California. Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigrahi, Debmalya (2007) Efficient algorithms for computing all low s-t edge connectivities and related problems In: SODA '07 Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 07-09, 2007, New Orleans, Louisiana. Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigrahi, Debmalya ; Bhalgat, Anand (2007) An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs In: STOC '07 Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, June 11-13, 2007, San Diego, California, USA. |

Up a level