Differences

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

--- teaching:2025winter:journalclub [2026/01/11 18:51]
jstoye [Schedule]
+++ teaching:2025winter:journalclub [2026/01/19 15:33] (current)
jstoye [Schedule]
@@ Line 14: / Line 14: @@
 | 03.11.2025 | [[https://mathscinet.ams.org/mathscinet/article?mr=2513360 |Hartke & Radcliffe: McKay's canonical graph labeling algorithm]]. Contemp. Math 479 (Communicating mathematics), 99–111, 2009. [[https://www.math.unl.edu/~aradcliffe1/Papers/Canonical.pdf|(other link)]] | Tizian S |
 | 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 |
+| 17.11.2025 | same paper, Sections 3-5 | Andreas R |
 | 24.11.2025 | [[https://doi.org/10.1145/3356020|Anderson & Merkle: A Generic Framework for Engineering Graph Canonization
 Algorithms]]. Exp. Algorithmics 25, 1, Article 1.2, 2020. | Luca P |
@@ Line 24: / Line 24: @@
 | 12.01.2026 | (ice) | -- |
 | 19.01.2026 | [[https://www.sciencedirect.com/science/article/pii/S1570866717300175|Sawada & Williams: Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences]], Journal of Discrete Algorithms, Volume 43, 2017 | Roland W |
-| 26.01.2026 | | |
+| 26.01.2026 | same paper, Section 5 | Luca P |
-| 02.02.2026 | | |
+| 02.02.2026 | [[https://doi.org/10.1093/comjnl/29.2.171 | Pallo: Enumerating, ranking and unranking binary trees]], The Computer Journal, Volume 29, 1985| Jens S |

Genome Informatics

Differences