2008 |
12 | EE | Chien-Chung Huang,
Telikepalli Kavitha,
Dimitrios Michail,
Meghana Nasre:
Bounded Unpopularity Matchings.
SWAT 2008: 127-137 |
11 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
Algorithmica 52(3): 333-349 (2008) |
2007 |
10 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs.
STACS 2007: 512-523 |
9 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem.
ACM Transactions on Algorithms 3(2): (2007) |
8 | EE | Craig Gotsman,
Kanela Kaligosi,
Kurt Mehlhorn,
Dimitrios Michail,
Evangelia Pyrga:
Cycle bases of graphs and sampled manifolds.
Computer Aided Geometric Design 24(8-9): 464-480 (2007) |
7 | EE | Dimitrios Michail:
Reducing rank-maximal to maximum weight matching.
Theor. Comput. Sci. 389(1-2): 125-132 (2007) |
2006 |
6 | EE | Kurt Mehlhorn,
Dimitrios Michail:
Implementing minimum cycle basis algorithms.
ACM Journal of Experimental Algorithmics 11: (2006) |
5 | EE | Robert W. Irving,
Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
Rank-maximal matchings.
ACM Transactions on Algorithms 2(4): 602-610 (2006) |
2005 |
4 | EE | Kurt Mehlhorn,
Dimitrios Michail:
Implementing Minimum Cycle Basis Algorithms.
WEA 2005: 32-43 |
2004 |
3 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
A Faster Algorithm for Minimum Cycle Basis of Graphs.
ICALP 2004: 846-857 |
2 | EE | Robert W. Irving,
Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
Rank-maximal matchings.
SODA 2004: 68-75 |
1 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.
STACS 2004: 222-233 |