1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.NE2024
Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
Jakob Baumann, Ignaz Rutter, Dirk Sudholt
Evolutionary algorithms (EAs) are universal solvers inspired by principles of natural evolution. In many applications, EAs produce astonishingly good solutions. As they are able to…
cs.DS2023★ 1 cited
Parameterized Complexity of Vertex Splitting to Pathwidth at most 1
Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
Motivated by the planarization of 2-layered straight-line drawings, we consider the problem of modifying a graph such that the resulting graph has pathwidth at most 1. The problem…