Now showing items 1-4 of 4

  • Asymptotic enumeration of non-crossing partitions on surfaces 

    Rué Perna, Juan José; Sau, Ignasi; Thilikos Touloupas, Dimitrios (2013-03-01)
    Article
    Open Access
    We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface S and introduce the number CS(n) of noncrossing partitions of a set of n points laying on the ...
  • Dynamic programming for graphs on surfaces 

    Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (Springer, 2010)
    Conference report
    Open Access
    We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where ...
  • Dynamic programming for graphs on surfaces 

    Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (2014-02-01)
    Article
    Open Access
    We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard ...
  • On the number of labeled graphs of bounded treewidth 

    Baste, Julien; Noy Serrano, Marcos; Sau, Ignasi (2018-06-01)
    Article
    Open Access
    Let be Tnk the number of labeled graphs on vertices and treewidth at most (equivalently, the number o<f labeled partial -trees). We show that [...] for k>1 and some explicit absolute constant c>0. Disregarding terms depending ...