Ivona Bezáková

73 papers A* 14A 12B 6C 2Misc 3Journal 25Unranked 11

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