Andre Droschinsky

14 papers A 1B 5C 1Journal 5
YearRankTypeTitle / Venue / Authors
2022 — ch.
Graph-Based Methods for Rational Drug Design.
Algorithms for Big Data
Andre Droschinsky, Lina Humbeck, Oliver Koch, Nils M. Kriege, Petra Mutzel, Till Schäfer
2021 — —
Tree comparison: enumeration and application to cheminformatics
Andre Droschinsky
2020 A conf
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach.
ALENEX
Andre Droschinsky, Petra Mutzel, Erik Thordsen
2019 C conf
On the Time Complexity of Simple Cartesian Genetic Programming.
IJCCI
Roman Kalkreuth, Andre Droschinsky
2018 J jnl
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.
CoRR
Nils M. Kriege, Andre Droschinsky, Petra Mutzel
2018 J jnl
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.
J. Graph Algorithms Appl.
Nils M. Kriege, Andre Droschinsky, Petra Mutzel
2018 B conf
Largest Weight Common Subtree Embeddings with Distance Penalties.
MFCS
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2018 J jnl
Largest Weight Common Subtree Embeddings with Distance Penalties.
CoRR
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2017 B conf
A New Subgraph Crossover for Cartesian Genetic Programming.
EuroGP
Roman Kalkreuth, Günter Rudolph, Andre Droschinsky
2017 B conf
Finding Largest Common Substructures of Molecules in Quadratic Time.
SOFSEM
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2016 B conf
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.
MFCS
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2016 J jnl
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.
CoRR
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2016 J jnl
Finding Largest Common Substructures of Molecules in Quadratic Time.
CoRR
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
2014 B conf
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.
ISAAC
Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel