- Minimum Cycle Basis, Algorithms and Applications. [pdf]
PhD thesis, Max-Planck Institut für Informatik, Universität des Saarlandes, 2006.
|
Χειρόγραφα ή Τεχνικές Αναφορές
- with C-C. Huang, T. Kavitha, and M. Nasre.
Bounded Unpopularity Matchings
Submitted to Algorithmica. [pdf]
|
Περιοδικά
- with Kurt Mehlhorn.
Minimum Cycle Bases: Faster and Simpler
ACM Transactions on Algorithms, 6(1): 2009 [pdf]
- with T.Kavitha and K. Mehlhorn.
New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Algorithmica. [web]
- with T. Kavitha, C. Liebchen, K. Mehlhorn, R. Rizzi, T. Ueckerdt, and K. A. Zweig.
Cycle bases in graphs: Characterization, Algorithms, Complexity, and Applications.
Computer Science Review, 3(4): 199-243, 2009.
- with T. Kavitha, K. Mehlhorn, and K. Paluch.
An O(m2nlogn) Algorithm for Minimum Cycle Basis of Graphs
Algorithmica, 52(3): 333-349, 2008. [web]
- Reducing Rank-Maximal to Maximum Weight Matching
Theoretical Computer Science, 389(1-2): 125-132, 2007. [ps.gz, pdf, web]
- with C. Gotsman, K. Kaligosi, K. Mehlhorn, and E. Pyrga.
Cycle Bases of Graphs and Sampled Manifolds.
Computer Aided Geometric Design, 24(8-9):464-480, 2007.
Special issue: Discrete Differential Geometry [ps.gz, pdf, web]
- with T. Kavitha, K. Mehlhorn, and K. Paluch.
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents problem. [ps.gz, pdf, web]
ACM Transactions on Algorithms, 3(2), 2007.
- with K. Mehlhorn.
Implementing Minimum Cycle Basis Algorithms. [ps.gz, pdf, web]
ACM Journal of Experimental Algorithmics, 11(2):1-14, 2006.
- with R. Irving, T. Kavitha, K. Mehlhorn, and K. Paluch.
Rank-maximal Matchings. [ps.gz, pdf, web]
ACM Transactions on Algorithms, 2(4):602-610, 2006.
|
Συνέδρια (με κρίση)
- with C-C. Huang, T. Kavitha, and M. Nasre.
Bounded Unpopularity Matchings [ps.gz, pdf, web]
In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08).
- with T. Kavitha, and K. Mehlhorn.
New Approximation Algorithms for Minimum Cycle Bases of Graphs. [ps.gz, pdf, web]
In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07).
- with K. Mehlhorn.
Implementing Minimum Cycle Basis Algorithms. [ps.gz, pdf, web]
In Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05).
- with T. Kavitha, K. Mehlhorn, and K. Paluch.
A Faster Algorithm for Minimum Cycle Basis of Graphs. [ps.gz, pdf, web]
In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04).
- with T. Kavitha, K. Mehlhorn, and K. Paluch.
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents problem. [ps.gz, pdf, web]
In Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS'2004).
- with R. Irving, T. Kavitha, K. Mehlhorn, and K. Paluch.
Rank-maximal Matchings. [ps.gz, pdf, web]
In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04).
|
|
|
