Kernelization of Whitney Switches
From MaRDI portal
Publication:5874518
DOI10.4230/LIPIcs.ESA.2020.48OpenAlexW3177017687MaRDI QIDQ5874518
Fedor V. Fomin, Petr A. Golovach
Publication date: 7 February 2023
Full work available at URL: https://bora.uib.no/bora-xmlui/handle/11250/2755696
Cites Work
- Fundamentals of parameterized complexity
- On the parameterized complexity of reconfiguration problems
- Vertex insertion approximates the crossing number of apex graphs
- An improved kernel size for rotation distance in binary trees
- Flip distance between two triangulations of a point set is NP-complete
- Flips in planar graphs
- Rotation distance is fixed-parameter tractable
- A 2-isomorphism theorem for hypergraphs
- Reconfiguration on sparse graphs
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- Computing the flip distance between triangulations
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- Sorting Strings by Reversals and by Transpositions
- Hardness Results for Tournament Isomorphism and Automorphism
- On Whitney's 2‐isomorphism theorem for graphs
- Kernelization
- Dividing a Graph into Triconnected Components
- A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
- Graph isomorphism in quasipolynomial time [extended abstract]
- Parameterized Algorithms
- Algorithms and Data Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Kernelization of Whitney Switches
