Allocating indivisible goods. - Ivona Bezáková; Varsha Dani (SIGecom Exch., 2005)

Graph model selection using maximum likelihood. - Ivona Bezáková; Adam Kalai; Rahul Santhanam (ICML, 2006)

Sampling binary contingency tables with a greedy start. - Ivona Bezáková; Nayantara Bhatnagar; Eric Vigoda (Random Struct. Algorithms, 2007)

Sampling Binary Contingency Tables. - Ivona Bezáková (Comput. Sci. Eng., 2008)

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. - Ivona Bezáková; Daniel Stefankovic; Vijay V. Vazirani; Eric Vigoda (SIAM J. Comput., 2008)

Sampling Edge Covers in 3-Regular Graphs. - Ivona Bezáková; William A. Rummler (MFCS, 2009)

Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time. - Ivona Bezáková; Adam J. Friedlander (MFCS, 2010)

On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries. - Ivona Bezáková; Nayantara Bhatnagar; Dana Randall (J. Comb. Optim., 2011)

Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. - Ivona Bezáková; Zachary Langley (COCOON, 2012)

Energy-Aware Replica Selection for Data-Intensive Services in Cloud. - Bo Li 032; Shuaiwen Song; Ivona Bezáková; Kirk W. Cameron (MASCOTS, 2012)

Programming board-game strategies in the introductory CS sequence (abstract only). - Ivona Bezáková; James E. Heliotis; Sean Strout; Adam Oest; Paul D. Solt (SIGCSE, 2012)

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. - Ivona Bezáková; Alistair Sinclair; Daniel Stefankovic; Eric Vigoda (Algorithmica, 2012)

Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. - Ivona Bezáková; Adam J. Friedlander (Theor. Comput. Sci., 2012)

EDR: An energy-aware runtime load distribution system for data-intensive applications in the cloud. - Bo Li 032; Shuaiwen Leon Song; Ivona Bezáková; Kirk W. Cameron (CLUSTER, 2013)

Programming board game strategies in CS2. - James E. Heliotis; Ivona Bezáková; Sean Strout (FIE, 2013)

Board game strategies in introductory computer science. - Ivona Bezáková; James E. Heliotis; Sean Strout (SIGCSE, 2013)

Student development of board game strategies in a web-based graphical infrastructure (abstract only). - Adam Oest; Ivona Bezáková; James E. Heliotis; Sean Strout (SIGCSE, 2013)

Model AI Assignments 2014. - Todd W. Neller; Laura E. Brown; Roger L. West; James E. Heliotis; Sean Strout; Ivona Bezáková; Bikramjit Banerjee; Daniel Lucas Thompson (AAAI, 2014)

Minimum Planar Multi-sink Cuts with Connectivity Priors. - Ivona Bezáková; Zachary Langley (MFCS (2), 2014)

On the efficacy of board game strategy development as a first-year CS project. - Ivona Bezáková; James E. Heliotis; Sean Strout (SIGCSE, 2014)

Computing and counting longest paths on circular-arc graphs in polynomial time. - George B. Mertzios; Ivona Bezáková (Discret. Appl. Math., 2014)

Board game strategies as an introductory CS course project. - James E. Heliotis; Sean Strout; Ivona Bezáková (J. Comput. Sci. Coll., 2014)

On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only). - Zack Butler 001; Ivona Bezáková (SIGCSE, 2015)

Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context. - Zack J. Butler; Ivona Bezáková; Kimberly Fluet (SIGCSE, 2017)

Computational Counting (Dagstuhl Seminar 18341). - Ivona Bezáková; Leslie Ann Goldberg; Mark Jerrum (Dagstuhl Reports, 2017)

On Counting Oracles for Path Problems. - Ivona Bezáková; Andrew Searns (ISAAC, 2018)

Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2. - Zack Butler 001; Ivona Bezáková; Kimberly Fluet (ITiCSE, 2018)

Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only). - Zack Butler 001; Ivona Bezáková; Kimberly Fluet (SIGCSE, 2018)

Approximation via Correlation Decay When Strong Spatial Mixing Fails. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Daniel Stefankovic (SIAM J. Comput., 2019)

Finding Detours is Fixed-Parameter Tractable. - Ivona Bezáková; Radu Curticapean; Holger Dell; Fedor V. Fomin (SIAM J. Discret. Math., 2019)

Sampling Random Chordal Graphs by MCMC (Student Abstract). - Wenbo Sun; Ivona Bezáková (AAAI, 2020)

Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. - Ivona Bezáková; Wenbo Sun (COCOON, 2020)

Prototype of an Automated Feedback Tool for Intro CS Theory. - Ivona Bezáková; Edith Hemaspaandra; Aryeh Lieberman; Hannah Miller; David E. Narváez (SIGCSE, 2020)

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (CoRR, 2020)

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. - Ivona Bezáková; Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (J. Mach. Learn. Res., 2020)

Inapproximability of the Independent Set Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (SIAM J. Comput., 2020)

Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract). - Wenbo Sun; Ivona Bezáková (AAAI, 2021)

Witness Feedback for Introductory CS Theory Assignments. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE, 2021)

Puzzles in Many Places: Closing the Loop on Propagation. - Zack Butler 001; Ivona Bezáková; Kimberly Fluet (SIGCSE, 2021)

Teaching Computer Science with Abstract Strategy Games. - Dan Garcia 001; Ivona Bezáková; Adam Blank; Neal Terrell (SIGCSE, 2021)

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. - Noga Ron-Zewi; Ivona Bezáková; László A. Végh (Adv. Math. Commun., 2021)

The Complexity of Approximating the Matching Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Comput. Theory, 2021)

Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE (1), 2022)

Pencil Puzzles as a Context for Introductory Computing Assignments in Diverse Settings. - Zack Butler 001; Ivona Bezáková; Angelina Brilliantova; Hannah Miller; Kimberly Fluet (SIGCSE (2), 2022)

Counting and Sampling Orientations on Chordal Graphs. - Ivona Bezáková; Wenbo Sun (WALCOM, 2022)

Model Selection of Graph Signage Models Using Maximum Likelihood (Student Abstract). - Angelina Brilliantova; Ivona Bezáková (AAAI, 2023)

GRASMOS: Graph Signage Model Selection for Gene Regulatory Networks. - Angelina Brilliantova; Hannah Miller; Ivona Bezáková (AAAI, 2023)

Feedback Tools and Motivation to Persist in Intro CS Theory. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE (2), 2023)

Putting a Context in Context: Investigating the Context of Pencil Puzzles in Multiple Academic Environments. - Zack J. Butler; Ivona Bezáková; Angelina Brilliantova (SIGCSE (1), 2023)

Partial Credit Grading of DFAs: Automation vs Human Graders. - Nathan Smearsoll; Ivona Bezáková (SIGCSE (2), 2023)

Analyzing Student and Instructor Comments using NLP. - Zack J. Butler; Ivona Bezáková; Shaoxuan Xu; Angelina Brilliantova (SIGCSE (2), 2024)

Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Algorithms, 2024)

Mathematical Underpinnings of Algorithms via In-class Activities. - Ivona Bezáková (SIGCSE (1), 2025)

Exploring ChatGPT as a Qualitative Research Assistant. - Angelina Brilliantova; Zack J. Butler; Ivona Bezáková (SIGCSE (2), 2025)

Pencil Puzzles as a Context in Upper-level Core Computing Courses at Multiple Institutions. - Angelina Brilliantova; Asya Vitko; Ivona Bezáková; Zack J. Butler (SIGCSE (2), 2025)