On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. - Julian Dörfler; Christian Ikenmeyer; Greta Panova (SIAM J. Appl. Algebra Geom., 2020)

On the Complexity of Evaluating Highest Weight Vectors. - Markus Bläser; Julian Dörfler; Christian Ikenmeyer (CCC, 2021)

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. - Julian Dörfler; Marc Roth; Johannes Schmitt 002; Philip Wellnitz (Algorithmica, 2022)

PosSLP and Sum of Squares. - Markus Bläser; Julian Dörfler; Gorav Jindal (FSTTCS, 2024)

Functional Closure Properties of Finite ℕ-Weighted Automata. - Julian Dörfler; Christian Ikenmeyer (ICALP, 2024)

The Existential Theory of the Reals with Summation Operators. - Markus Bläser; Julian Dörfler; Maciej Liskiewicz; Benito van der Zander (ISAAC, 2024)

On the Complexity of Identification in Linear Structural Causal Models. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (NeurIPS, 2024)

Probabilistic and Causal Satisfiability: the Impact of Marginalization. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (CoRR, 2024)

Probabilistic and Causal Satisfiability: Constraining the Model. - Markus Bläser; Julian Dörfler; Maciej Liskiewicz; Benito van der Zander (ICALP, 2025)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy. - Julian Dörfler; Benito van der Zander; Markus Bläser; Maciej Liskiewicz (ICLR, 2025)

Which Graph Motif Parameters Count? - Markus Bläser; Radu Curticapean; Julian Dörfler; Christian Ikenmeyer (MFCS, 2025)