Follow
Sebastian Wiederrecht
Sebastian Wiederrecht
PostDoc at DIMAG, IBS, Daejeon
Verified email at tu-berlin.de
Title
Cited by
Cited by
Year
Congestion-free rerouting of flows on dags
SA Amiri, S Dudycz, S Schmid, S Wiederrecht
arXiv preprint arXiv:1611.09296, 2016
402016
Colouring non-even digraphs
MG Millani, R Steiner, S Wiederrecht
arXiv preprint arXiv:1903.02872, 2019
16*2019
Parameterized algorithms for directed modular width
R Steiner, S Wiederrecht
Conference on Algorithms and Discrete Applied Mathematics, 415-426, 2020
152020
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
M Hatzel, R Rabinovich, S Wiederrecht
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
132019
Digraphs of directed treewidth one
S Wiederrecht
Discrete Mathematics 343 (12), 112124, 2020
8*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
62024
Killing a vortex
DM Thilikos, S Wiederrecht
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
62022
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
62019
Approximating branchwidth on parametric extensions of planarity
DM Thilikos, S Wiederrecht
arXiv preprint arXiv:2304.04517, 2023
52023
On chordal graph and line graph squares
R Scheidweiler, S Wiederrecht
Discrete Applied Mathematics 243, 239-247, 2018
52018
Two disjoint alternating paths in bipartite graphs
AC Giannopoulou, S Wiederrecht
arXiv preprint arXiv:2110.02013, 2021
42021
A Flat Wall Theorem for Matching Minors in Bipartite Graphs
AC Giannopoulou, S Wiederrecht
arXiv preprint arXiv:2110.07553, 2021
3*2021
Braces of perfect matching width 2
AC Giannopoulou, M Hatzel, S Wiederrecht
arXiv preprint arXiv:1902.06307, 2019
32019
Matching theory and Barnette's conjecture
M Gorsky, R Steiner, S Wiederrecht
Discrete Mathematics 346 (2), 113249, 2023
22023
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
22023
Matching minors in bipartite graphs
S Wiederrecht
Universitätsverlag der Technischen Universität Berlin, 2022
22022
Short schedules for fast flow rerouting
SA Amiri, S Dudycz, M Parham, S Schmid, S Wiederrecht
arXiv preprint arXiv:1805.06315, 2018
22018
Excluding surfaces as minors in graphs
DM Thilikos, S Wiederrecht
arXiv preprint arXiv:2306.01724, 2023
12023
Odd-Minors I: Excluding small parity breaks
JP Gollin, S Wiederrecht
arXiv preprint arXiv:2304.04504, 2023
12023
Excluding single-crossing matching minors in bipartite graphs
AC Giannopoulou, DM Thilikos, S Wiederrecht
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
12023
The system can't perform the operation now. Try again later.
Articles 1–20