Julian Dörfler

According to our database, Julian Dörfler authored at least 11 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Which Graph Motif Parameters Count?

Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 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

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Probabilistic and Causal Satisfiability: Constraining the Model.

Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Probabilistic and Causal Satisfiability: the Impact of Marginalization.

Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz

CoRR, 2024

On the Complexity of Identification in Linear Structural Causal Models.

Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

The Existential Theory of the Reals with Summation Operators.

Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Functional Closure Properties of Finite ℕ-Weighted Automata.

Julian Dörfler, Christian Ikenmeyer

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

PosSLP and Sum of Squares.

Markus Bläser, Julian Dörfler, Gorav Jindal

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2022

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness.

Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz

Algorithmica, 2022

2021

On the Complexity of Evaluating Highest Weight Vectors.

Markus Bläser, Julian Dörfler, Christian Ikenmeyer

Proceedings of the 36th Computational Complexity Conference, 2021

2020

On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions.

Julian Dörfler, Christian Ikenmeyer, Greta Panova

SIAM J. Appl. Algebra Geom., 2020