2 citations · 3 across the 8 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Finding Even Subgraphs Even Faster
Prachi Goyal, Pranabendu Misra, Fahad Panolan +2
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on vertices and a positive i…
cs.DS2014
Deterministic Truncation of Linear Matroids
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +1
Let be a matroid. A {\em -truncation} of is a matroid {} such that for any , if and only if and…