5 citations · 6 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
The Complexity of Online Graph Games
Janosch Fuchs, Christoph Grüne, Tom Janßen
Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm receives requests which reveal the ins…
cs.DS2022
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Elisabet Burjons, Janosch Fuchs, Henri Lotze
In the area of graph drawing, the One-Sided Crossing Minimization Problem (OSCM) is defined on a bipartite graph with both vertex sets aligned parallel to each other and all edges…