Simon Döring

According to our database, Simon Döring authored at least 5 papers between 2024 and 2025.

Collaborative distances:

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

2025

The Complexity of Finding and Counting Subtournaments.

Simon Döring, Sarah Houdaigoui, Lucas Picasarri-Arrieta, Philip Wellnitz

CoRR, September, 2025

Can You Link Up With Treewidth?

Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs.

Simon Döring, Dániel Marx, Philip Wellnitz

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial.

Radu Curticapean, Simon Döring, Daniel Neuen

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Counting Small Induced Subgraphs with Edge-Monotone Properties.

Simon Döring, Dániel Marx, Philip Wellnitz

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024