5 citations · 17 across the 15 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Enumerations of Universal Cycles for -Permutations
Zuling Chang, Jie Xue
Universal cycle for -permutations is a cyclic arrangement in which each -permutation appears exactly once as consecutive elements. Enumeration problem of universal cycles…
cs.DS2021
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2
We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on -minor free graphs. In particular, we obtain the following resul…
cs.CG2021
Dynamic Geometric Set Cover, Revisited
Timothy M. Chan, Qizheng He, Subhash Suri +1
Geometric set cover is a classical problem in computational geometry, which has been extensively studied in the past. In the dynamic version of the problem, points and ranges may b…