The following pages link to Ivona Bezáková (Q652624):
Displayed 27 items.
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- Mixing of Markov chains for independent sets on chordal graphs with bounded separators (Q2019517) (← links)
- Counting and sampling orientations on chordal graphs (Q2154115) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs (Q2914311) (← links)
- Minimum Planar Multi-sink Cuts with Connectivity Priors (Q2922599) (← links)
- Sampling Edge Covers in 3-Regular Graphs (Q3182920) (← links)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571) (← links)
- Accelerating simulated annealing for the permanent and combinatorial counting problems (Q3581599) (← links)
- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078) (← links)
- (Q4598184) (← links)
- Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- (Q5091049) (← links)
- (Q5091171) (← links)
- (Q5111385) (← links)
- Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
- Inapproximability of the independent set polynomial in the complex plane (Q5230376) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Sampling binary contingency tables with a greedy start (Q5898351) (← links)
- Sampling binary contingency tables with a greedy start (Q5901125) (← links)