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.

Journal Article

Huang, Chien-Chung and Kavitha, Telikepalli and Michail, Dimitrios and Nasre, Meghana (2011) Bounded Unpopularity Matchings. In: Algorithmica, 61 (3). pp. 738-757.

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.

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.