• A complexity dichotomy for critical values of the b-chromatic number of graphs 

      Lima, Paloma T.; Jaffke, Lars (Journal article; Peer reviewed, 2020)
      A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ...
    • The directed 2-linkage problem with length constraints 

      Bang-Jensen, J.; Bellitto, Thomas; Lochet, William; Yeo, A. (Journal article; Peer reviewed, 2020)
    • Mim-Width III. Graph powers and generalized distance domination problems 

      Telle, Jan Arne; Jaffke, Lars; Strømme, Torstein Jarl Fagerbakke; Kwon, O-Joung (Peer reviewed; Journal article, 2019)
      We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent ...
    • A type system for counting instances of software components 

      Bezem, Marcus A.; Hovland, Dag; Truong, Anh Hoang (Peer reviewed; Journal article, 2012)
      We identify an abstract language for component software based on process algebra. Besides the usual operators for sequential, alternative and parallel composition, it has primitives for instantiating components and for ...