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

Ali Ahmadi

2 indexed papers

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

Publications per year

2
26

Top categories

Algorithms×1Discrete Math×1Combinatorics×1Optimization and Control×1Complexity×1

Frequent co-authors

Amir Ali Ahmadi1×
Pravesh K. Kothari1×
Yukai Tang1×
Kiarash Banihashem1×
Iman Gholami1×
Mohammad Taghi Hajiaghayi1×

Research Timeline

2026
Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
cs.CCTheoretical
Recent
Jun 14, 2026

Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

Ali Ahmadi, Kiarash Banihashem, Iman Gholami, Mohammad Taghi Hajiaghayi +1 more

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

View →