School of Computer Science
Tel-Aviv Academic College
| 15 | I. Gaber, A. Kirsh and D. Statter. Studied Questions in Data Structures and Algorithms Assessments. Proceedings of the 26th Innovation and Technology in Computer Science Education (ITiCSE) (1), in Proceedings of the 26th Innovation and Technology in Computer Science Education (ITiCSE) (1), pages 250–256, 2023. |
| 14 | Gaber I., Kirsh A. and R. Zigdon. Applying Proof Frameworks Is Harder for Students than We Think, in Proceedings of 25 th Annual Conference on Research in Undergraduate Mathematics Education (RUME '23), pages 1–8, 2023. |
| 13 | I. Gaber and A. Kirsh. Using Examples as Guideposts for Programming Exercises: Providing Support while Preserving the Challenge, IEEE The 16th International Conference on Computer Science and Education (ICCSE ’21), 2021, Won the Best Paper Award prize. |
| 12 | I. Gaber, M. Armoni and D. Statter. Teaching Reduction as an Algorithmic Problem-Solving Strategy, IEEE The 3rd International Conference on Computer Science and Technologies in Education (CSTE ’21), May 2021. |
| 11 | I. Gaber, A. Lev and R. Zigdon. Insights and Observations on Teaching the Intermediate Value Theorem, The American Mathematical Monthly, volume 126, pages 845–849, 2019. |
| 10 | A. Kirsh and I. Gaber. The Effect of Reporting Known Issues on Students' Work, in Proceedings of the 49th ACM Technical Symposium on Computer Science Education, pages 74–79, 2018. |
| 9 | A. Kirsh and I. Gaber. Taxonomy of Students Code Issues in Object Oriented Programming Exercise, in Poster: International Conference on Education Research (ICER ‘17), 2017. |
| 8 | A. Kirsh and I. Gaber. Composing Fair Exams in Programming Courses, 2017. |
| 7 | A. Kirsh and I. Gaber. Satisfaction, Time Investment and Success in Students' Programming Exercise, in Proceedings of the Programming Experience 2016 (PX/16) Workshop, pages 9 – 20, 2016. |
| 6 | I. Gaber and Y. Roditty. The depression of a graph and the diameter of its line graph, Discrete mathematics, volume 309, pages 1774–1778, 2009. |
| 5 | I Gaber and M. Parnas. All-port line broadcasting in highly connected graphs, Networks: An International Journal, volume 45, pages 95–103, 2005. |
| 4 | I. Gaber. Minimal-time k-line broadcasting, SIAM Journal on Discrete Mathematics, volume 18, pages 769–777, 2005. |
| 3 | I. Gaber and Y. Mansour. Centralized broadcast in multihop radio networks, Journal of Algorithms, volume 46, pages 1–20, 2003, Appeared also in SODA 1995.. |
| 2 | A. Averbuch, I. Gaber and Y. Roditty. Low-cost minimum-time line-broadcasting schemes in complete binary trees, Networks: An International Journal, volume 38, pages 189–193, 2001. |
| 1 | I. Gaber. and Y. Mansour. Centralized broadcast in multihop radio networks, in The 6th ACM-Siam Symposium on Discrete Algorithms, pages 577–585, 1995. |