Jakob Baumann

According to our database, Jakob Baumann authored at least 6 papers between 2023 and 2026.

Collaborative distances:

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

2026

Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings.

Jakob Baumann, Ignaz Rutter, Dirk Sudholt

Algorithmica, June, 2026

2025

Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation.

Jakob Baumann, Ignaz Rutter, Dirk Sudholt

Proceedings of the Genetic and Evolutionary Computation Conference, 2025

2024

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation.

Jakob Baumann, Ignaz Rutter, Dirk Sudholt

CoRR, 2024

Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings.

Jakob Baumann, Ignaz Rutter, Dirk Sudholt

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract).

Jakob Baumann, Ignaz Rutter, Dirk Sudholt

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1.

Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023