Jacob Focke

Orcid: 0000-0002-6895-755X

Affiliations:
  • 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:

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
Other 

Links

Online presence:

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 Small Induced Subgraphs with Hereditary Properties.
SIAM J. Comput., 2024

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity.
Proc. ACM Manag. Data, 2024

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Hitting Meets Packing: How Hard Can It Be?
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
The Complexity of Approximately Counting Retractions to Square-free Graphs.
ACM Trans. Algorithms, 2021

Counting Homomorphisms to K<sub>4</sub>-Minor-Free Graphs, Modulo 2.
SIAM J. Discret. Math., 2021

Counting Homomorphisms to <i>K</i><sub>4</sub>-minor-free Graphs, modulo 2.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
The Complexity of Approximately Counting Retractions.
ACM Trans. Comput. Theory, 2020

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.
ACM J. Exp. Algorithmics, 2020

2019
The Complexity of Counting Surjective Homomorphisms and Compactions.
SIAM J. Discret. Math., 2019


  Loading...