Site-wide links

Scholarly Works

Ivona Bezakova
Professor

2018 Submissions

Published Conference Proceedings

Butler, Zack, Ivona Bezáková, and Kimberly Fluet. "Analyzing Rich Qualitative Data to Study Pencil-Puzzle-based Assignments in CS1 and CS2." Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE), July 2-4, 2018, Larnaca, Cyprus. Ed. Irene Polycarpou, et al. Larnaca, Cyprus: ACM, Web. *

Bezáková, Ivona and Andrew Searns. "On Counting Oracles for Path Problems." Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), December 16-19, 2018, Jiaoxi, Yilan, Taiwan. Ed. Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao. Jiaoxi, Yilan, Taiwan: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Web. *

Bezáková, Ivona, et al. "Inapproximability of the Independent Set Polynomial in the Complex Plane." Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), June 25-29, 2018, Los Angeles, CA. Ed. Ilias Diakonikolas, David Kempe, and Monika Henzinger. Los Angeles, CA: ACM, Web. *

Peer Reviewed/Juried Poster Presentation

Butler, Zack, Ivona Bezáková, and Kimberly Fluet. "Qualitative Analysis of Open-ended Comments in Introductory CS Courses." Proceedings of the 49th ACM Technical Symposium on Computer Science Education (SIGCSE), February 21-24, 2018, Baltimore, MD. Ed. Tiffany Barnes, et al. Baltimore, MD: ACM. *

2017 Submissions

Published Conference Proceedings

Fomin, Ivona Bezakova, Radu Curticapean, Holger Dell, Fedor V. "Finding Detours is Fixed-parameter Tractable." Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), July 10-14, 2017, Warsaw, Poland. Ed. Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl. Warsaw, Poland: n.p., 2017. Web. *

Fluet, Zack J. Butler, Ivona Bezakova, Kimberly. "Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context." Proceedings of the ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE), March 8-11, 2017, Seattle, WA. Ed. Michael E. Caspersen, Stephen H. Edwards, Tiffany Barnes, Daniel D. Garcia. Seattle, WA: ACM, 2017. Web. «

2016 Submissions

Published Conference Proceedings

Bezakova, Ivona, et al. "Approximation via Correlation Decay When Strong Spatial Mixing Fails." Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP). Ed. Ioannis Chatzigiannakis, et al. Rome, Italy: ICALP, 2016. Print. *

2015 Submissions

Journal Paper

Bezakova, Ivona, Erin W. Chambers, and Kyle Fox. "Integrating and Sampling Cuts in Bounded Treewidth Graphs." Association for Women in Mathematics Series, Springer. Accepted for publication. (2015): 1-14. Print. *

Published Conference Proceedings

Butler, Zack and Ivona Bezakova. "On Beyond Sudoku: Pencil Puzzles For Introductory Computer Science." Proceedings of the The 46th ACM technical symposium on Computer science education (SIGCSE). Ed. Carl Alphonse and Jodi Tims. Kansas City, MO: Association for Computing Machinery (ACM), 2015. Web. «

2011 Submissions

Journal Paper

Bezakova, Ivona, Nayantara Bhatnagar, and Dana Randall. "On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries." Journal of Combinatorial Optimization 22. (2011): 457-468. Print. * £

Xu, Ke, et al. "Path Lengths in Protein-Protein Interaction Networks and Biological Complexity." Proteomics 11. 10 (2011): 1857-1867. Print. * £

Published Conference Proceedings

Mertzios, George B. and Ivona Bezakova. "Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time." Proceedings of the Latin-American Algorithms, Graphs, and Optimization Symposium. Ed. Javier Marenco, Mario Valencia-Pabon. Bariloche, Argentina: Electronic Notes in Discrete Mathematics 37: 219-224, 2011. Print. *

Invited Keynote/Presentation

Bezakova, Ivona. "Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs." The 4th Eastern Great Lakes Theory of Computation Workshop (EAGL). State University of New York at Buffalo. Buffalo, NY. 11 Sep. 2011. Lecture.

2010 Submissions

Published Article

Bezakova, Ivona, and Adam J. Friedlander. “Counting Minimum Cuts in Weighted Planar Graphs in Polynomial Time.” Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, 2010. n.p. Print. † *

Bezakova, Ivona, Nayantara Bhatnagar, and Dana Randall. “On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.” Journal of Combinatorial Optimization, (2010): 1-12. Print. *