| A new subgraph crossover for cartesian genetic programming R Kalkreuth, G Rudolph, A Droschinsky Genetic Programming: 20th European Conference, EuroGP 2017, Amsterdam, The …, 2017 | 33 | 2017 |
| Faster algorithms for the maximum common subtree isomorphism problem A Droschinsky, NM Kriege, P Mutzel arXiv preprint arXiv:1602.07210, 2016 | 16 | 2016 |
| Finding largest common substructures of molecules in quadratic time A Droschinsky, N Kriege, P Mutzel International Conference on Current Trends in Theory and Practice of …, 2017 | 13 | 2017 |
| Enumeration of maximum common subtree isomorphisms with polynomial-delay A Droschinsky, B Heinemann, N Kriege, P Mutzel International Symposium on Algorithms and Computation, 81-93, 2014 | 8 | 2014 |
| Shrinking trees not blossoms: A recursive maximum matching approach A Droschinsky, P Mutzel, E Thordsen 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020 | 7 | 2020 |
| Largest weight common subtree embeddings with distance penalties A Droschinsky, NM Kriege, P Mutzel arXiv preprint arXiv:1805.00821, 2018 | 7 | 2018 |
| On the Time Complexity of Simple Cartesian Genetic Programming. R Kalkreuth, A Droschinsky IJCCI, 172-179, 2019 | 5 | 2019 |
| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs NM Kriege, A Droschinsky, P Mutzel arXiv preprint arXiv:1805.10754, 2018 | 2 | 2018 |
| Effiziente Enumerationsalgorithmen für Common Subtree Probleme A Droschinsky Technische Universität Dortmund, Fakultät für Informatik, Algorithm …, 2014 | 2 | 2014 |
| Graph-Based Methods for Rational Drug Design. A Droschinsky, L Humbeck, O Koch, NM Kriege, P Mutzel, T Schäfer Algorithms for Big Data, 76-96, 2022 | | 2022 |
| Tree comparison: enumeration and application to cheminformatics A Droschinsky | | 2021 |
| Maximum Matching Problems: All Cavity Bipartite Matching and a Recursive Matching Approach A Droschinsky Technical report for Collaborative Research Center SFB 876 Providing …, 2019 | | 2019 |
| Computing and Enumerating Maximum Common Subgraph Isomorphisms in restricted graph classes A Droschinsky Technical report for Collaborative Research Center SFB 876 Providing …, 2015 | | 2015 |
| Enumerationsalgorithmen für Common Subtree Probleme A Droschinsky | | 2014 |
| ChipSim J Bergmann, J Bessai, A Droschinsky, O Jungeilges, A Kazmi, ... | | 2012 |
| Projektgruppe 562 ChipSim J Bergmann, J Bessai, A Droschinsky, O Jungeilges, A Kazmi, ... | | 2012 |
Petra MutzelProfessorin für Informatik, Universität BonnVerified email at cs.uni-bonn.de
