| The independence polynomial of trees is not always log-concave starting from order 26 O Kadrawi, VE Levit arXiv preprint arXiv:2305.01784, 2023 | 13 | 2023 |
| On computing of independence polynomials of trees O Kadrawi, VE Levit, R Yosef, M Mizrachi Recent Research in Polynomials, 2023 | 7 | 2023 |
| On unimodality of independence polynomials of trees R Yosef, M Mizrachi, O Kadrawi arXiv preprint arXiv:2101.06744, 2021 | 5 | 2021 |
| A Linear Algorithm for Computing Independence Polynomials of Trees O Kadrawi, VE Levit, R Yosef, M Mizrachi arXiv preprint arXiv:2201.00432, 2022 | 1 | 2022 |
| Inequalities Connecting the Annihilation and Independence Numbers O Kadrawi, VE Levit arXiv preprint arXiv:2308.01685, 2023 | | 2023 |
| Smart content creation for e-commerce OK Roman Yavich, Vladimir Rotkin, Sergey Malev, Eliahu Zamir US Patent US20210264366A1, 2021 | | 2021 |
| AI-Based E-Commerce Platform Development. 2nd Year: Development of E-Commerce Platform for Tourism OK Roman Yavich, Vladimir Rotkin, Sergey Malev, Eliahu Zamir | | 2020 |
| AI-Based E-Commerce Platform Development. 1st Year. Architecture, Methodology, Modelling, and Algorithms OK Roman Yavich, Vladimir Rotkin, Sergey Malev, Eliahu Zamir | | 2019 |
Vadim E. LevitProfessor, Department of Mathematics, Ariel UniversityVerified email at ariel.ac.il
