Ivona Bezáková

Available identifiers

zbMath Open bezakova.ivonaMaRDI QIDQ652624

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5091049	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091171	2022-07-21	Paper
Counting and sampling orientations on chordal graphs	2022-07-13	Paper
The Complexity of Approximating the Matching Polynomial in the Complex Plane	2022-03-22	Paper
Mixing of Markov chains for independent sets on chordal graphs with bounded separators	2021-04-21	Paper
Inapproximability of the Independent Set Polynomial in the Complex Plane	2020-10-26	Paper
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models	2020-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5111385	2020-05-27	Paper
Finding Detours is Fixed-Parameter Tractable	2019-11-27	Paper
Inapproximability of the independent set polynomial in the complex plane	2019-08-22	Paper
Approximation via Correlation Decay When Strong Spatial Mixing Fails	2019-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q4598184	2017-12-19	Paper
Integrating and Sampling Cuts in Bounded Treewidth Graphs	2016-11-16	Paper
Minimum Planar Multi-sink Cuts with Connectivity Priors	2014-10-14	Paper
Computing and counting longest paths on circular-arc graphs in polynomial time	2014-05-05	Paper
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time	2013-07-23	Paper
Negative examples for sequential importance sampling of binary contingency tables	2013-04-03	Paper
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs	2012-09-25	Paper
Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time	2012-03-13	Paper
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries	2011-12-15	Paper
Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time	2010-09-03	Paper
Accelerating simulated annealing for the permanent and combinatorial counting problems	2010-08-16	Paper
Sampling binary contingency tables with a greedy start	2010-08-16	Paper
Sampling Edge Covers in 3-Regular Graphs	2009-10-16	Paper
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries	2009-07-23	Paper
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems	2008-10-28	Paper
Negative examples for sequential importance sampling of binary contingency tables	2008-03-11	Paper
Sampling binary contingency tables with a greedy start	2007-02-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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