Search the dblp DataBase

Publications of Author

1. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
   A Faster Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (0, 0)][DBLP]
   ICALP, 2004, pp:846-857 [Conf]
   
2. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
   Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
   SODA, 2004, pp:68-75 [Conf]
   
3. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
   Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. [Citation Graph (0, 0)][DBLP]
   STACS, 2004, pp:222-233 [Conf]
   
4. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
   New Approximation Algorithms for Minimum Cycle Bases of Graphs. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:512-523 [Conf]
   
5. Kurt Mehlhorn, Dimitrios Michail
   Implementing Minimum Cycle Basis Algorithms. [Citation Graph (0, 0)][DBLP]
   WEA, 2005, pp:32-43 [Conf]
   
6. Kurt Mehlhorn, Dimitrios Michail
   Implementing minimum cycle basis algorithms. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
   
7. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
   Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:4, pp:602-610 [Journal]
   
8. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
   Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
   
9. 
   Bounded Unpopularity Matchings. [Citation Graph (, )][DBLP]
   
   
10. 
    An [(O)\tilde](m²n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Cycle bases of graphs and sampled manifolds. [Citation Graph (, )][DBLP]