Items where Author is "Wellnitz, Philip"

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

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)

This list was generated on Sun Apr 28 11:38:10 2024 CEST.