Vertex deletion into bipartite permutation graphs
From MaRDI portal
Publication:2161007
DOI10.1007/S00453-021-00923-7OpenAlexW4210418612MaRDI QIDQ2161007FDOQ2161007
Tomasz Krawczyk, Jan Derbisz, Jana Novotná, Łukasz Bożyk, Karolina Okrasa
Publication date: 3 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11440
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The node-deletion problem for hereditary properties is NP-complete
- Comparability graphs and intersection graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- The strong perfect graph theorem
- Representation of a finite graph by a set of intervals on the real line
- Transitiv orientierbare Graphen
- Bipartite permutation graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- The 3-Irreducible Partially Ordered Sets
- Partial orders of dimension 2
- Chordal editing is fixed-parameter tractable
- Unit interval editing is fixed-parameter tractable
- Chordal deletion is fixed-parameter tractable
- Interval Completion Is Fixed Parameter Tractable
- Parameterized complexity of vertex deletion into perfect graph classes
- Proper interval vertex deletion
- Linear Recognition of Almost Interval Graphs
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Wheel-Free Deletion Is W[2]-Hard
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
- Vertex deletion into bipartite permutation graphs
Cited In (1)
This page was built for publication: Vertex deletion into bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2161007)
