default search action
Philip Wellnitz
Person information
- affiliation: National Institute of Informatics, Japan
- affiliation (former): Max Planck Institute for Informatics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [c18]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. SODA 2025: 517-534 - [c17]Simon Döring, Dániel Marx, Philip Wellnitz:
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. SODA 2025: 3637-3676 - [c16]Jakob Greilhuber
, Philipp Schepper, Philip Wellnitz:
Residue Domination in Bounded-Treewidth Graphs. STACS 2025: 41:1-41:20 - 2024
- [j4]Marc Roth
Counting Small Induced Subgraphs Satisfying Monotone Properties. SIAM J. Comput. 53(6): S20-139 (2024) - [c15]Simon Döring
Counting Small Induced Subgraphs with Edge-Monotone Properties. STOC 2024: 1517-1525 - [c14]Tomasz Kociumaka
On the Communication Complexity of Approximate Pattern Matching. STOC 2024: 1758-1768 - [i18]Jakob Greilhuber, Philipp Schepper, Philip Wellnitz:
Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs. CoRR abs/2403.07524 (2024) - [i17]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
On the Communication Complexity of Approximate Pattern Matching. CoRR abs/2403.18812 (2024) - [i16]Simon Döring, Dániel Marx, Philip Wellnitz:
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. CoRR abs/2407.06801 (2024) - [i15]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. CoRR abs/2410.06808 (2024) - 2023
- [j3]Norbert Peyerimhoff, Marc Roth
Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. 37(2): 405-486 (2023) - [c13]Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Optimal Algorithms for Bounded Weighted Edit Distance. FOCS 2023: 2177-2187 - [c12]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 - [i14]Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Optimal Algorithms for Bounded Weighted Edit Distance. CoRR abs/2305.06659 (2023) - [i13]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) - [i12]Simon Döring, Dániel Marx, Philip Wellnitz
Counting Small Induced Subgraphs with Edge-monotone Properties. CoRR abs/2311.08988 (2023) - 2022
- [j2]Julian Dörfler, Marc Roth
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica 84(2): 379-404 (2022) - [j1]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84(5): 1341-1356 (2022) - [c11]Panagiotis Charalampopoulos
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS 2022: 698-707 - [i11]Panagiotis Charalampopoulos
Faster Pattern Matching under Edit Distance. CoRR abs/2204.03087 (2022) - [i10]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
- [b1]Philip Wellnitz:
Counting Patterns in Strings and Graphs. Saarland University, Germany, 2021 - [c10]Marc Roth
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. ICALP 2021: 108:1-108:16 - [c9]Karl Bringmann, Philip Wellnitz:
On Near-Linear-Time Algorithms for Dense Subset Sum. SODA 2021: 1777-1796 - 2020
- [c8]Panagiotis Charalampopoulos
Faster Approximate Pattern Matching: A Unified Approach. FOCS 2020: 978-989 - [c7]Marc Roth
Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS 2020: 1356-1367 - [c6]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP 2020: 19:1-19:12 - [c5]Marc Roth
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. SODA 2020: 2161-2180 - [i9]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2003.07104 (2020) - [i8]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR abs/2004.06595 (2020) - [i7]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Approximate Pattern Matching: A Unified Approach. CoRR abs/2004.08350 (2020) - [i6]Karl Bringmann, Philip Wellnitz:
On Near-Linear-Time Algorithms for Dense Subset Sum. CoRR abs/2010.09096 (2020) - [i5]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR abs/2011.03433 (2020)
2010 – 2019
- 2019
- [c4]Holger Dell
Counting Answers to Existential Questions. ICALP 2019: 113:1-113:15 - [c3]Julian Dörfler
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS 2019: 26:1-26:14 - [c2]Karl Bringmann, Marvin Künnemann, Philip Wellnitz
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. SODA 2019: 1126-1145 - [i4]Holger Dell, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. CoRR abs/1902.04960 (2019) - [i3]Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR abs/1904.10479 (2019) - [i2]Marc Roth, Philip Wellnitz:
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. CoRR abs/1907.03850 (2019) - 2018
- [i1]Karl Bringmann, Philip Wellnitz:
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CoRR abs/1803.00804 (2018) - 2017
- [c1]Karl Bringmann, Philip Wellnitz
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CPM 2017: 12:1-12:14
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 2025-03-04 22:16 CET 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: