Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:kriege [2019-11-14 08:33] |
staff:kriege [2019-11-25 09:53] |
||
|---|---|---|---|
| Line 126: | Line 126: | ||
| === Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
| - | * **Computing Optimal Assignments in Linear Time for Approximate Graph Matching** (Preprint [[https://arxiv.org/abs/1901.10356|arXiv:1901.10356]]) \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson \\ International Conference on Data Mining (ICDM) 2019, accepted for publication. | + | * **Computing Optimal Assignments in Linear Time for Approximate Graph Matching** (Preprint [[https://arxiv.org/abs/1901.10356|arXiv:1901.10356]], [[https://github.com/nlskrg/linear_time_assignments_for_graph_matching|Source code]]) \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson \\ International Conference on Data Mining (ICDM) 2019, accepted for publication. |
| * **[[https://doi.org/10.1007/978-3-030-32047-8_27|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** ([[https://doi.org/10.7287/peerj.preprints.26612v1|PeerJ Preprints, vol. 6, e26612v1]]) \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ International Conference on Similarity Search and Applications (SISAP) 2019, 308-322. | * **[[https://doi.org/10.1007/978-3-030-32047-8_27|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** ([[https://doi.org/10.7287/peerj.preprints.26612v1|PeerJ Preprints, vol. 6, e26612v1]]) \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ International Conference on Similarity Search and Applications (SISAP) 2019, 308-322. | ||