Dimitrios Michail Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4): 199-243 (2009)
2008
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. SWAT 2008: 127-137
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCraig 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)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios Michail: Reducing rank-maximal to maximum weight matching. Theor. Comput. Sci. 389(1-2): 125-132 (2007)
2006
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKurt Mehlhorn, Dimitrios Michail: Implementing minimum cycle basis algorithms. ACM Journal of Experimental Algorithmics 11: (2006)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. ACM Transactions on Algorithms 2(4): 602-610 (2006)
2005
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKurt Mehlhorn, Dimitrios Michail: Implementing Minimum Cycle Basis Algorithms. WEA 2005: 32-43
2004
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. SODA 2004: 68-75
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTelikepalli 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

Coauthor Index

1Craig Gotsman [8]
2Chien-Chung Huang [12]
3Robert W. Irving [2] [5]
4Kanela Kaligosi [8]
5Telikepalli Kavitha [1] [2] [3] [5] [9] [10] [11] [12] [13]
6Christian Liebchen [13]
7Kurt Mehlhorn [1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [13]
8Meghana Nasre [12]
9Katarzyna E. Paluch [1] [2] [3] [5] [9] [11]
10Evangelia Pyrga [8]
11Romeo Rizzi [13]
12Torsten Ueckerdt [13]
13Katharina A. Zweig [13]

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)