2 citations · 2 across the 5 of their papers we have counts for
5 papers
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Given a graph and a vertex set , the annotated treewidth tw of in is the maximum treewidth of an -rooted minor of , i.e., a minor where the model of…
Minor Containment and Disjoint Paths in almost-linear time
Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
We give an algorithm that, given graphs and , tests whether is a minor of in time ; here, is the number of vertices of and the ${\cal…
Branchwidth is (1,g)-self-dual
Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos +2
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the b…
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen +2
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the…
Combing a Linkage in an Annulus
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
A linkage in a graph of size is a subgraph of whose connected components are paths. The pattern of a linkage of size is the set of pairs formed by the e…