Pages that link to "Item:Q1035689"
From MaRDI portal
The following pages link to Minimum leaf out-branching and related problems (Q1035689):
Displaying 16 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Cryptographic Enforcement of Information Flow Policies Without Public Information (Q2794512) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q5075762) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
