• 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 ...