Philip Wellnitz

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Faster minimization of tardy processing time on a single machine	2026-03-18	Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs	2024-05-14	Paper
scientific article; zbMATH DE number 7788445 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Parameterized Counting and Cayley Graph Expanders SIAM Journal on Discrete Mathematics	2023-05-31	Paper
Counting Answers to Existential Questions (available as arXiv preprint)	2022-07-21	Paper
Counting induced subgraphs: an algebraic approach to \#W[1-hardness] (available as arXiv preprint)	2022-07-21	Paper
Faster minimization of tardy processing time on a single machine Algorithmica	2022-05-03	Paper
Counting Small Induced Subgraphs Satisfying Monotone Properties SIAM Journal on Computing	2022-04-20	Paper
Counting induced subgraphs: an algebraic approach to \#W[1-hardness] Algorithmica	2022-03-25	Paper
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms	2021-02-02	Paper
Clique-based lower bounds for parsing tree-adjoining grammars (available as arXiv preprint)	2020-05-25	Paper
Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper
Counting Induced Subgraphs: An Algebraic Approach to #W[1-hardness] (available as arXiv preprint)	2019-04-23	Paper

Research outcomes over time

This page was built for person: Philip Wellnitz