graph algorithms

when you need to deal with pairwise relations

selected papers

  1. JCCS
    Serge GaspersShenwei Huang, and Daniël Paulusma
    Colouring square-free graphs without long induced paths
    Journal of Computer and System Sciences, 2019
  2. Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, and Jan Obdrzálek
    The dag-width of directed graphs
    Journal of Combinatorial Theory, Series B, 2012