3 papers
cs.CC2026
Planar Perfect Matching Counting is as Hard as Determinants
Radu Curticapean, Jiaheng Wang
In the 1960s, Fisher, Kasteleyn and Temperley designed an ingenious algorithm for computing the partition function of the dimer model, or equivalently, for counting perfect matchin…
quant-ph2025
Electromagnetic Feature Extraction in Superconducting Quantum Circuits: An Open-Source Finite-Element Workflow Using Palace
Jiale Ye, Jiaheng Wang, Yu-xi Liu
Accurate electromagnetic (EM) feature extraction, including element characterization, eigenmodes, and field distributions, is essential for superconducting quantum circuit design.…
cs.DS2025
Can You Link Up With Treewidth?
Radu Curticapean, Simon Döring, Daniel Neuen +1
In a fundamental paper in parameterized complexity theory, Marx [ToC '10] constructed -vertex graphs of maximum degree such that time algorithms for d…