Site-wide links

Scholarly Works

Ivona Bezakova
Associate Professor

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 Presentations/Keynotes

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. SUNY 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. *