Ishay Haviv
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Discrete Math×1Complexity×1Combinatorics×1
Research Timeline
2026
Setwise Distinguishable Permutations
The paper proves the existence of a setwise distinguishable family of 2^(2-o(1)) permutations of [n] and its applications to kernelization complexity of graph coloring problems.
Highlighted terms show continued research focus across papers