Combing a Linkage in an Annulus
From MaRDI portal
Publication:6057804
DOI10.1137/22m150914xzbMath1525.05029arXiv2207.04798MaRDI QIDQ6057804
Dimitrios M. Thilikos, Petr A. Golovach, Giannos Stamoulis
Publication date: 26 October 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.04798
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irrelevant vertices for the planar disjoint paths problem
- Detecting induced minors in AT-free graphs
- The disjoint paths problem in quadratic time
- Graph minors. XXII. Irrelevant vertices in linkage problems
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Parameterizing cut sets in a graph by the number of their components
- Graph minors. XXI. graphs with unique linkages
- Graph searching and a min-max theorem for tree-width
- Rooted routing in the plane
- On computing graph minor obstruction sets
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Graph minors. XIII: The disjoint paths problem
- NP-completeness of some edge-disjoint paths problems
- Subexponential algorithms for partial cover problems
- On the complexity of the disjoint paths problem
- Obtaining a planar graph by vertex deletion
- A shorter proof of the graph minor algorithm
- Odd cycle packing
- Graph Minors and Parameterized Algorithm Design
- Multiflow Feasibility: An Annotated Tableau
- An Improved Algorithm for the Half-Disjoint Paths Problem
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- The Induced Disjoint Paths Problem
- Induced Packing of Odd Cycles in a Planar Graph
- Reducibility among Combinatorial Problems
- Elimination Distance to Bounded Degree on Planar Graphs
- Modification to Planarity is Fixed Parameter Tractable
- Hitting topological minors is FPT
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- Planarity Allowing Few Error Vertices in Linear Time
- Hadwiger's conjecture is decidable
- Linkless and flat embeddings in 3-space and the unknot problem
- Finding topological subgraphs is fixed-parameter tractable
- The Parameterized Complexity of Graph Cyclability
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- Vertex deletion parameterized by elimination distance and even less
