Ivona Bezáková

From MaRDI portal
Person:652624

Available identifiers

zbMath Open bezakova.ivonaMaRDI QIDQ652624

List of research outcomes





PublicationDate of PublicationType
Fast sampling via spectral independence beyond bounded-degree graphs2024-06-24Paper
https://portal.mardi4nfdi.de/entity/Q50911712022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50910492022-07-21Paper
Counting and sampling orientations on chordal graphs2022-07-13Paper
The Complexity of Approximating the Matching Polynomial in the Complex Plane2022-03-22Paper
Mixing of Markov chains for independent sets on chordal graphs with bounded separators2021-04-21Paper
Inapproximability of the Independent Set Polynomial in the Complex Plane2020-10-26Paper
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models2020-10-05Paper
https://portal.mardi4nfdi.de/entity/Q51113852020-05-27Paper
Finding Detours is Fixed-Parameter Tractable2019-11-27Paper
Inapproximability of the independent set polynomial in the complex plane2019-08-22Paper
Approximation via Correlation Decay When Strong Spatial Mixing Fails2019-05-07Paper
https://portal.mardi4nfdi.de/entity/Q45981842017-12-19Paper
Integrating and Sampling Cuts in Bounded Treewidth Graphs2016-11-16Paper
Minimum Planar Multi-sink Cuts with Connectivity Priors2014-10-14Paper
Computing and counting longest paths on circular-arc graphs in polynomial time2014-05-05Paper
Computing and counting longest paths on circular-arc graphs in polynomial time2013-07-23Paper
Negative examples for sequential importance sampling of binary contingency tables2013-04-03Paper
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs2012-09-25Paper
Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time2012-03-13Paper
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries2011-12-15Paper
Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time2010-09-03Paper
Sampling binary contingency tables with a greedy start2010-08-16Paper
Accelerating simulated annealing for the permanent and combinatorial counting problems2010-08-16Paper
Sampling Edge Covers in 3-Regular Graphs2009-10-16Paper
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries2009-07-23Paper
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems2008-10-28Paper
Negative examples for sequential importance sampling of binary contingency tables2008-03-11Paper
Sampling binary contingency tables with a greedy start2007-02-07Paper

Research outcomes over time

This page was built for person: Ivona Bezáková