Philip Wellnitz

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 35

Top Topics

Tight Complexity Bounds

Subgraph Mining

Top Venues

Publications

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs. CoRR (2024)
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
On the Communication Complexity of Approximate Pattern Matching. STOC (2024)
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
On the Communication Complexity of Approximate Pattern Matching. CoRR (2024)
Simon Döring, Dániel Marx, Philip Wellnitz
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. CoRR (2024)
Simon Döring, Dániel Marx, Philip Wellnitz
Counting Small Induced Subgraphs with Edge-Monotone Properties. STOC (2024)
Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz
Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. 37 (2) (2023)
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)
Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Optimal Algorithms for Bounded Weighted Edit Distance. CoRR (2023)
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 (2023)
Simon Döring, Dániel Marx, Philip Wellnitz
Counting Small Induced Subgraphs with Edge-monotone Properties. CoRR (2023)
Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Optimal Algorithms for Bounded Weighted Edit Distance. FOCS (2023)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Pattern Matching under Edit Distance. CoRR (2022)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS (2022)
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. CoRR (2022)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84 (5) (2022)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica 84 (2) (2022)
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. ICALP (2021)
Karl Bringmann, Philip Wellnitz
On Near-Linear-Time Algorithms for Dense Subset Sum. SODA (2021)
Karl Bringmann, Philip Wellnitz
On Near-Linear-Time Algorithms for Dense Subset Sum. CoRR (2020)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP (2020)
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 (2020)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing\newline Time on a Single Machine. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Approximate Pattern Matching: A Unified Approach. CoRR (2020)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
Faster Approximate Pattern Matching: A Unified Approach. FOCS (2020)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS (2020)
Marc Roth, Philip Wellnitz
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. SODA (2020)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS (2019)
Holger Dell, Marc Roth, Philip Wellnitz
Counting Answers to Existential Questions. ICALP (2019)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR (2019)
Karl Bringmann, Philip Wellnitz, Marvin Künnemann
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. SODA (2019)
Holger Dell, Marc Roth, Philip Wellnitz
Counting Answers to Existential Questions. CoRR (2019)
Marc Roth, Philip Wellnitz
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. CoRR (2019)
Karl Bringmann, Philip Wellnitz
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CoRR (2018)
Karl Bringmann, Philip Wellnitz
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CPM (2017)