23 citations · 60 across the 50 of their papers we have counts for
3 papers · 1 filter
Hitting and Harvesting Pumpkins
Gwenaël Joret, Christophe Paul, Ignasi Sau +2
The "c-pumpkin" is the graph with two vertices linked by c>0 parallel edges. A c-pumpkin-model in a graph G is a pair A,B of disjoint subsets of vertices of G, each inducing a conn…
Dynamic Programming for Graphs on Surfaces
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
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 g…
Asymptotic Enumeration of Non-crossing Partitions on Surfaces
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface and introduce the number of non-crossin…