Benchmarks for Strictly Fundamental Cycle Bases. - Christian Liebchen; Gregor Wünsch; Ekkehard Köhler; Alexander Reich; Romeo Rizzi (WEA, 2007)

Minimum strictly fundamental cycle bases of planar graphs are hard to find. - Alexander Reich (Discret. Appl. Math., 2016)

Complexity of the maximum leaf spanning tree problem on planar and regular graphs. - Alexander Reich (Theor. Comput. Sci., 2016)

Classification of robust cycle bases and relations to fundamental cycle bases. - Alexander Reich (Art Discret. Appl. Math., 2018)

Reexamining the Efficacy of MetricGAN for Speech Enhancement. - Haibin Wu; Ali Aroudi; Buye Xu; Ashutosh Pandey 004; Francesco Nesta; Anurag Kumar 003; Alexander Reich; Ke Tan 001 (ICASSP, 2025)