Segui
Jacob Focke
Jacob Focke
CISPA Helmholtz Center for Information Security
Email verificata su cispa.de
Titolo
Citata da
Citata da
Anno
Minimum spanning tree under explorable uncertainty in theory and experiments
J Focke, N Megow, J Meißner
Journal of Experimental Algorithmics (JEA) 25, 1-20, 2020
262020
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
J Focke, D Marx, P Rzążewski
ACM Transactions on Algorithms 20 (2), 1-32, 2024
182024
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
142023
Counting small induced subgraphs with hereditary properties
J Focke, M Roth
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
142022
The complexity of counting surjective homomorphisms and compactions
J Focke, LA Goldberg, S Zivny
SIAM Journal on Discrete Mathematics 33 (2), 1006-1043, 2019
132019
Approximately counting answers to conjunctive queries with disequalities and negations
J Focke, LA Goldberg, M Roth, S Zivný
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
92022
Counting Homomorphisms to -Minor-Free Graphs, Modulo 2
J Focke, LA Goldberg, M Roth, S Živný
SIAM Journal on Discrete Mathematics 35 (4), 2749-2814, 2021
72021
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
BC Esmer, J Focke, D Marx, P Rzążewski
arXiv preprint arXiv:2210.10677, 2022
32022
The complexity of approximately counting retractions
J Focke, LA Goldberg, S Živný
ACM Transactions on Computation Theory (TOCT) 12 (3), 1-43, 2020
32020
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
J Focke, LA Goldberg, M Roth, S Zivný
Proceedings of the ACM on Management of Data 2 (2), 1-17, 2024
22024
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
BC Esmer, J Focke, D Marx, P Rzążewski
arXiv preprint arXiv:2402.07331, 2024
22024
The complexity of approximately counting retractions to square-free graphs
J Focke, LA Goldberg, S Živný
ACM Transactions on Algorithms (TALG) 17 (3), 1-51, 2021
22021
Hitting Meets Packing: How Hard Can it Be?
J Focke, F Frei, S Li, D Marx, P Schepper, R Sharma, K Węgrzycki
arXiv preprint arXiv:2402.14927, 2024
12024
ACM Transactions on
J Focke, D Marx, P Rzążewski, EJ Kim, S Kratsch, M Pilipczuk, ...
ACM Transactions on 20 (2), 2024
2024
Multicut problems in embedded graphs: The dependency of complexity on the demand pattern
J Focke, F Hörsch, S Li, D Marx
arXiv preprint arXiv:2312.11086, 2023
2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
arXiv preprint arXiv:2211.04278, 2022
2022
On the complexity of counting homomorphisms under surjectivity constraints
J Focke
University of Oxford, 2020
2020
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–17