Florian Schager
YOU?
Author Swipe
View article: Towards Optimal Distributed Edge Coloring with Fewer Colors
Towards Optimal Distributed Edge Coloring with Fewer Colors Open
There is a huge difference in techniques and runtimes of distributed algorithms for problems that can be solved by a sequential greedy algorithm and those that cannot. A prime example of this contrast appears in the edge coloring problem: …
View article: Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs Open
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 $90^\circ$, where the number of bends on such polylines is typically restricted in some way. Wh…
View article: A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes Open
We present a novel bijection between stacked directed polyominoes and Motzkin paths with alternative catastrophes. Further, we show how this new connection can be used in order to obtain a better understanding of certain parameters of stac…
View article: Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs Open
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 $90^\circ$, where the number of bends on such polylines is typically restricted in some way. Wh…