Andre Droschinsky
From MaRDI portal
Person:2942615
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Largest Weight Common Subtree Embeddings with Distance Penalties (available as arXiv preprint) | 2021-08-04 | Paper |
| Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs Journal of Graph Algorithms and Applications | 2019-01-18 | Paper |
| Faster algorithms for the maximum common subtree isomorphism problem (available as arXiv preprint) | 2018-03-21 | Paper |
| Finding largest common substructures of molecules in quadratic time SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
| Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay Algorithms and Computation | 2015-09-11 | Paper |
Research outcomes over time
This page was built for person: Andre Droschinsky
