Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:kriege [2019-01-30 09:10] |
staff:kriege [2019-05-22 09:02] |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| ===== Teaching (in German) ===== | ===== Teaching (in German) ===== | ||
| == Lehrveranstaltung == | == Lehrveranstaltung == | ||
| + | * **Sommersemester 2019** | ||
| + | * [[teaching:dap2_ss19_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2019/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
| + | * Proseminar [[staff:mutzel:prosemgraphalg|Graphalgorithmen]] | ||
| * **Wintersemester 2018/19** | * **Wintersemester 2018/19** | ||
| * Übung zu [[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ws/rvs/index.html|Rechnernetze und verteilte Systeme]] | * Übung zu [[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ws/rvs/index.html|Rechnernetze und verteilte Systeme]] | ||
| Line 62: | 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 92: | Line 97: | ||
| === Preprints === | === Preprints === | ||
| + | * **[[https://arxiv.org/abs/1903.11835|A Survey on Graph Kernels]]** \\ Nils M. Kriege, Fredrik D. Johansson, Christopher Morris, ''arXiv:1903.11835''. | ||
| + | |||
| + | * **[[https://arxiv.org/abs/1903.06061|Maximum Cut Parameterized by Crossing Number]]** \\ Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover, ''arXiv:1903.06061''. | ||
| + | |||
| * **[[https://arxiv.org/abs/1901.10356|Computing Optimal Assignments in Linear Time for Graph Matching]]** \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson, ''arXiv:1901.10356''. | * **[[https://arxiv.org/abs/1901.10356|Computing Optimal Assignments in Linear Time for Graph Matching]]** \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson, ''arXiv:1901.10356''. | ||
| Line 99: | Line 108: | ||
| * **[[https://arxiv.org/abs/1703.00676|A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels]]** \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel, ''arXiv:1703.00676''. | * **[[https://arxiv.org/abs/1703.00676|A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels]]** \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel, ''arXiv:1703.00676''. | ||
| - | |||
| - | * **[[https://arxiv.org/abs/1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''arXiv:1612.05531''. | ||
| === 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, 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. | ||