| Publication | Date of Publication | Type |
|---|
Parameterizing the permanent: hardness for fixed excluded minors
| 2024-05-14 | Paper |
Computing linear arithmetic representation of reachability relation of one-counter automata
| 2022-09-01 | Paper |
Dichotomy for Holant\(^\ast\) problems on the Boolean domain
Theory of Computing Systems | 2021-06-11 | Paper |
Rectangle transformation problem
Algorithmica | 2019-05-21 | Paper |
Dichotomy for Holant* problems with a function on domain size 3
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Splitting and jump inversion in the Turing degrees
Computability | 2018-09-20 | Paper |
Complexity classification of the six-vertex model
Information and Computation | 2018-03-21 | Paper |
Dichotomy for real Holant\(^{\mathrm c}\) problems
| 2018-03-15 | Paper |
Dichotomy for Holant* problems of Boolean domain
| 2017-09-29 | Paper |
Base collapse of holographic algorithms
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Variable Version Lov\'asz Local Lemma: Beyond Shearer's Bound
| 2017-09-15 | Paper |
Holographic algorithms with matchgates capture precisely tractable planar \#CSP
SIAM Journal on Computing | 2017-05-30 | Paper |
Counting \(K_4\)-subdivisions
Discrete Mathematics | 2015-08-05 | Paper |
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The complexity of complex weighted Boolean \#CSP
Journal of Computer and System Sciences | 2014-01-28 | Paper |
A theory for Valiant's matchcircuits (Extended abstract)
| 2013-03-19 | Paper |
Holographic algorithms by Fibonacci gates
Linear Algebra and its Applications | 2013-01-16 | Paper |
Holographic reduction, interpolation and hardness
Computational Complexity | 2012-12-27 | Paper |
The complexity of weighted Boolean \#CSP modulo \(k\)
| 2012-01-23 | Paper |
Computational complexity of Holant problems
SIAM Journal on Computing | 2011-11-07 | Paper |
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science | 2011-05-18 | Paper |
Holographic reduction: a domain changed application and its partial converse theorems
Automata, Languages and Programming | 2010-09-07 | Paper |
A Computational Proof of Complexity of Some Restricted Counting Problems
Lecture Notes in Computer Science | 2009-06-03 | Paper |
An approximation algorithm to the \(k\)-Steiner forest problem
Theoretical Computer Science | 2009-03-20 | Paper |
Maximum Edge-Disjoint Paths Problem in Planar Graphs
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Computational complexity of counting problems on 3-regular planar graphs
Theoretical Computer Science | 2007-09-28 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
