( en | de | ru )

 

Disambiguation of "Bezáková, Ivona"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Detours is Fixed-parameter Tractable.

, , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ivona Jakovljevi

Ivona Venera Dinca

 

Other publications of authors with the same name

Computing and counting longest paths on circular-arc graphs in polynomial time., and . Discret. Appl. Math., (2014)The Complexity of Approximating the Matching Polynomial in the Complex Plane., , , and . ACM Trans. Comput. Theory, 13 (2): 13:1-13:37 (2021)Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2., , and . ITiCSE, page 212-217. ACM, (2018)Puzzles in Many Places: Closing the Loop on Propagation., , and . SIGCSE, page 1278. ACM, (2021)Partial Credit Grading of DFAs: Automation vs Human Graders., and . SIGCSE (2), page 1383. ACM, (2023)Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models., , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 283-298. PMLR, (2019)On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries., , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 307-316. Springer, (2009)Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs., , , and . ICALP, volume 229 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sampling binary contingency tables with a greedy start., , and . Random Struct. Algorithms, 30 (1-2): 168-205 (2007)Inapproximability of the independent set polynomial in the complex plane., , , and . CoRR, (2017)