4 papers
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
Petr Hliněný, Jan Jedelský
We introduce, for every surface , a two-way connection between definability of a graph class by FO transductions (first-order logical transformations) of the graphs…
Hereditary Graph Product Structure and -clique-width
Petr Hliněný, Jan Jedelský
We introduce H-clique-width, a new structural measure of graphs that aims to provide a hereditary analogue of the traditional graph product structure. The definition naturally gene…
Automorphisms of Set Families and of Families of Cliques in an Interval Graph in FPT Time
Deniz Ağaoğlu Çağırıcı, Petr Hliněný
We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergrap…
Detours in Scope-Based Route Planning
Petr Hliněný, Ondrej Moriš
We study a dynamic scenario of the static route planning problem in road networks. Particularly, we put accent on the most practical dynamic case - increased edge weights (up to in…