| 2026 | SIGCSE | Improving Students' Algorithmic Mathematical Competency via In-class Activities: New Course Materials and a Preliminary Multi-Section Study. | Ivona Bezkov, Varsha Dani, Asya Vitko |
| 2025 | SIGCSE | Mathematical Underpinnings of Algorithms via In-class Activities. | Ivona Bezkov |
| 2025 | SIGCSE | Exploring ChatGPT as a Qualitative Research Assistant. | Angelina Brilliantova, Zack J. Butler, Ivona Bezkov |
| 2025 | SIGCSE | Pencil Puzzles as a Context in Upper-level Core Computing Courses at Multiple Institutions. | Angelina Brilliantova, Asya Vitko, Ivona Bezkov, Zack J. Butler |
| 2024 | SIGCSE | Analyzing Student and Instructor Comments using NLP. | Zack J. Butler, Ivona Bezkov, Shaoxuan Xu, Angelina Brilliantova |
| 2023 | AAAI | Model Selection of Graph Signage Models Using Maximum Likelihood (Student Abstract). | Angelina Brilliantova, Ivona Bezkov |
| 2023 | AAAI | GRASMOS: Graph Signage Model Selection for Gene Regulatory Networks. | Angelina Brilliantova, Hannah Miller, Ivona Bezkov |
| 2023 | SIGCSE | Feedback Tools and Motivation to Persist in Intro CS Theory. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2023 | SIGCSE | Putting a Context in Context: Investigating the Context of Pencil Puzzles in Multiple Academic Environments. | Zack J. Butler, Ivona Bezkov, Angelina Brilliantova |
| 2023 | SIGCSE | Partial Credit Grading of DFAs: Automation vs Human Graders. | Nathan Smearsoll, Ivona Bezkov |
| 2022 | ICALP | Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2022 | SIGCSE | Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2022 | SIGCSE | Pencil Puzzles as a Context for Introductory Computing Assignments in Diverse Settings. | Zack Butler, Ivona Bezkov, Angelina Brilliantova, Hannah Miller, Kimberly Fluet |
| 2022 | WALCOM | Counting and Sampling Orientations on Chordal Graphs. | Ivona Bezkov, Wenbo Sun |
| 2021 | AAAI | Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract). | Wenbo Sun, Ivona Bezkov |
| 2021 | SIGCSE | Witness Feedback for Introductory CS Theory Assignments. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2021 | SIGCSE | Puzzles in Many Places: Closing the Loop on Propagation. | Zack Butler, Ivona Bezkov, Kimberly Fluet |
| 2021 | SIGCSE | Teaching Computer Science with Abstract Strategy Games. | Dan Garcia, Ivona Bezkov, Adam Blank, Neal Terrell |
| 2020 | AAAI | Sampling Random Chordal Graphs by MCMC (Student Abstract). | Wenbo Sun, Ivona Bezkov |
| 2020 | COCOON | Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. | Ivona Bezkov, Wenbo Sun |
| 2020 | SIGCSE | Prototype of an Automated Feedback Tool for Intro CS Theory. | Ivona Bezkov, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narvez |
| 2019 | COLT | Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. | Ivona Bezkov, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
| 2019 | ICALP | The Complexity of Approximating the Matching Polynomial in the Complex Plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2018 | ISAAC | On Counting Oracles for Path Problems. | Ivona Bezkov, Andrew Searns |
| 2018 | ITiCSE | Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2. | Zack Butler, Ivona Bezkov, Kimberly Fluet |
| 2018 | SIGCSE | Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only). | Zack Butler, Ivona Bezkov, Kimberly Fluet |
| 2018 | STOC | Inapproximability of the independent set polynomial in the complex plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | ICALP | Finding Detours is Fixed-Parameter Tractable. | Ivona Bezkov, Radu Curticapean, Holger Dell, Fedor V. Fomin |
| 2017 | SIGCSE | Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context. | Zack J. Butler, Ivona Bezkov, Kimberly Fluet |
| 2016 | ICALP | Approximation via Correlation Decay When Strong Spatial Mixing Fails. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic |
| 2015 | SIGCSE | On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only). | Zack Butler, Ivona Bezkov |
| 2014 | AAAI | Model AI Assignments 2014. | Todd W. Neller, Laura E. Brown, Roger L. West, James E. Heliotis, Sean Strout, Ivona Bezkov, Bikramjit Banerjee, Daniel Lucas Thompson |
| 2014 | MFCS | Minimum Planar Multi-sink Cuts with Connectivity Priors. | Ivona Bezkov, Zachary Langley |
| 2014 | SIGCSE | On the efficacy of board game strategy development as a first-year CS project. | Ivona Bezkov, James E. Heliotis, Sean Strout |
| 2013 | CLUSTER | EDR: An energy-aware runtime load distribution system for data-intensive applications in the cloud. | Bo Li, Shuaiwen Leon Song, Ivona Bezkov, Kirk W. Cameron |
| 2013 | FIE | Programming board game strategies in CS2. | James E. Heliotis, Ivona Bezkov, Sean Strout |
| 2013 | SIGCSE | Board game strategies in introductory computer science. | Ivona Bezkov, James E. Heliotis, Sean Strout |
| 2013 | SIGCSE | Student development of board game strategies in a web-based graphical infrastructure (abstract only). | Adam Oest, Ivona Bezkov, James E. Heliotis, Sean Strout |
| 2012 | COCOON | Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. | Ivona Bezkov, Zachary Langley |
| 2012 | MASCOTS | Energy-Aware Replica Selection for Data-Intensive Services in Cloud. | Bo Li, Shuaiwen Song, Ivona Bezkov, Kirk W. Cameron |
| 2012 | SIGCSE | Programming board-game strategies in the introductory CS sequence (abstract only). | Ivona Bezkov, James E. Heliotis, Sean Strout, Adam Oest, Paul D. Solt |
| 2010 | MFCS | Counting Minimum ( | Ivona Bezkov, Adam J. Friedlander |
| 2009 | COCOON | On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. | Ivona Bezkov, Nayantara Bhatnagar, Dana Randall |
| 2009 | MFCS | Sampling Edge Covers in 3-Regular Graphs. | Ivona Bezkov, William A. Rummler |
| 2006 | ESA | Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. | Ivona Bezkov, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda |
| 2006 | ICML | Graph model selection using maximum likelihood. | Ivona Bezkov, Adam Kalai, Rahul Santhanam |
| 2006 | SODA | Sampling binary contingency tables with a greedy start. | Ivona Bezkov, Nayantara Bhatnagar, Eric Vigoda |
| 2006 | SODA | Accelerating simulated annealing for the permanent and combinatorial counting problems. | Ivona Bezkov, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda |