The following pages link to (Q5743515):
Displayed 13 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Cyclability in graph classes (Q833007) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models (Q4988917) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
- Walking through waypoints (Q5918830) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
- Cyclability, connectivity and circumference (Q6132541) (← links)