1 citations · 1 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Finding and Counting Patterns in Sparse Graphs
Balagopal Komarath, Anant Kumar, Suchismita Mishra +1
We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In the non-sparse setting, the parameters treedepth and treewidth play a crucial role in…
cs.DS2020
Red-Blue Point Separation for Points on a Circle
Neeldhara Misra, Harshil Mittal, Aditi Sethia
Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each c…