default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvona Bezáková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Ivona Bezáková
, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024)- [c44]Zack J. Butler, Ivona Bezáková, Shaoxuan Xu, Angelina Brilliantova:
Analyzing Student and Instructor Comments using NLP. SIGCSE (2) 2024: 1584-1585 - 2023
- [c43]Angelina Brilliantova, Hannah Miller, Ivona Bezáková:
GRASMOS: Graph Signage Model Selection for Gene Regulatory Networks. AAAI 2023: 12364-12372 - [c42]Angelina Brilliantova, Ivona Bezáková:
Model Selection of Graph Signage Models Using Maximum Likelihood (Student Abstract). AAAI 2023: 16168-16169 - [c41]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: 353-359 - [c40]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: 1341 - [c39]Nathan Smearsoll, Ivona Bezáková:
Partial Credit Grading of DFAs: Automation vs Human Graders. SIGCSE (2) 2023: 1383 - 2022
- [c38]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16 - [c37]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: 976-982 - [c36]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: 1103 - [c35]Ivona Bezáková, Wenbo Sun:
Counting and Sampling Orientations on Chordal Graphs. WALCOM 2022: 352-364 - 2021
- [j15]Noga Ron-Zewi, Ivona Bezáková, László A. Végh:
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17: 1-4 (2021) - [j14]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): 13:1-13:37 (2021) - [c34]Wenbo Sun, Ivona Bezáková:
Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract). AAAI 2021: 15901-15902 - [c33]Dan Garcia, Ivona Bezáková, Adam Blank, Neal Terrell:
Teaching Computer Science with Abstract Strategy Games. SIGCSE 2021: 1232-1233 - [c32]Zack Butler, Ivona Bezáková, Kimberly Fluet:
Puzzles in Many Places: Closing the Loop on Propagation. SIGCSE 2021: 1278 - [c31]Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez:
Witness Feedback for Introductory CS Theory Assignments. SIGCSE 2021: 1300 - [i8]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR abs/2111.04066 (2021) - 2020
- [j13]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: 25:1-25:62 (2020) - [j12]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) - [c30]Wenbo Sun, Ivona Bezáková:
Sampling Random Chordal Graphs by MCMC (Student Abstract). AAAI 2020: 13929-13930 - [c29]Ivona Bezáková, Wenbo Sun:
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. COCOON 2020: 664-676 - [c28]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: 1311 - [i7]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 abs/2012.01546 (2020)
2010 – 2019
- 2019
- [j11]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): 279-349 (2019) - [j10]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 2326-2345 (2019) - [c27]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - [c26]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP 2019: 22:1-22:13 - [i6]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR abs/1901.07361 (2019) - 2018
- [c25]Ivona Bezáková, Andrew Searns:
On Counting Oracles for Path Problems. ISAAC 2018: 56:1-56:12 - [c24]Zack Butler, Ivona Bezáková, Kimberly Fluet:
Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2. ITiCSE 2018: 212-217 - [c23]Zack Butler, Ivona Bezáková, Kimberly Fluet:
Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only). SIGCSE 2018: 1086 - [c22]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. STOC 2018: 1234-1240 - [i5]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The complexity of approximating the matching polynomial in the complex plane. CoRR abs/1807.04930 (2018) - 2017
- [c21]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. ICALP 2017: 54:1-54:14 - [c20]Zack J. Butler, Ivona Bezáková, Kimberly Fluet:
Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context. SIGCSE 2017: 93-98 - [i4]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. CoRR abs/1711.00282 (2017) - [i3]Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports 7(8): 23-44 (2017) - 2016
- [c19]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - [i2]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-parameter Tractable. CoRR abs/1607.07737 (2016) - 2015
- [c18]Zack Butler, Ivona Bezáková:
On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only). SIGCSE 2015: 707 - [i1]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - 2014
- [j9]George B. Mertzios, Ivona Bezáková:
Computing and counting longest paths on circular-arc graphs in polynomial time. Discret. Appl. Math. 164: 383-399 (2014) - [c17]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: 3054-3056 - [c16]Ivona Bezáková, Zachary Langley:
Minimum Planar Multi-sink Cuts with Connectivity Priors. MFCS (2) 2014: 94-105 - [c15]Ivona Bezáková, James E. Heliotis, Sean Strout:
On the efficacy of board game strategy development as a first-year CS project. SIGCSE 2014: 283-288 - 2013
- [c14]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: 1-8 - [c13]James E. Heliotis, Ivona Bezáková, Sean Strout:
Programming board game strategies in CS2. FIE 2013: 4-5 - [c12]Ivona Bezáková, James E. Heliotis, Sean Strout:
Board game strategies in introductory computer science. SIGCSE 2013: 17-22 - [c11]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: 743 - 2012
- [j8]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - [j7]Ivona Bezáková, Adam J. Friedlander:
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. Theor. Comput. Sci. 417: 2-11 (2012) - [c10]Ivona Bezáková, Zachary Langley:
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. COCOON 2012: 49-60 - [c9]Bo Li, Shuaiwen Song, Ivona Bezáková, Kirk W. Cameron:
Energy-Aware Replica Selection for Data-Intensive Services in Cloud. MASCOTS 2012: 504-506 - [c8]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: 669 - 2011
- [j6]George B. Mertzios, Ivona Bezáková:
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. Electron. Notes Discret. Math. 37: 219-224 (2011) - [j5]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): 457-468 (2011) - 2010
- [c7]Ivona Bezáková, Adam J. Friedlander:
Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time. MFCS 2010: 126-137
2000 – 2009
- 2009
- [c6]Ivona Bezáková, Nayantara Bhatnagar, Dana Randall:
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. COCOON 2009: 307-316 - [c5]Ivona Bezáková, William A. Rummler:
Sampling Edge Covers in 3-Regular Graphs. MFCS 2009: 137-148 - 2008
- [j4]Ivona Bezáková:
Sampling Binary Contingency Tables. Comput. Sci. Eng. 10(2): 26-31 (2008) - [j3]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): 1429-1454 (2008) - 2007
- [j2]Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda:
Sampling binary contingency tables with a greedy start. Random Struct. Algorithms 30(1-2): 168-205 (2007) - 2006
- [c4]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147 - [c3]Ivona Bezáková, Adam Kalai, Rahul Santhanam:
Graph model selection using maximum likelihood. ICML 2006: 105-112 - [c2]Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda:
Sampling binary contingency tables with a greedy start. SODA 2006: 414-423 - [c1]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907 - 2005
- [j1]Ivona Bezáková, Varsha Dani:
Allocating indivisible goods. SIGecom Exch. 5(3): 11-18 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
