Blar i Department of Informatics på tidsskrift "Journal of computer and system sciences"

Viser treff 1-4 av 4

    • Building large k-cores from sparse graphs 

      Fomin, Fedor; Sagunov, Danil; Simonov, Kirill (Journal article; Peer reviewed, 2023)
      A k-core of a graph G is the maximal induced subgraph in which every vertex has degree at least k. In the Edge k-Core optimization problem, we are given a graph G and integers k, b and p. The task is to ensure that the ...

    • Detours in directed graphs 

      Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill (Journal article; Peer reviewed, 2023)
      We study two “above guarantee” versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, ...

    • Parameterized complexity of categorical clustering with size constraints 

      Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (Journal article; Peer reviewed, 2023)

    • Refined notions of parameterized enumeration kernels with applications to matching cut enumeration 

      Golovach, Petr; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang (Journal article; Peer reviewed, 2021)
      An enumeration kernel as defined by Creignou et al. (2017) [11] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a ...