P. Golovach

Publications234
h-index25
Citations2,645
Highly Influential Citations158
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • F. Fomin
  • 441 Publications • 12,696 Citations
  • D. Paulusma
  • 307 Publications • 3,262 Citations
  • Saket Saurabh
  • 494 Publications • 9,694 Citations
  • D. Lokshtanov
  • 319 Publications • 8,674 Citations
  • Publications
  • Influence
Parameterized complexity of coloring problems: Treewidth versus vertex cover
View via Publisher
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
TLDR
This work surveys known results on the computational complexity of Colouring and $k-Colouring for graph classes that are characterized by one or two forbidden induced subgraphs, and considers a number of variants.
View on Wiley
Paths of bounded length and their cuts: Parameterized complexity and algorithms
View via Publisher
Contraction obstructions for treewidth
View via Publisher
Updating the complexity status of coloring graphs without a fixed induced linear forest
View via Publisher
Graph Searching and Interval Completion
TLDR
This paper proves monotone properties of searching with the smallest cost, and proves that for any graph G the search cost of G is equal to the smallest number of edges of all interval supergraphs of G.
View via Publisher
On the Tractability of Optimization Problems on H-Graphs
TLDR
A more refined complexity analysis of the problems solvable in polynomial time on H-graphs from the perspective of Parameterized Complexity shows that Maximum Independent Set, and Minimum Dominating Set are W[1]-hard being parameterized by the size of $H$ and thesize of the solution.
View on Springer
Backbone colorings for graphs: Tree and path backbones
TLDR
The computational complexity of the problem ‘Given a graph G, a spanning tree T of G, and an integer `, is there a backbone coloring for G and T with at most ` colors?’ jumps from polynomial to NP-complete between ` = 4 (easy for all spanning trees) and ` = 5 (difficult even for spanning paths).
View on Wiley
Parameterized complexity of generalized domination problems
View via Publisher
Clique-width: on the price of generality
TLDR
This paper shows that the running time O(nf(k)) of many clique-width based algorithms is essentially the best the authors can hope for (up to a widely believed assumption from parameterized complexity, namely FPT ≠ W[1])---the price they pay for generality.
View via Publisher
...
...