| Publication | Date of Publication | Type |
|---|
Fast sampling via spectral independence beyond bounded-degree graphs
| 2024-06-24 | Paper |
The complexity of approximating the matching polynomial in the complex plane
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561410 (Why is no real title available?)
| 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
ACM Transactions on Computation Theory | 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
SIAM Journal on Computing | 2020-10-26 | Paper |
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
| 2020-10-05 | Paper |
Finding detours is fixed-parameter tractable
| 2020-05-27 | Paper |
Finding detours is fixed-parameter tractable
SIAM Journal on Discrete Mathematics | 2019-11-27 | Paper |
Inapproximability of the independent set polynomial in the complex plane
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Approximation via Correlation Decay When Strong Spatial Mixing Fails
SIAM Journal on Computing | 2019-05-07 | Paper |
Approximation via correlation decay when strong spatial mixing fails
| 2017-12-19 | Paper |
Integrating and sampling cuts in bounded treewidth graphs
Association for Women in Mathematics Series | 2016-11-16 | Paper |
Minimum planar multi-sink cuts with connectivity priors
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics | 2014-05-05 | Paper |
Computing and counting longest paths on circular-arc graphs in polynomial time
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Algorithmica | 2013-04-03 | Paper |
Contiguous minimum single-source-multi-sink cuts in weighted planar graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time
Theoretical Computer Science | 2012-03-13 | Paper |
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Sampling binary contingency tables with a greedy start
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Accelerating simulated annealing for the permanent and combinatorial counting problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Sampling Edge Covers in 3-Regular Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
SIAM Journal on Computing | 2008-10-28 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Sampling binary contingency tables with a greedy start
Random Structures & Algorithms | 2007-02-07 | Paper |
