13 citations · 59 across the 31 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
Marek Cygan, Fabrizio Grandoni, Danny Hermelin
In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most . This graph class generalize…
cs.DS2013
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
Travis Gagie, Danny Hermelin, Gad M. Landau +1
Binary jumbled pattern matching asks to preprocess a binary string in order to answer queries which ask for a substring of that is of length and has exactly …