Parameterized dynamic data structure for split completion
From MaRDI portal
Cites work
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- A dynamic data structure for counting subgraphs in sparse graphs
- A dynamic data structure for MSO properties in graphs with bounded tree-depth
- A near-optimal planarization algorithm
- A Polynomial Kernel for Proper Interval Vertex Deletion
- A polynomial kernel for trivially perfect editing
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Chordal deletion is fixed-parameter tractable
- Chordal editing is fixed-parameter tractable
- Color-coding
- Complexity classification of some edge modification problems
- Dynamic data structures for parameterized string problems
- Dynamic data structures for timed automata acceptance
- Dynamic Parameterized Problems and Algorithms
- Dynamically maintaining split graphs
- Exploring the subexponential complexity of completion problems
- Fast dynamic graph algorithms for parameterized problems
- Faster parameterized algorithms for deletion to split graphs
- Fully dynamic algorithms for chordal graphs and split graphs
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 7788388 (Why is no real title available?)
- Interval Completion Is Fixed Parameter Tractable
- Linear recognition of almost interval graphs
- Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number
- Obtaining a planar graph by vertex deletion
- Parameterized algorithms
- Proper interval vertex deletion
- Subexponential parameterized algorithm for minimum fill-in
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- The node-deletion problem for hereditary properties is NP-complete
- The splittance of a graph
- Unit interval editing is fixed-parameter tractable
- Unit interval vertex deletion: fewer vertices are relevant
This page was built for publication: Parameterized dynamic data structure for split completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253156)
