Differences

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

--- teaching:2025winter:journalclub [2025/10/14 15:18]
jstoye [Schedule]
+++ teaching:2025winter:journalclub [2026/01/19 15:33] (current)
jstoye [Schedule]
@@ Line 11: / Line 11: @@
 | 13.10.2025 | Organization of the seminar | -- |
 | 20.10.2025 | (no class) | -- |
-| 27.10.2025 | [[https://doi.org/10.1007/BFb0062536|McKay: Computing automorphisms and canonical labellings of graphs]], Proceedings of the International Conference on Combinatorial Theory, LNM 686, 1978, pp. 223–232. | Jens S |
+| 27.10.2025 | [[https://doi.org/10.1007/BFb0062536|McKay: Computing automorphisms and canonical labellings of graphs]], Proceedings of the International Conference on Combinatorial Theory, LNM 686, 223–232, 1978. (See also [[https://users.cecs.anu.edu.au/~bdm/papers/pgi.pdf|McKay 1981]].) | Jens S |
-| 03.11.2025 | [[https://mathscinet.ams.org/mathscinet/article?mr=2513360 |Hartke & Radcliffe: McKay's canonical graph labeling algorithm]]. Contemp. Math 479 (Communicating mathematics), pp. 99–111. | Tizian S |
+| 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 | | Roland W |
+| 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 | | Andreas R |
+| 17.11.2025 | same paper, Sections 3-5 | 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|Shiloach: 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|Apostolico & Crochemore: Optimal canonization of all substrings of a string]], Information and Computation, Volume 95, Issue 1, 1991| Kamil H |
+| 15.12.2025 | (no class) | -- |
 | Winter break |||
-| 05.01.2026 | | |
+| 05.01.2026 | (no class) | -- |
-| 12.01.2026 | | |
+| 12.01.2026 | (ice) | -- |
-| 19.01.2026 | | |
+| 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