Sebastian Wiederrecht

Orcid: 0000-0003-0462-7815

Affiliations:
  • Institute for Basic Science, Daejeon, South Korea


According to our database1, Sebastian Wiederrecht authored at least 26 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Excluding a planar matching minor in bipartite graphs.
J. Comb. Theory, Ser. B, January, 2024

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.
CoRR, 2024

2023
Matching theory and Barnette's conjecture.
Discret. Math., 2023

Packing even directed circuits quarter-integrally.
CoRR, 2023

Approximating branchwidth on parametric extensions of planarity.
CoRR, 2023

Odd-Minors I: Excluding small parity breaks.
CoRR, 2023

Excluding Single-Crossing Matching Minors in Bipartite Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Kernelization for Graph Packing Problems via Rainbow Matching.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Colouring Non-Even Digraphs.
Electron. J. Comb., 2022

Killing a vortex.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
A Flat Wall Theorem for Matching Minors in Bipartite Graphs.
CoRR, 2021

Two Disjoint Alternating Paths in Bipartite Graphs.
CoRR, 2021

Directed Width Parameters on Semicomplete Digraphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Digraphs of directed treewidth one.
Discret. Math., 2020

Even Circuits in Oriented Matroids.
CoRR, 2020

Parameterized Algorithms for Directed Modular Width.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
A Note on Directed Treewidth.
CoRR, 2019

Parametrised Algorithms for Directed Modular Width.
CoRR, 2019

Braces of Perfect Matching Width 2.
CoRR, 2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

On Polynomial-Time Congestion-Free Software-Defined Network Updates.
Proceedings of the 2019 IFIP Networking Conference, 2019

2018
On chordal graph and line graph squares.
Discret. Appl. Math., 2018

Short Schedules for Fast Flow Rerouting.
CoRR, 2018

On Perfect Linegraph Squares.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Congestion-Free Rerouting of Flows on DAGs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Matching Connectivity: On the Structure of Graphs with Perfect Matchings.
Electron. Notes Discret. Math., 2017


  Loading...