Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDPhilip Wellnitz
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[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, Philip Wellnitz:
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\newline 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, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. ICALP 2019: 113:1-113:15 - [c3]Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS 2019: 26:1-26:14 - [c2]Karl Bringmann, Philip Wellnitz, Marvin Künnemann:
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-11-13 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
