3 papers
cs.DS2026
Fast Deterministic Distributed Degree Splitting
Yannic Maus, Alexandre Nolin, Florian Schager
We obtain better algorithms for computing more balanced orientations and degree splits in LOCAL. Important to our result is a connection to the hypergraph sinkless orientation prob…
math.CO2024
A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
Florian Schager, Michael Wallner
We present a novel bijection between stacked directed polyominoes and Motzkin paths with catastrophes. Further, we leverage this new bridge between these two worlds to obtain a bet…
cs.CG2023
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand, Robert Ganian, Sebastian Röder +1
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly , where the number of bend…