Differences
This shows you the differences between two versions of the page.
|
staff:morris [2019-02-15 22:18] |
staff:morris [2019-03-06 22:21] |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| * Machine learning with graphs, | * Machine learning with graphs, | ||
| - | * Algorithm Engineering, Algorithmic Data Analysis | + | * Combinatorial optimization and graph algorithms, |
| - | * Combinatorial optimization and graph algorithms | + | * Machine Learning for combinatorial optimization |
| Line 69: | Line 69: | ||
| * Franka Bause (BT, 2017): //Approximation der Editierdistanz für Graphen in linearer Zeit// | * Franka Bause (BT, 2017): //Approximation der Editierdistanz für Graphen in linearer Zeit// | ||
| * Ryan Ladwig (Student intern from [[http://www.nau.edu|NAU]], 2017): //Design and Implementation of k-disk Graph Kernels// | * Ryan Ladwig (Student intern from [[http://www.nau.edu|NAU]], 2017): //Design and Implementation of k-disk Graph Kernels// | ||
| - | * Jannis Junge (MT, 2018): //Approximation des Graphenspektrums// | + | * Jannis Junge (MT, 2018): //Algorithm Engineering zur Approximation des Spektrums von Graphen in der Praxis// |
| * Marcel Walker (MT, 2018): //Systematisierung von neuronalen Netzen auf Graphen// | * Marcel Walker (MT, 2018): //Systematisierung von neuronalen Netzen auf Graphen// | ||
| * Nina Runde (BT, 2018): //Evaluation von Varianten des $k$-dimensionalen Weisfeiler-Leman Algorithmus // | * Nina Runde (BT, 2018): //Evaluation von Varianten des $k$-dimensionalen Weisfeiler-Leman Algorithmus // | ||