Items where Author is "Focke, Jacob"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Jump to: Conference or Workshop Item (A Paper) | Article
Number of items: 5.

Conference or Workshop Item (A Paper)

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)

Focke, Jacob and Roth, Marc
(2022) Counting Small Induced Subgraphs with Hereditary Properties.
In: STOC 2022.
Conference: STOC ACM Symposium on Theory of Computing

Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav
(2022) Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations.
In: PODS '22.
Conference: PODS ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems

Focke, Jacob and Marx, Dániel and Rzążewski, Paweł
(2022) Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.
In: SODA 2022 - ACM/SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Article

Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav
(2021) Counting Homomorphisms to K4-minor-free Graphs, modulo 2.
SIAM Journal on Discrete Mathematics, 35 (4). pp. 2749-2814. ISSN 0895-4801

This list was generated on Tue Dec 3 18:39:20 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.