1 citations · 3 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring
Till Fluschnik, Pascal Kunz
We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define…
cs.CC2021
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives
Pascal Kunz, Till Fluschnik, Rolf Niedermeier +1
Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computation…