Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. - Andre Droschinsky; Bernhard Heinemann; Nils M. Kriege; Petra Mutzel (ISAAC, 2014)

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (MFCS, 2016)

A New Subgraph Crossover for Cartesian Genetic Programming. - Roman Kalkreuth; Günter Rudolph; Andre Droschinsky (EuroGP, 2017)

Finding Largest Common Substructures of Molecules in Quadratic Time. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (SOFSEM, 2017)

Largest Weight Common Subtree Embeddings with Distance Penalties. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (MFCS, 2018)

A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. - Nils M. Kriege; Andre Droschinsky; Petra Mutzel (J. Graph Algorithms Appl., 2018)

On the Time Complexity of Simple Cartesian Genetic Programming. - Roman Kalkreuth; Andre Droschinsky (IJCCI, 2019)

Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. - Andre Droschinsky; Petra Mutzel; Erik Thordsen (ALENEX, 2020)

Tree comparison: enumeration and application to cheminformatics - Andre Droschinsky (2021)

Graph-Based Methods for Rational Drug Design. - Andre Droschinsky; Lina Humbeck; Oliver Koch; Nils M. Kriege; Petra Mutzel; Till Schäfer (Algorithms for Big Data, 2022)