Anton Herrmann

According to our database, Anton Herrmann authored at least 4 papers between 2025 and 2026.

Collaborative distances:

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

2026

Parameterized Algorithms for Computing MAD Trees.

Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein, Camille Richer

CoRR, March, 2026

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density.

Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions.

Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set.

Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025