default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Wiederrecht
Person information
- affiliation: Institute for Basic Science, Daejeon, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Dimitrios M. Thilikos
, Sebastian Wiederrecht:
Killing a Vortex. J. ACM 71(4): 27:1-27:56 (2024)- [j6]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Excluding a planar matching minor in bipartite graphs. J. Comb. Theory B 164: 161-221 (2024) - [c12]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP 2024: 114:1-114:19 - [c11]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing Even Directed Circuits Quarter-Integrally. STOC 2024: 692-703 - [c10]Archontia C. Giannopoulou, Sebastian Wiederrecht:
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. STOC 2024: 716-727 - [i22]Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht:
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024) - [i21]Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht:
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR abs/2405.01879 (2024) - [i20]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR abs/2406.16647 (2024) - [i19]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. CoRR abs/2407.09671 (2024) - 2023
- [j5]Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht:
Matching theory and Barnette's conjecture. Discret. Math. 346(2): 113249 (2023) - [c9]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA 2023: 2111-2121 - [c8]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. SODA 2023: 3654-3663 - [i18]J. Pascal Gollin, Sebastian Wiederrecht:
Odd-Minors I: Excluding small parity breaks. CoRR abs/2304.04504 (2023) - [i17]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Approximating branchwidth on parametric extensions of planarity. CoRR abs/2304.04517 (2023) - [i16]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing even directed circuits quarter-integrally. CoRR abs/2311.16816 (2023) - 2022
- [j4]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. Electron. J. Comb. 29(4) (2022) - [c7]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Killing a vortex. FOCS 2022: 1069-1080 - [i15]Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht:
Matching Theory and Barnette's Conjecture. CoRR abs/2202.11641 (2022) - [i14]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Killing a Vortex. CoRR abs/2207.04923 (2022) - [i13]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR abs/2207.06874 (2022) - [i12]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR abs/2212.09348 (2022) - 2021
- [c6]Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht:
Directed Width Parameters on Semicomplete Digraphs. COCOA 2021: 615-628 - [i11]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Excluding a Planar Matching Minor in Bipartite Graphs. CoRR abs/2106.00703 (2021) - [i10]Archontia C. Giannopoulou, Sebastian Wiederrecht:
Two Disjoint Alternating Paths in Bipartite Graphs. CoRR abs/2110.02013 (2021) - [i9]Archontia C. Giannopoulou, Sebastian Wiederrecht:
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR abs/2110.07553 (2021) - 2020
- [j3]Sebastian Wiederrecht:
Digraphs of directed treewidth one. Discret. Math. 343(12): 112124 (2020) - [c5]Raphael Steiner, Sebastian Wiederrecht:
Parameterized Algorithms for Directed Modular Width. CALDAM 2020: 415-426 - [i8]Karl Heuer, Raphael Steiner, Sebastian Wiederrecht:
Even Circuits in Oriented Matroids. CoRR abs/2010.08988 (2020)
2010 – 2019
- 2019
- [c4]Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht:
On Polynomial-Time Congestion-Free Software-Defined Network Updates. Networking 2019: 1-9 - [c3]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG 2019: 53-65 - [i7]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. CoRR abs/1902.01322 (2019) - [i6]Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht:
Braces of Perfect Matching Width 2. CoRR abs/1902.06307 (2019) - [i5]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. CoRR abs/1903.02872 (2019) - [i4]Raphael Steiner, Sebastian Wiederrecht:
Parametrised Algorithms for Directed Modular Width. CoRR abs/1905.13203 (2019) - [i3]Sebastian Wiederrecht:
A Note on Directed Treewidth. CoRR abs/1910.01826 (2019) - 2018
- [j2]Robert Scheidweiler, Sebastian Wiederrecht:
On chordal graph and line graph squares. Discret. Appl. Math. 243: 239-247 (2018) - [c2]Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht:
Congestion-Free Rerouting of Flows on DAGs. ICALP 2018: 143:1-143:13 - [c1]Meike Hatzel, Sebastian Wiederrecht:
On Perfect Linegraph Squares. WG 2018: 252-265 - [i2]Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht:
Short Schedules for Fast Flow Rerouting. CoRR abs/1805.06315 (2018) - 2017
- [j1]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. 61: 505-511 (2017) - 2016
- [i1]Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht:
Congestion-Free Rerouting of Flows on DAGs. CoRR abs/1611.09296 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
