Items where Author is "Sankar, Govind"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 2.

Focke, Jacob and Marx, Dániel and Mc Inerney, Fionn and Neuen, Daniel and Sankar, Govind and Schepper, Philipp and Wellnitz, Philip
(2023) Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(In Press)

Marx, Dániel and Sankar, Govind and Schepper, Philipp
(2022) Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard).
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

This list was generated on Sun Dec 22 02:44:27 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.