Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

31.05.2023

Three Papers accepted at WG

At this year's edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG) in Fribourg, Switzerland on 28-30 June we will present three papers written by our group members.

First, the paper Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs studies a variant of the problem of partitioning a graph into connected components restricted into specific graph classes. In particular, the authors developed polynomial time algorithms that realize the Gyori-Lovasz theorem for general values of \(k\) when the graph is chordal and beyond.

The paper Turán’s Theorem Through Algorithmic Lens shows an algorithmic extension of Turán's theorem: If the number of edges in a graph is close to the Turán's bound, the clique of the respective size can be found in FPT time parameterized by the "offset".

Finally, Proportionally Fair Matching with Multiple Groups is about the fair variant of the matching problem, where the task is to find the maximum matching in an edge-colored graph such that no color appears too often compared to other colors. The authors show the first exact and approximation algorithms for the case of more than two colors.

  • Turán’s Theorem Throug... - Download
    Fomin, Fedor; Golovach, Petr; Sagunov, Danil; Simonov, Kirill Turán’s Theorem Through Algorithmic LensWorkshop on Graph-Theoretic Concepts in Computer Science (WG) 2023
     
  • Efficient Constructions f... - Download
    Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, Ziena Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal GraphsWorkshop Graph-Theoretic Concepts in Computer Science (WG) 2023: 143–156
     
  • Proportionally Fair Match... - Download
    Bandyapadhyay, Sayan; Fomin, Fedor V.; Inamdar, Tanmay; Simonov, Kirill Proportionally Fair Matching with Multiple GroupsWorkshop on Graph-Theoretic Concepts in Computer Science (WG) 2023