| On weisfeiler-leman invariance: Subgraph counts and related graph properties V Arvind, F Fuhlbrück, J Köbler, O Verbitsky Journal of Computer and System Sciences 113, 42-59, 2020 | 112 | 2020 |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm F Fuhlbrück, J Köbler, O Verbitsky SIAM Journal on Discrete Mathematics 35 (3), 1792-1853, 2021 | 23 | 2021 |
| The Weisfeiler-Leman algorithm and recognition of graph properties F Fuhlbrück, J Köbler, I Ponomarenko, O Verbitsky Theoretical Computer Science 895, 96-114, 2021 | 8 | 2021 |
| The parameterized complexity of fixing number and vertex individualization in graphs V Arvind, F Fuhlbrueck, J Koebler, S Kuhnert, G Rattan ACM Transactions on Computation Theory (TOCT) 14 (2), 1-26, 2022 | 5* | 2022 |
| On the Weisfeiler-Leman dimension of fractional packing V Arvind, F Fuhlbrück, J Köbler, O Verbitsky Information and Computation 288, 104803, 2022 | 5 | 2022 |
| Local WL invariance and hidden shades of regularity F Fuhlbrück, J Köbler, O Verbitsky Discrete Applied Mathematics 305, 191-198, 2021 | 4 | 2021 |
| Fixed-parameter tractability of the graph isomorphism and canonization problems F Fuhlbrück Diploma thesis, Humboldt-Universität zu Berlin, 2013 | 4 | 2013 |
| Werkzeuge der empirischen Forschung R-Version W Kössler, F Fuhlbrück | | 2022 |
Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University Berlin在 informatik.hu-berlin.de 的电子邮件经过验证
