default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob Focke
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Jacob Focke
, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data 2(2): 113 (2024)- [j7]Jacob Focke, Marc Roth:
Counting Small Induced Subgraphs with Hereditary Properties. SIAM J. Comput. 53(2): 189-220 (2024) - [j6]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms 20(2): 11 (2024) - [c12]Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx:
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG 2024: 57:1-57:15 - [c11]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. ESA 2024: 39:1-39:20 - [c10]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can It Be? ESA 2024: 55:1-55:21 - [c9]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP 2024: 34:1-34:17 - [i14]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR abs/2402.07331 (2024) - [i13]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024) - 2023
- [c8]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA 2023: 3664-3683 - [i12]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR abs/2306.03640 (2023) - [i11]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR abs/2311.10634 (2023) - [i10]Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx:
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR abs/2312.11086 (2023) - 2022
- [c7]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS 2022: 315-324 - [c6]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA 2022: 431-458 - [c5]Jacob Focke, Marc Roth:
Counting small induced subgraphs with hereditary properties. STOC 2022: 1543-1551 - [i9]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR abs/2210.10677 (2022) - [i8]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR abs/2211.04278 (2022) - 2021
- [j5]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. SIAM J. Discret. Math. 35(4): 2749-2814 (2021) - [j4]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms 17(3): 22:1-22:51 (2021) - [c4]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. SODA 2021: 2303-2314 - [i7]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR abs/2103.12468 (2021) - [i6]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR abs/2107.06889 (2021) - [i5]Jacob Focke, Marc Roth:
Counting Small Induced Subgraphs with Hereditary Properties. CoRR abs/2111.02277 (2021) - 2020
- [j3]Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. ACM J. Exp. Algorithmics 25: 1-20 (2020) - [j2]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory 12(3): 15:1-15:43 (2020) - [i4]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. CoRR abs/2006.16632 (2020)
2010 – 2019
- 2019
- [j1]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. 33(2): 1006-1043 (2019) - [c3]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. SODA 2019: 2205-2215 - [i3]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR abs/1907.02319 (2019) - 2018
- [c2]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. SODA 2018: 1772-1781 - [i2]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. CoRR abs/1807.00590 (2018) - 2017
- [c1]Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA 2017: 22:1-22:14 - [i1]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. CoRR abs/1706.08786 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
