4 citations · 6 across the 9 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Dániel Marx, Pranabendu Misra, Daniel Neuen +1
Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this pa…
cs.DS2021★ 4 cited
Isomorphism Testing Parameterized by Genus and Beyond
Daniel Neuen
We give an isomorphism test for graphs of Euler genus running in time . Our algorithm provides the first explicit upper bound on the dependence on $g…