| Congestion-free rerouting of flows on dags SA Amiri, S Dudycz, S Schmid, S Wiederrecht arXiv preprint arXiv:1611.09296, 2016 | 42 | 2016 |
| Killing a vortex DM Thilikos, S Wiederrecht Journal of the ACM 71 (4), 1-56, 2024 | 23 | 2024 |
| Cyclewidth and the grid theorem for perfect matching width of bipartite graphs M Hatzel, R Rabinovich, S Wiederrecht International Workshop on Graph-Theoretic Concepts in Computer Science, 53-65, 2019 | 22 | 2019 |
| Parameterized algorithms for directed modular width R Steiner, S Wiederrecht Conference on Algorithms and Discrete Applied Mathematics, 415-426, 2020 | 21 | 2020 |
| Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star C Dallard, M Krnc, O Kwon, M Milanič, A Munaro, K Štorgel, ... arXiv preprint arXiv:2402.11222, 2024 | 18 | 2024 |
| Colouring non-even digraphs MG Millani, R Steiner, S Wiederrecht arXiv preprint arXiv:1903.02872, 2019 | 16* | 2019 |
| Digraphs of directed treewidth one S Wiederrecht Discrete Mathematics 343 (12), 112124, 2020 | 11* | 2020 |
| Excluding a planar matching minor in bipartite graphs AC Giannopoulou, S Kreutzer, S Wiederrecht Journal of Combinatorial Theory, Series B 164, 161-221, 2024 | 10 | 2024 |
| Kernelization for graph packing problems via rainbow matching S Bessy, M Bougeret, DM Thilikos, S Wiederrecht Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 10 | 2023 |
| Approximating branchwidth on parametric extensions of planarity DM Thilikos, S Wiederrecht International Workshop on Graph-Theoretic Concepts in Computer Science, 460-474, 2024 | 9 | 2024 |
| On polynomial-time congestion-free software-defined network updates SA Amiri, S Dudycz, M Parham, S Schmid, S Wiederrecht 2019 IFIP Networking Conference (IFIP Networking), 1-9, 2019 | 9 | 2019 |
| Obstructions to Erdös-Pósa Dualities for Minors C Paul, E Protopapas, DM Thilikos, S Wiederrecht 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 31-52, 2024 | 8 | 2024 |
| Matching theory and Barnette's conjecture M Gorsky, R Steiner, S Wiederrecht Discrete Mathematics 346 (2), 113249, 2023 | 8 | 2023 |
| Directed width parameters on semicomplete digraphs F Gurski, D Komander, C Rehs, S Wiederrecht International Conference on Combinatorial Optimization and Applications, 615-628, 2021 | 8 | 2021 |
| Treewidth, Hadwiger Number, and Induced Minors R Campbell, J Davies, M Distel, B Frederickson, JP Gollin, K Hendrey, ... arXiv preprint arXiv:2410.19295, 2024 | 7 | 2024 |
| Excluding surfaces as minors in graphs DM Thilikos, S Wiederrecht arXiv preprint arXiv:2306.01724, 2023 | 7 | 2023 |
| On chordal graph and line graph squares R Scheidweiler, S Wiederrecht Discrete Applied Mathematics 243, 239-247, 2018 | 7 | 2018 |
| Polynomial Bounds for the Graph Minor Structure Theorem M Gorsky, MT Seweryn, S Wiederrecht arXiv preprint arXiv:2504.02532, 2025 | 6 | 2025 |
| Excluding an induced wheel minor in graphs without large induced stars M Choi, C Hilaire, M Milanič, S Wiederrecht International Workshop on Graph-Theoretic Concepts in Computer Science, 135-148, 2025 | 5 | 2025 |
| Matching minors in bipartite graphs S Wiederrecht Universitätsverlag der Technischen Universität Berlin, 2022 | 5 | 2022 |
Dimitrios M. ThilikosNational and Kapodistrian University of AthensVerified email at thilikos.info
