Kernelizing temporal exploration problems
From MaRDI portal
Cites work
- An application of simultaneous diophantine approximation in combinatorial optimization
- An introduction to temporal graphs: an algorithmic perspective
- Color-coding
- Connectivity and inference problems for temporal networks
- Exploration of k-edge-deficient temporal graphs
- Faster exploration of degree-bounded temporal graphs
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- scientific article; zbMATH DE number 727573 (Why is no real title available?)
- Introduction to algorithms
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Non-strict Temporal Exploration
- On exploring always-connected temporal graphs of small pathwidth
- On problems without polynomial kernels
- On temporal graph exploration
- Parameterized algorithms
- Polynomial kernels for weighted problems
- Traveling salesman problems in temporal graphs
- Two moves per time step make a difference
- Two-layer planarization parameterized by feedback edge set
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Vertex deletion parameterized by elimination distance and even less
Cited in
(3)
This page was built for publication: Kernelizing temporal exploration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926209)
