The following pages link to Petr A. Golovach (Q259036):
Displaying 50 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)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Edge search number of cographs (Q415273) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Squares of low clique number (Q510991) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- How to guard a graph? (Q652526) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- The capture time of a graph (Q1045043) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
