Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:kriege [2019-04-08 11:51]
Nils Kriege [Teaching (in German)]
staff:kriege [2019-05-22 09:02] (current)
Nils Kriege [Teaching (in German)]
Line 65: Line 65:
  
 == Betreute studentische Arbeiten == == Betreute studentische Arbeiten ==
 +  * **Frederik Stehli**: //​Approximation des Optimal Assignment Kernels durch explizite Merkmalsvektoren//,​ Bachelorarbeit,​ 2019.
 +  * **Dmytro Semenchenko**:​ //​Approximating the Graph Edit Distance via Deep Learning//, Bachelorarbeit,​ 2019.
   * **Mohamad Reza Nirumand Alankesh**: //Extending SplineCNN by Structural Graph Features for Cheminformatics//,​ Bachelorarbeit,​ 2018.   * **Mohamad Reza Nirumand Alankesh**: //Extending SplineCNN by Structural Graph Features for Cheminformatics//,​ Bachelorarbeit,​ 2018.
   * **Robert Gehde**: //​Erweiterung von Pharmakophor-basierten Fingerprints mittels Randomisierung//,​ Bachelorarbeit,​ 2018.   * **Robert Gehde**: //​Erweiterung von Pharmakophor-basierten Fingerprints mittels Randomisierung//,​ Bachelorarbeit,​ 2018.
Line 109: Line 111:
  
 === Journal Articles === === Journal Articles ===
-  * **[[https://​doi.org/​10.1007/​s00453-019-00552-1|A general purpose algorithm for counting simple cycles and simple paths of any length]]** (Preprint [[https://​arxiv.org/​abs/​1612.05531|arXiv:​1612.05531]]) \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson \\ Algorithmica,​ 2019.+  * **[[https://​doi.org/​10.1007/​s00453-019-00552-1|A general purpose algorithm for counting simple cycles and simple paths of any length]]** (Preprint [[https://​arxiv.org/​abs/​1612.05531|arXiv:​1612.05531]]) \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson \\ Algorithmica, vol. 81, no. 7, 2716-2737, 2019.
  
   * **[[http://​dx.doi.org/​10.7155/​jgaa.00480|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** (Preprint [[https://​arxiv.org/​abs/​1805.10754|arXiv:​1805.10754]]) \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Journal of Graph Algorithms and Applications (JGAA), vol. 22, no. 4, 607-616, 2018.   * **[[http://​dx.doi.org/​10.7155/​jgaa.00480|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** (Preprint [[https://​arxiv.org/​abs/​1805.10754|arXiv:​1805.10754]]) \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Journal of Graph Algorithms and Applications (JGAA), vol. 22, no. 4, 607-616, 2018.
 
Last modified: 2019-04-08 11:51 by Nils Kriege
DokuWikiRSS-Feed