7 citations · 33 across the 17 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.GT2021★ 2 cited
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…
cs.DM2021
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…