Fully polynomial time approximation schemes (FPTAS) for some counting problems. - Tzvi Alon (CoRR, 2016)

Pooling Risk Games. - Tzvi Alon; Moshe Haviv (IGTR, 2020)

A faster FPTAS for counting two-rowed contingency tables. - Tzvi Alon; Nir Halman (Discret. Appl. Math., 2021)

Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier. - Tzvi Alon; Nir Halman (SIAM J. Discret. Math., 2021)

Strongly Polynomial FPTASes for Monotone Dynamic Programs. - Tzvi Alon; Nir Halman (Algorithmica, 2022)

Discrete-time strategic job arrivals to a single machine with waiting and lateness penalties. - Tzvi Alon; Moshe Haviv (Eur. J. Oper. Res., 2022)

Choosing a batch to be processed. - Tzvi Alon; Moshe Haviv (Ann. Oper. Res., 2023)