Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:kriege [2018-08-16 10:15] |
staff:kriege [2018-09-18 10:59] |
||
---|---|---|---|
Line 111: | Line 111: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
- | * **Largest Weight Common Subtree Embeddings with Distance Penalties** (Preprint [[https://arxiv.org/abs/1805.00821|arXiv:1805.00821]]) \\ Andre Droschinsky, Nils M. Kriege, Petra Mutzel \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, accepted. | + | * **[[http://dx.doi.org/10.4230/LIPIcs.MFCS.2018.54|Largest Weight Common Subtree Embeddings with Distance Penalties]]** (Preprint [[https://arxiv.org/abs/1805.00821|arXiv:1805.00821]]) \\ Andre Droschinsky, Nils M. Kriege, Petra Mutzel \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, accepted. |
* **[[https://doi.org/10.24963/ijcai.2018/325|A Property Testing Framework for the Theoretical Expressivity of Graph Kernels]]** \\ Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler \\ International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI-ECAI) 2018, 2348-2354. | * **[[https://doi.org/10.24963/ijcai.2018/325|A Property Testing Framework for the Theoretical Expressivity of Graph Kernels]]** \\ Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler \\ International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI-ECAI) 2018, 2348-2354. |