Researcher Next
Create account
← Back to directory

Petr A. Golovach

Researcher Next ID · RN-038474

Researcher · Computer Science

University of Bergen

Bergen, Norway

Sign in to saveSign in to claim
Accepting doctoral researchersFunding unknown
Works count
408
Citation count
3,359
H-index
29
i10-index
97

Research interests

Computer Science
Mathematics
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Graph Labeling and Dimension Problems
Limits and Structures in Graph Theory
Interconnection Networks and Systems

Publications

  • A survey of parameterized algorithms and the complexity of edge modification

    Computer Science Review · 2023 · 10.1016/j.cosrev.2023.100556

  • A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

    Journal of Graph Theory · 2016 · 10.1002/jgt.22028

  • Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

    SIAM Journal on Computing · 2014 · 10.1137/130910932

  • Closing complexity gaps for coloring problems on H-free graphs

    Information and Computation · 2014 · 10.1016/j.ic.2014.02.004

  • List Coloring in the Absence of a Linear Forest

    Algorithmica · 2013 · 10.1007/s00453-013-9777-0

  • Three complexity results on coloring Pk -free graphs

    European Journal of Combinatorics · 2012 · 10.1016/j.ejc.2011.12.008

  • Contraction obstructions for treewidth

    Journal of Combinatorial Theory Series B · 2011 · 10.1016/j.jctb.2011.02.008

  • Updating the complexity status of coloring graphs without a fixed induced linear forest

    Theoretical Computer Science · 2011 · 10.1016/j.tcs.2011.10.005

  • Parameterized complexity of coloring problems: Treewidth versus vertex cover

    Theoretical Computer Science · 2010 · 10.1016/j.tcs.2010.10.043

  • Intractability of Clique-Width Parameterizations

    SIAM Journal on Computing · 2010 · 10.1137/080742270

  • Paths of bounded length and their cuts: Parameterized complexity and algorithms

    Discrete Optimization · 2010 · 10.1016/j.disopt.2010.09.009

  • Pursuing a fast robber on a graph

    Theoretical Computer Science · 2009 · 10.1016/j.tcs.2009.12.010

  • Complexity of the packing coloring problem for trees

    Discrete Applied Mathematics · 2008 · 10.1016/j.dam.2008.09.001

  • Parameterized Complexity for Domination Problems on Degenerate Graphs

    Lecture notes in computer science · 2008 · 10.1007/978-3-540-92248-3_18

  • The capture time of a graph

    Discrete Mathematics · 2008 · 10.1016/j.disc.2008.04.004

  • Distance Constrained Labelings of Graphs of Bounded Treewidth

    Lecture notes in computer science · 2005 · 10.1007/11523468_30

Current projects

    No projects listed.