Differences
This shows you the differences between two versions of the page.
staff:mutzel [2019-08-11 11:01] |
staff:mutzel [2019-08-11 11:02] |
||
---|---|---|---|
Line 98: | Line 98: | ||
* A unifying view of explicit and implicit feature maps of graph kernels \\ //Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, and Petra Mutzel // \\ Data Mining and Knowledge Discovery, 2019, to appear | * A unifying view of explicit and implicit feature maps of graph kernels \\ //Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, and Petra Mutzel // \\ Data Mining and Knowledge Discovery, 2019, to appear | ||
- | * **[[http://arxiv.org/abs/1904-11965|Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs]]** \\ // Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, and Tobias Stollenwerk// \\ CoRR abs/1904-11965 | + | * **[[http://arxiv.org/abs/1904-11965|Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs]]** \\ // Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, and Tobias Stollenwerk// \\ CoRR abs/1904-11965, 2019 |
* **[[https://doi.org/10.4230/LIPIcs.STACS.2019.3|Algorithmic Data Science (Invited Talk)]]** \\ // Petra Mutzel // \\ 36th International Symposium on Theoretical Aspects of Computer Science, (STACS) 2019, Eds. R. Niedermeier and C. Paul, LIPIcs vol. 126, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 3:1--3:15, 2019 | * **[[https://doi.org/10.4230/LIPIcs.STACS.2019.3|Algorithmic Data Science (Invited Talk)]]** \\ // Petra Mutzel // \\ 36th International Symposium on Theoretical Aspects of Computer Science, (STACS) 2019, Eds. R. Niedermeier and C. Paul, LIPIcs vol. 126, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 3:1--3:15, 2019 | ||
- | * **[[http://arxiv.org/abs/1904.01543|Towards a practical k-dimensional Weisfeiler-Leman algorithm]]** \\ // Christopher Morris, Petra Mutzel // \\ CoRR abs/1904.01543 | + | * **[[http://arxiv.org/abs/1904.01543|Towards a practical k-dimensional Weisfeiler-Leman algorithm]]** \\ // Christopher Morris, Petra Mutzel // \\ CoRR abs/1904.01543, 2019 |
- | * **[[http://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 // \\ CoRR abs-1904-11965 | + | * **[[http://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 // \\ CoRR abs-1904-11965, 2019 |
* **[[https://epubs.siam.org/doi/abs/10.1137/17M1147974?af=R|Bishellable drawings of Kn]]** \\ //Bernardo M. Abrego, Oswin Aichholzer, Silvia Fernandez-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber // \\ SIAM Journal on Discrete Mathematics, vol. 32, no. 4, 482–2492, 2018 (preprint see [[http://arxiv.org/abs/1510.00549 | CoRR abs/1510.00549]]) | * **[[https://epubs.siam.org/doi/abs/10.1137/17M1147974?af=R|Bishellable drawings of Kn]]** \\ //Bernardo M. Abrego, Oswin Aichholzer, Silvia Fernandez-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber // \\ SIAM Journal on Discrete Mathematics, vol. 32, no. 4, 482–2492, 2018 (preprint see [[http://arxiv.org/abs/1510.00549 | CoRR abs/1510.00549]]) |