Dimitrios Michail - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Bounded Unpopularity MatchingsChien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre. algorithmica, 61(3):738-757, 2011. [doi]

New Approximation Algorithms for Minimum Cycle Bases of GraphsTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. algorithmica, 59(4):471-488, 2011. [doi]

2009

Cycle bases in graphs characterization, algorithms, complexity, and applicationsTelikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig. csr, 3(4):199-243, 2009. [doi]

Minimum cycle bases: Faster and simplerKurt Mehlhorn, Dimitrios Michail. talg, 6(1), 2009. [doi]

2008

Bounded Unpopularity MatchingsChien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre. swat 2008: 127-137 [doi]

An [(::::O::::)/tilde](::::m:::::::2:::::::n::::)/tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of GraphsTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. algorithmica, 52(3):333-349, 2008. [doi]

2007

2006

Rank-maximal matchingsRobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. talg, 2(4):602-610, 2006. [doi]

Implementing minimum cycle basis algorithmsKurt Mehlhorn, Dimitrios Michail. jea, 11, 2006. [doi]

2005

Implementing Minimum Cycle Basis AlgorithmsKurt Mehlhorn, Dimitrios Michail. wea 2005: 32-43 [doi]

2004