Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

We investigate the complexity of several fundamental polynomial-time solvable problems on
graphs and on matrices, when the given instance has low treewidth; in the case of matrices …

Quantum low-density parity-check (LDPC) codes are an important class of quantum error
correcting codes. In such codes, each qubit only affects a constant number of syndrome bits …

Equality graphs (e-graphs) are used to compactly represent equivalence classes of terms in
symbolic reasoning systems. Beyond their original roots in automated theorem proving, e …

Abstract Propositional model counting (# SAT), the problem of determining the number of
satisfying assignments of a propositional formula, is the archetypical# P-complete problem …

Treewidth is a parameter that measures how tree-like a relational instance is, and whether it
can reasonably be decomposed into a tree. Many computation tasks are known to be …

One of the key problems in tensor network based quantum circuit simulation is the
construction of a contraction tree which minimizes the cost of the simulation, where the cost …

Probabilistic reasoning, parameter learning, and most probable explanation inference for
answer set programming have recently received growing attention. They are only some of …

Abstract Answer Set Programming (ASP) is a paradigm for modeling and solving problems
for knowledge representation and reasoning. There are plenty of results dedicated to …

Bounded treewidth is one of the most cited combinatorial invariants in the literature. It was
also applied for solving several counting problems efficiently. A canonical counting problem …