Jacob Focke
Orcid: 0000-0002-6895-755XAffiliations:
- CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
According to our database1,
Jacob Focke
authored at least 17 papers
between 2019 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
1
3
1
1
2
2
1
4
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations.
ACM Trans. Algorithms, January, 2025
2024
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.
ACM Trans. Algorithms, April, 2024
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity.
Proc. ACM Manag. Data, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
CoRR, 2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.
CoRR, 2022
2021
ACM Trans. Algorithms, 2021
SIAM J. Discret. Math., 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
ACM Trans. Comput. Theory, 2020
ACM J. Exp. Algorithmics, 2020
2019
SIAM J. Discret. Math., 2019