Streaming deletion problems parameterized by vertex cover
From MaRDI portal
Publication:2140522
DOI10.1007/978-3-030-86593-1_29OpenAlexW3199337566MaRDI QIDQ2140522
Erik Jan van Leeuwen, Jelle J. Oostveen
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/2111.10184
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Finding odd cycle transversals.
- The node-deletion problem for hereditary properties is NP-complete
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fixed parameter tractability of graph deletion problems over data streams
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- On the parameterized complexity of graph modification to first-order logic properties
- On the complexity of various parameterizations of common induced subgraph isomorphism
- Maximum common induced subgraph parameterized by vertex cover
- On graph problems in a semi-streaming model
- Streaming Kernelization
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Kernelization Lower Bounds by Cross-Composition
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Parameterized Algorithms
- Towards a theory of parameterized streaming algorithms
- On the complexity of \(k\)-SAT
This page was built for publication: Streaming deletion problems parameterized by vertex cover