6 citations · 6 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Exact Algorithms via Multivariate Subroutines
Serge Gaspers, Edward Lee
We consider the family of -Subset problems, where the input consists of an instance of size over a universe of size and the task is to check whether the univer…
cs.DS2016
Faster Graph Coloring in Polynomial Space
Serge Gaspers, Edward Lee
We present a polynomial-space algorithm that computes the number independent sets of any input graph in time for graphs with maximum degree 3 and in time $O(1.2355^n)…