Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Ishay Haviv

Ishay Haviv

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

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

Papers

cs.DMcs.CCmath.COTheoreticalRecentJun 19, 2026

Setwise Distinguishable Permutations

Ishay Haviv

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.

View →