48 citations · 68 across the 25 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.GT2026
Fair Allocation under Conflict Constraints via Strong Colorability
Ishay Haviv
In the fair allocation problem under conflict constraints, the goal is to partition the vertices of a graph among agents in a fair manner, such that no two adjacent vertices are as…
cs.DM2026
Setwise Distinguishable Permutations
Ishay Haviv
A family of permutations of is called setwise distinguishable if for every permutation in the family there exists a subset of whose image under this permutation differs…
cs.CC2026
Kernelization Bounds for Constrained Coloring
Ishay Haviv
We study the kernel complexity of constraint satisfaction problems over a finite domain, parameterized by the number of variables, whose constraint language consists of two relatio…