The following pages link to Streaming Kernelization (Q2922615):
Displayed 14 items.
- Multistage graph problems on a global budget (Q831134) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Space limited graph algorithms on big data (Q6113850) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)