Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
staff:kriege [2020-03-21 15:06] |
staff:kriege [2020-07-09 12:23] Nils Kriege [Publications] |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| {{ http://ls11-www.cs.tu-dortmund.de/people/kriege/kriege.jpg}} | {{ http://ls11-www.cs.tu-dortmund.de/people/kriege/kriege.jpg}} | ||
| ==== Nils Kriege ==== | ==== Nils Kriege ==== | ||
| + | |||
| + | <WRAP round 30% important> | ||
| + | I have moved to the \\ | ||
| + | [[https://univie.ac.at|University of Vienna]] | ||
| + | </WRAP> | ||
| | Room: | 233 | | | Room: | 233 | | ||
| Line 69: | Line 74: | ||
| == Betreute studentische Arbeiten == | == Betreute studentische Arbeiten == | ||
| + | * **Martin Rentz**: //Adaptive Color Refinement for Learning Graph Features//, Masterarbeit, 2020. | ||
| * **Marvin Büsscher**: //Klassische und numerische Verfahren zur Lösung von Assignment-Problemen//, Masterarbeit, 2020. | * **Marvin Büsscher**: //Klassische und numerische Verfahren zur Lösung von Assignment-Problemen//, Masterarbeit, 2020. | ||
| * **Franka Bause**: //Efficient Approximate k-Nearest-Neighbor-Search In Large Graph Databases//, Masterarbeit, 2020. | * **Franka Bause**: //Efficient Approximate k-Nearest-Neighbor-Search In Large Graph Databases//, Masterarbeit, 2020. | ||
| Line 107: | Line 113: | ||
| === Journal Articles === | === Journal Articles === | ||
| + | |||
| + | * **Classifying Dissemination Processes in Temporal Graphs**\\ Lutz Oettershagen, Nils M. Kriege, Christopher Morris, and Petra Mutzel \\ Big Data, 2020, accepted for publication. | ||
| + | |||
| * **[[http://dx.doi.org/10.7155/jgaa.00523|Maximum Cut Parameterized by Crossing Number]]** (Preprint [[https://arxiv.org/abs/1903.06061|arXiv:1903.06061]]) \\ Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover \\ Journal of Graph Algorithms and Applications (JGAA), vol. 24, no. 3, 155-170, 2020. | * **[[http://dx.doi.org/10.7155/jgaa.00523|Maximum Cut Parameterized by Crossing Number]]** (Preprint [[https://arxiv.org/abs/1903.06061|arXiv:1903.06061]]) \\ Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover \\ Journal of Graph Algorithms and Applications (JGAA), vol. 24, no. 3, 155-170, 2020. | ||