7 citations · 33 across the 17 of their papers we have counts for
19 papers
Computational Complexity of Covering Disconnected Multigraphs
Jan Bok, Jiří Fiala, Nikola Jedličková +2
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have att…
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
Min orderings and list homomorphism dichotomies for signed and unsigned graphs
Jan Bok, Richard Brewster, Pavol Hell +2
The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism probl…
List covering of regular multigraphs with semi-edges
Jan Bok, Jiří Fiala, Nikola Jedličková +2
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-e…
1-convex extensions of incomplete cooperative games and the average value
Jan Bok, Martin Černý
The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values f…
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
Jan Bok, Jiří Fiala, Petr Hliněný +2
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a…