
Search the dblp DataBase
Dimitrios Michail:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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:846857 [Conf]
 Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Rankmaximal matchings. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:6875 [Conf]
 Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Strongly Stable Matchings in Time O(nm) and Extension to the HospitalsResidents Problem. [Citation Graph (0, 0)][DBLP] STACS, 2004, pp:222233 [Conf]
 Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
New Approximation Algorithms for Minimum Cycle Bases of Graphs. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:512523 [Conf]
 Kurt Mehlhorn, Dimitrios Michail
Implementing Minimum Cycle Basis Algorithms. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:3243 [Conf]
 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]
 Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Rankmaximal matchings. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:4, pp:602610 [Journal]
 Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Strongly stable matchings in time O(nm) and extension to the hospitalsresidents problem. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:2, pp: [Journal]
Bounded Unpopularity Matchings. [Citation Graph (, )][DBLP]
An [(O)\tilde](m^{2}n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (, )][DBLP]
Cycle bases of graphs and sampled manifolds. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
