Andre Droschinsky

Orcid: 0000-0002-7983-3739

According to our database1, Andre Droschinsky authored at least 10 papers between 2014 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Graph-Based Methods for Rational Drug Design.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021
Tree comparison: enumeration and application to cheminformatics
PhD thesis, 2021

2020
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
On the Time Complexity of Simple Cartesian Genetic Programming.
Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

2018
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.
J. Graph Algorithms Appl., 2018

Largest Weight Common Subtree Embeddings with Distance Penalties.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Finding Largest Common Substructures of Molecules in Quadratic Time.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

A New Subgraph Crossover for Cartesian Genetic Programming.
Proceedings of the Genetic Programming - 20th European Conference, 2017

2016
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2014
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014


  Loading...