Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Ivona
    Last name: Bezáková
    DBLP: 71/180
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 32 of 32  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Zack J. Butler, Ivona Bezáková, Kimberly Fluet.
    Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context.
    Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, Seattle, WA, USA, March 8-11, 2017 2017 (0) 2017
    Conference paper
    Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin.
    Finding Detours is Fixed-Parameter Tractable.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin.
    Finding Detours is Fixed-parameter Tractable.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Daniel Stefankovic.
    Approximation via Correlation Decay When Strong Spatial Mixing Fails.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Zack Butler, Ivona Bezáková.
    On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only).
    Proceedings of the 46th ACM Technical Symposium on Computer Science Education, Kansas City, MO, USA, March 4-7, 2015 2015 (0) 2015
    Conference paper
    Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Daniel Stefankovic.
    Approximation via Correlation Decay when Strong Spatial Mixing Fails.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Ivona Bezáková, James E. Heliotis, Sean Strout.
    On the efficacy of board game strategy development as a first-year CS project.
    The 45th ACM Technical Symposium on Computer Science Education, SIGCSE '14, Atlanta, GA, USA - March 05 - 08, 2014 2014 (0) 2014
    Conference paper
    Todd W. Neller, Laura E. Brown, Roger L. West, James E. Heliotis, Sean Strout, Ivona Bezáková, Bikramjit Banerjee, Daniel Thompson.
    Model AI Assignments 2014.
    Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. 2014 (0) 2014
    Journal article
    George B. Mertzios, Ivona Bezáková.
    Computing and counting longest paths on circular-arc graphs in polynomial time.
    Discrete Applied Mathematics 2014, Volume 164 (0) 2014
    Conference paper
    Ivona Bezáková, Zachary Langley.
    Minimum Planar Multi-sink Cuts with Connectivity Priors.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II 2014 (0) 2014
    Conference paper
    Ivona Bezáková, James E. Heliotis, Sean Strout.
    Board game strategies in introductory computer science.
    The 44th ACM Technical Symposium on Computer Science Education, SIGCSE '13, Denver, CO, USA, March 6-9, 2013 2013 (0) 2013
    Conference paper
    Adam Oest, Ivona Bezáková, James E. Heliotis, Sean Strout.
    Student development of board game strategies in a web-based graphical infrastructure (abstract only).
    The 44th ACM Technical Symposium on Computer Science Education, SIGCSE '13, Denver, CO, USA, March 6-9, 2013 2013 (0) 2013
    Conference paper
    Bo Li, Shuaiwen Song, Ivona Bezáková, Kirk W. Cameron.
    EDR: An energy-aware runtime load distribution system for data-intensive applications in the cloud.
    2013 IEEE International Conference on Cluster Computing, CLUSTER 2013, Indianapolis, IN, USA, September 23-27, 2013 2013 (0) 2013
    Conference paper
    James E. Heliotis, Ivona Bezáková, Sean Strout.
    Programming board game strategies in CS2.
    IEEE Frontiers in Education Conference, FIE 2013, Oklahoma City, Oklahoma, USA, October 23-26, 2013 2013 (0) 2013
    Journal article
    Ivona Bezáková, Adam J. Friedlander.
    Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time.
    Theor. Comput. Sci. 2012, Volume 417 (0) 2012
    Conference paper
    Ivona Bezáková, James E. Heliotis, Sean Strout, Adam Oest, Paul D. Solt.
    Programming board-game strategies in the introductory CS sequence (abstract only).
    Proceedings of the 43rd ACM technical symposium on Computer science education, SIGCSE 2012, Raleigh, NC, USA, February 29 - March 3, 2012 2012 (0) 2012
    Conference paper
    Ivona Bezáková, Zachary Langley.
    Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs.
    Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Bo Li, Shuaiwen Song, Ivona Bezáková, Kirk W. Cameron.
    Energy-Aware Replica Selection for Data-Intensive Services in Cloud.
    20th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2012, Washington, DC, USA, August 7-9, 2012 2012 (0) 2012
    Conference paper
    Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda.
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.
    Algorithmica 2012, Volume 64 (0) 2012
    Journal article
    George B. Mertzios, Ivona Bezáková.
    Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time.
    Electronic Notes in Discrete Mathematics 2011, Volume 37 (0) 2011
    Conference paper
    Ivona Bezáková, Nayantara Bhatnagar, Dana Randall.
    On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.
    J. Comb. Optim. 2011, Volume 22 (0) 2011
    Conference paper
    Ivona Bezáková, Adam J. Friedlander.
    Counting Minimum (
    Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Ivona Bezáková, Nayantara Bhatnagar, Dana Randall.
    On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.
    Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings 2009 (0) 2009
    Conference paper
    Ivona Bezáková, William A. Rummler.
    Sampling Edge Covers in 3-Regular Graphs.
    Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Ivona Bezáková.
    Sampling Binary Contingency Tables.
    Computing in Science and Engineering 2008, Volume 10 (0) 2008
    Conference paper
    Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda.
    Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.
    SIAM J. Comput. 2007, Volume 37 (0) 2008
    Conference paper
    Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda.
    Sampling binary contingency tables with a greedy start.
    Random Struct. Algorithms 2007, Volume 30 (0) 2007
    Conference paper
    Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda.
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.
    Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Ivona Bezáková, Adam Tauman Kalai, Rahul Santhanam.
    Graph model selection using maximum likelihood.
    Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006 2006 (0) 2006
    Conference paper
    Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda.
    Sampling binary contingency tables with a greedy start.
    Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006 (0) 2006
    Conference paper
    Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda.
    Accelerating simulated annealing for the permanent and combinatorial counting problems.
    Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006 (0) 2006
    Conference paper
    Ivona Bezáková, Varsha Dani.
    Allocating indivisible goods.
    SIGecom Exchanges 2005, Volume 5 (0) 2005
    Show item 1 to 32 of 32  

    Your query returned 32 matches in the database.