Ivona Bezáková

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 42

Top Topics

Computer Science

Model Selection

Bounded Treewidth

Independent Set

Top Venues

Publications

Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20 (1) (2024)
Zack J. Butler, Ivona Bezáková, Shaoxuan Xu, Angelina Brilliantova
Analyzing Student and Instructor Comments using NLP. SIGCSE (2) (2024)
Angelina Brilliantova, Hannah Miller, Ivona Bezáková
GRASMOS: Graph Signage Model Selection for Gene Regulatory Networks. AAAI (2023)
Angelina Brilliantova, Ivona Bezáková
Model Selection of Graph Signage Models Using Maximum Likelihood (Student Abstract). AAAI (2023)
Zack J. Butler, Ivona Bezáková, Angelina Brilliantova
Putting a Context in Context: Investigating the Context of Pencil Puzzles in Multiple Academic Environments. SIGCSE (1) (2023)
Nathan Smearsoll, Ivona Bezáková
Partial Credit Grading of DFAs: Automation vs Human Graders. SIGCSE (2) (2023)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Feedback Tools and Motivation to Persist in Intro CS Theory. SIGCSE (2) (2023)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. SIGCSE (1) (2022)
Ivona Bezáková, Wenbo Sun
Counting and Sampling Orientations on Chordal Graphs. WALCOM (2022)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP (2022)
Zack Butler, Ivona Bezáková, Angelina Brilliantova, Hannah Miller, Kimberly Fluet
Pencil Puzzles as a Context for Introductory Computing Assignments in Diverse Settings. SIGCSE (2) (2022)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13 (2) (2021)
Noga Ron-Zewi, Ivona Bezáková, László A. Végh
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17 (2021)
Wenbo Sun, Ivona Bezáková
Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract). AAAI (2021)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR (2021)
Dan Garcia, Ivona Bezáková, Adam Blank, Neal Terrell
Teaching Computer Science with Abstract Strategy Games. SIGCSE (2021)
Zack Butler, Ivona Bezáková, Kimberly Fluet
Puzzles in Many Places: Closing the Loop on Propagation. SIGCSE (2021)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Witness Feedback for Introductory CS Theory Assignments. SIGCSE (2021)
Ivona Bezáková, Wenbo Sun
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. COCOON (2020)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. 49 (5) (2020)
Ivona Bezáková, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narváez
Prototype of an Automated Feedback Tool for Intro CS Theory. SIGCSE (2020)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. CoRR (2020)
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. J. Mach. Learn. Res. 21 (2020)
Wenbo Sun, Ivona Bezáková
Sampling Random Chordal Graphs by MCMC (Student Abstract). AAAI (2020)
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48 (2) (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP (2019)
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT (2019)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33 (4) (2019)
Zack Butler, Ivona Bezáková, Kimberly Fluet
Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only). SIGCSE (2018)
Ivona Bezáková, Andrew Searns
On Counting Oracles for Path Problems. ISAAC (2018)
Zack Butler, Ivona Bezáková, Kimberly Fluet
Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2. ITiCSE (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The complexity of approximating the matching polynomial in the complex plane. CoRR (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. STOC (2018)
Zack J. Butler, Ivona Bezáková, Kimberly Fluet
Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context. SIGCSE (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-Parameter Tractable. ICALP (2017)
Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum
Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports 7 (8) (2017)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. CoRR (2017)
Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
Finding Detours is Fixed-parameter Tractable. CoRR (2016)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP (2016)
Zack Butler, Ivona Bezáková
On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only). SIGCSE (2015)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR (2015)
Todd W. Neller, Laura E. Brown, Roger L. West, James E. Heliotis, Sean Strout, Ivona Bezáková, Bikramjit Banerjee, Daniel Lucas Thompson
Model AI Assignments 2014. AAAI (2014)
Ivona Bezáková, James E. Heliotis, Sean Strout
On the efficacy of board game strategy development as a first-year CS project. SIGCSE (2014)
Ivona Bezáková, Zachary Langley
Minimum Planar Multi-sink Cuts with Connectivity Priors. MFCS (2) (2014)
George B. Mertzios, Ivona Bezáková
Computing and counting longest paths on circular-arc graphs in polynomial time. Discret. Appl. Math. 164 (2014)
James E. Heliotis, Ivona Bezáková, Sean Strout
Programming board game strategies in CS2. FIE (2013)
Bo Li, Shuaiwen Leon Song, Ivona Bezáková, Kirk W. Cameron
EDR: An energy-aware runtime load distribution system for data-intensive applications in the cloud. CLUSTER (2013)
Adam Oest, Ivona Bezáková, James E. Heliotis, Sean Strout
Student development of board game strategies in a web-based graphical infrastructure (abstract only). SIGCSE (2013)
Ivona Bezáková, James E. Heliotis, Sean Strout
Board game strategies in introductory computer science. SIGCSE (2013)
Bo Li, Shuaiwen Song, Ivona Bezáková, Kirk W. Cameron
Energy-Aware Replica Selection for Data-Intensive Services in Cloud. MASCOTS (2012)
Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64 (4) (2012)
Ivona Bezáková, Adam J. Friedlander
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. Theor. Comput. Sci. 417 (2012)
Ivona Bezáková, Zachary Langley
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. COCOON (2012)
Ivona Bezáková, James E. Heliotis, Sean Strout, Adam Oest, Paul D. Solt
Programming board-game strategies in the introductory CS sequence (abstract only). SIGCSE (2012)
George B. Mertzios, Ivona Bezáková
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. Electron. Notes Discret. Math. 37 (2011)
Ivona Bezáková, Nayantara Bhatnagar, Dana Randall
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries. J. Comb. Optim. 22 (3) (2011)
Ivona Bezáková, Adam J. Friedlander
)-Cuts in Weighted Planar Graphs in Polynomial Time. MFCS (2010)
Ivona Bezáková, Nayantara Bhatnagar, Dana Randall
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. COCOON (2009)
Ivona Bezáková, William A. Rummler
Sampling Edge Covers in 3-Regular Graphs. MFCS (2009)
Ivona Bezáková
Sampling Binary Contingency Tables. Comput. Sci. Eng. 10 (2) (2008)
Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37 (5) (2008)
Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda
Sampling binary contingency tables with a greedy start. Random Struct. Algorithms 30 (1-2) (2007)
Ivona Bezáková, Adam Kalai, Rahul Santhanam
Graph model selection using maximum likelihood. ICML (2006)
Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA (2006)
Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA (2006)
Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda
Sampling binary contingency tables with a greedy start. SODA (2006)
Ivona Bezáková, Varsha Dani
Allocating indivisible goods. SIGecom Exch. 5 (3) (2005)