The following pages link to Petr A. Golovach (Q259036):
Displaying 9 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
