| 2008 |
|---|
| 10 | 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 |
|---|
| 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) |
| 2006 |
|---|
| 8 | EE | Katarzyna E. Paluch:
A New Approximation Algorithm for Multidimensional Rectangle Tiling.
ISAAC 2006: 712-721 |
| 7 | 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) |
| 2004 |
|---|
| 6 | EE | Katarzyna E. Paluch:
A 2(1/8)-Approximation Algorithm for Rectangle Tiling.
ICALP 2004: 1054-1065 |
| 5 | EE | Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
A Faster Algorithm for Minimum Cycle Basis of Graphs.
ICALP 2004: 846-857 |
| 4 | EE | Robert W. Irving,
Telikepalli Kavitha,
Kurt Mehlhorn,
Dimitrios Michail,
Katarzyna E. Paluch:
Rank-maximal matchings.
SODA 2004: 68-75 |
| 3 | 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 |
| 2003 |
|---|
| 2 | EE | Krzysztof Lorys,
Katarzyna E. Paluch:
New approximation algorithm for RTILE problem.
Theor. Comput. Sci. 2-3(303): 517-537 (2003) |
| 2000 |
|---|
| 1 | EE | Krzysztof Lorys,
Katarzyna E. Paluch:
Rectangle tiling.
APPROX 2000: 206-213 |
