Kernelization of Whitney Switches
From MaRDI portal
Publication:5874518
Cites work
- scientific article; zbMATH DE number 1947393 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 863474 (Why is no real title available?)
- scientific article; zbMATH DE number 871927 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- A 2-isomorphism theorem for hypergraphs
- A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
- An improved kernel size for rotation distance in binary trees
- Computing the flip distance between triangulations
- Dividing a Graph into Triconnected Components
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Flip distance between two triangulations of a point set is NP-complete
- Flips in planar graphs
- Fundamentals of parameterized complexity
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Hardness Results for Tournament Isomorphism and Automorphism
- Kernelization. Theory of parameterized preprocessing
- Multivariate algorithmics for NP-hard string problems
- On Whitney's 2‐isomorphism theorem for graphs
- Parameterized algorithms
- Rotation distance is fixed-parameter tractable
- Sorting circular permutations by reversal.
- Sorting strings by reversals and by transpositions
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- Vertex insertion approximates the crossing number of apex graphs
This page was built for publication: Kernelization of Whitney Switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874518)
