Browse by Author

Conference Paper

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2007) New approximation algorithms for minimum cycle bases of graphs. In: 24th Annual Symposium on Theoretical Aspects of Computer Science, FEB 22-24, 2007, Aachen.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2006) A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: 33rd ICALP 2006, 10 July 2006, Venice, Italy, pp. 250-261.

Journal Article

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2011) New Approximation Algorithms for Minimum Cycle Bases of Graphs. In: Algorithmica, 59 (4). pp. 471-488.

Baswana, Surender and Kavitha, Telikepalli and Mehlhorn, Kurt and Pettie, Seth (2011) Additive Spanners and (alpha, beta)-Spanners. In: ACM Transactions on Algorithms, 7 (1).

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E (2008) An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs. In: Algorithmica, 52 (3). pp. 333-349.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2008) Faster Algorithms for Minimum Cycle Basis in Directed Graphs. In: SIAM JOURNAL ON COMPUTING, 38 (4). pp. 1430-1447.

Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Algorithms to Compute Minimum Cycle Basis in Directed Graphs. In: Theory of Computing Systems, 40 (4). pp. 485-505.

Abraham, David J and Irving, Robert W and Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Popular Matchings. In: SIAM Journal on Computing, 37 (4). pp. 1030-1045.