Philip Wellnitz

From MaRDI portal
Person:832519

Available identifiers

zbMath Open wellnitz.philipMaRDI QIDQ832519

List of research outcomes





PublicationDate of PublicationType
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61473622024-01-15Paper
Parameterized Counting and Cayley Graph Expanders2023-05-31Paper
Counting Answers to Existential Questions2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50923852022-07-21Paper
Faster minimization of tardy processing time on a single machine2022-05-03Paper
Counting Small Induced Subgraphs Satisfying Monotone Properties2022-04-20Paper
Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness2022-03-25Paper
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51108762020-05-25Paper
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts2019-10-15Paper
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness2019-04-23Paper

Research outcomes over time

This page was built for person: Philip Wellnitz

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:832519&oldid=7756440"
Powered by MediaWiki