Differences

This shows you the differences between two versions of the page.

--- teaching:2025winter:journalclub [2025/11/03 13:13]
jstoye [Schedule]
+++ teaching:2025winter:journalclub [2025/11/25 11:17] (current)
luca [Schedule]
@@ Line 15: / Line 15: @@
 | 10.11.2025 | [[https://doi.org/10.1016/j.jsc.2013.09.003|McKay & Piperno: Practical graph isomorphism, II]] (Sections 1 & 2), Journal of Symbolic Computation 60, 94-112, 2014. | Roland W |
 | 17.11.2025 | [[https://doi.org/10.1016/j.jsc.2013.09.003|McKay & Piperno: Practical graph isomorphism, II]] (Sections 3-5), Journal of Symbolic Computation 60, 94-112, 2014. | Andreas R |
-| 24.11.2025 | | Luca P |
+| 24.11.2025 | [[https://doi.org/10.1145/3356020|Anderson & Merkle: A Generic Framework for Engineering Graph Canonization
-| 01.12.2025 | | Leonard B |
+Algorithms]]. Exp. Algorithmics 25, 1, Article 1.2, 2020. | Luca P |
-| 08.12.2025 | | |
+| 01.12.2025 | [[https://www.sciencedirect.com/science/article/pii/0196677481900134| Fast canonization of circular strings]], Journal of Algorithms, Volume 2, Issue 2, 1981,  | Leonard B |
-| 15.12.2025 | | |
+| 08.12.2025 | [[https://www.sciencedirect.com/science/article/pii/089054019190016U| Optimal canonization of all substrings of a string]], Information and Computation, Volume 95, Issue 1, 1991| Kamil H |
+| 15.12.2025 |[[https://www.sciencedirect.com/science/article/pii/S1570866717300175| Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences]], Journal of Discrete Algorithms, Volume 43, 2017| |
 | Winter break |||
 | 05.01.2026 | | |

Genome Informatics

Differences