I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Droschinsky, Andre
11
results:
Search for persons
X
Format
Online (11)
Mediatypes
Articles (Online) (1)
Bookchapter (Online) (1)
OpenAccess-fulltext (8)
Thesis (Online) (1)
Languages
english (5)
german (1)
Sorted by: Relevance
Sorted by: Year
?
1
Graph-Based Methods for Rational Drug Design:
, In:
Lecture Notes in Computer Science; Algorithms for Big Data
,
Droschinsky, Andre
;
Humbeck, Lina
;
Koch, Oliver
... - p. 76-96 , 2022
Link:
https://doi.org/10.1007/..
?
2
Tree comparison: enumeration and application to cheminforma..:
Droschinsky, Andre
, 2021
Link:
https://nbn-resolving.de..
?
3
A note on block-and-bridge preserving maximum common subgra..:
Kriege, Nils M.
;
Droschinsky, Andre
;
Mutzel, Petra
Journal of Graph Algorithms and Applications. 22 (2018) 4 - p. 607-616 , 2018
Link:
https://doi.org/10.7155/..
?
4
Tree comparison: enumeration and application to cheminforma..:
Droschinsky, Andre
http://hdl.handle.net/2003/40609. , 2021
Link:
http://hdl.handle.net/20..
?
5
Largest Weight Common Subtree Embeddings with Distance Pena..:
Droschinsky, Andre
;
Kriege, Nils M
;
Mutzel, Petra
http://arxiv.org/abs/1805.00821. , 2018
Link:
http://arxiv.org/abs/180..
?
6
Largest Weight Common Subtree Embeddings with Distance Pena..:
Droschinsky, Andre
;
Kriege, Nils M
;
Mutzel, Petra
doi:10.4230/LIPIcs.MFCS.2018.54. , 2018
Link:
https://doi.org/10.4230/..
?
7
A note on block-and-bridge preserving maximum common subgra..:
Kriege, Nils M
;
Droschinsky, Andre
;
Mutzel, Petra
http://arxiv.org/abs/1805.10754. , 2018
Link:
http://arxiv.org/abs/180..
?
8
Finding Largest Common Substructures of Molecules in Quadra..:
Droschinsky, Andre
;
Kriege, Nils
;
Mutzel, Petra
http://arxiv.org/abs/1610.08739. , 2016
Link:
http://arxiv.org/abs/161..
?
9
Faster Algorithms for the Maximum Common Subtree Isomorphis..:
Droschinsky, Andre
;
Kriege, Nils M
;
Mutzel, Petra
doi:10.4230/LIPIcs.MFCS.2016.33. , 2016
Link:
https://doi.org/10.4230/..
?
10
Faster Algorithms for the Maximum Common Subtree Isomorphis..:
Droschinsky, Andre
;
Kriege, Nils M
;
Mutzel, Petra
http://arxiv.org/abs/1602.07210. , 2016
Link:
http://arxiv.org/abs/160..
?
11
ChipSim:
Bergmann, Jim
;
Bessai, Jan
;
Droschinsky, Andre
...
http://hdl.handle.net/2003/29827. , 2012
Link:
http://hdl.handle.net/20..
1-11