29 citations · 212 across the 50 of their papers we have counts for
6 papers · 1 filter
Separator Theorem for Minor-Free Graphs in Linear Time
Édouard Bonnet, Tuukka Korhonen, Hung Le +2
The planar separator theorem by Lipton and Tarjan [FOCS '77, SIAM Journal on Applied Mathematics '79] states that any planar graph with vertices has a balanced separator of siz…
Constricting the Computational Complexity Gap of the -Coloring Problem in -free Graphs
Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík +1
The -Coloring problem on hereditary graph classes has been a deeply researched problem over the last decade. A hereditary graph class is characterized by a (possibly infinite) l…
A Tight Meta-theorem for LOCAL Certification of MSO Properties within Bounded Treewidth Graphs
Linda Cook, Eun Jung Kim, Tomáš Masařík
Distributed networks are prone to errors so verifying their output is critical. Hence, we develop LOCAL certification protocols for graph properties in which nodes are given certif…
Path Eccentricity and Forbidden Induced Subgraphs
Sylwia Cichacz, Claire Hilaire, Tomáš Masařík +2
The path eccentricity of a connected graph is the minimum integer such that has a path such that every vertex is at distance at most from the path. A result of Duff…
Unbent Collections of Orthogonal Drawings
Todor Antić, Giuseppe Liotta, Tomáš Masařík +5
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we appl…
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
Tomáš Masařík, Jędrzej Olkowski, Anna Zych-Pawlewicz
In this paper we study fair variants of MSO definable problems parameterized by cluster vertex deletion number, i.e., the smallest number of vertices required to be removed fro…