default search action
Andre Droschinsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [p1]Andre Droschinsky
, Lina Humbeck
Graph-Based Methods for Rational Drug Design. Algorithms for Big Data 2022: 76-96 - 2021
- [b1]Andre Droschinsky:
Tree comparison: enumeration and application to cheminformatics. Dortmund University, Germany, 2021 - 2020
- [c7]Andre Droschinsky, Petra Mutzel
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. ALENEX 2020: 146-160
2010 – 2019
- 2019
- [c6]Roman Kalkreuth
On the Time Complexity of Simple Cartesian Genetic Programming. IJCCI 2019: 172-179 - 2018
- [j1]Nils M. Kriege
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. J. Graph Algorithms Appl. 22(4): 607-616 (2018) - [c5]Andre Droschinsky, Nils M. Kriege
Largest Weight Common Subtree Embeddings with Distance Penalties. MFCS 2018: 54:1-54:15 - [i4]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. CoRR abs/1805.00821 (2018) - [i3]Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. CoRR abs/1805.10754 (2018) - 2017
- [c4]Roman Kalkreuth, Günter Rudolph, Andre Droschinsky:
A New Subgraph Crossover for Cartesian Genetic Programming. EuroGP 2017: 294-310 - [c3]Andre Droschinsky, Nils M. Kriege
Finding Largest Common Substructures of Molecules in Quadratic Time. SOFSEM 2017: 309-321 - 2016
- [c2]Andre Droschinsky, Nils M. Kriege
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. MFCS 2016: 33:1-33:14 - [i2]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. CoRR abs/1602.07210 (2016) - [i1]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. CoRR abs/1610.08739 (2016) - 2014
- [c1]Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: