Philip Wellnitz

48 papers A* 17A 1B 2Journal 27

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	The Parameterised Complexity of Counting Small Sub-Hypergraphs. SODA Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2025	A*	`conf`	From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. SODA Simon Döring, Dániel Marx, Philip Wellnitz
2025	A*	`conf`	Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. SODA Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2025	A*	`conf`	Pattern Matching under Weighted Edit Distance. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2025	J	`jnl`	Pattern Matching under Weighted Edit Distance. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2025	A	`conf`	Residue Domination in Bounded-Treewidth Graphs. STACS Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	The Complexity of Counting Small Sub-Hypergraphs. CoRR Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2025	J	`jnl`	The Complexity of Finding and Counting Subtournaments. CoRR Simon Döring, Sarah Houdaigoui, Lucas Picasarri-Arrieta, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. ACM Trans. Comput. Theory Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2024	J	`jnl`	Counting Small Induced Subgraphs Satisfying Monotone Properties. SIAM J. Comput. Marc Roth, Johannes Schmitt, Philip Wellnitz
2024	A*	`conf`	Counting Small Induced Subgraphs with Edge-Monotone Properties. STOC Simon Döring, Dániel Marx, Philip Wellnitz
2024	J	`jnl`	From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. CoRR Simon Döring, Dániel Marx, Philip Wellnitz
2024	J	`jnl`	Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. CoRR Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	A*	`conf`	On the Communication Complexity of Approximate Pattern Matching. STOC Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	J	`jnl`	On the Communication Complexity of Approximate Pattern Matching. CoRR Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024	J	`jnl`	Residue Domination in Bounded-Treewidth Graphs. CoRR Jakob Greilhuber, Philipp Schepper, Philip Wellnitz
2023	J	`jnl`	Counting Small Induced Subgraphs with Edge-monotone Properties. CoRR Simon Döring, Dániel Marx, Philip Wellnitz
2023	A*	`conf`	Optimal Algorithms for Bounded Weighted Edit Distance. FOCS Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
2023	J	`jnl`	Optimal Algorithms for Bounded Weighted Edit Distance. CoRR Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
2023	J	`jnl`	Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz
2023	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2023	A*	`conf`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2022	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2022	J	`jnl`	Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2022	A*	`conf`	Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2022	J	`jnl`	Faster Pattern Matching under Edit Distance. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2022	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2021	—	`—`	Counting Patterns in Strings and Graphs. Philip Wellnitz
2021	A*	`conf`	Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. ICALP Marc Roth, Johannes Schmitt, Philip Wellnitz
2021	A*	`conf`	On Near-Linear-Time Algorithms for Dense Subset Sum. SODA Karl Bringmann, Philip Wellnitz
2020	A*	`conf`	Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	J	`jnl`	Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	A*	`conf`	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. SODA Marc Roth, Philip Wellnitz
2020	J	`jnl`	Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	A*	`conf`	Faster Approximate Pattern Matching: A Unified Approach. FOCS Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020	J	`jnl`	Faster Approximate Pattern Matching: A Unified Approach. CoRR Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
2020	A*	`conf`	Faster Minimization of Tardy Processing Time on a Single Machine. ICALP Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020	J	`jnl`	Faster Minimization of Tardy Processing Time on a Single Machine. CoRR Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020	J	`jnl`	On Near-Linear-Time Algorithms for Dense Subset Sum. CoRR Karl Bringmann, Philip Wellnitz
2019	A*	`conf`	Counting Answers to Existential Questions. ICALP Holger Dell, Marc Roth, Philip Wellnitz
2019	J	`jnl`	Counting Answers to Existential Questions. CoRR Holger Dell, Marc Roth, Philip Wellnitz
2019	B	`conf`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	J	`jnl`	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. CoRR Marc Roth, Philip Wellnitz
2019	A*	`conf`	Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. SODA Karl Bringmann, Marvin Künnemann, Philip Wellnitz
2018	J	`jnl`	Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CoRR Karl Bringmann, Philip Wellnitz
2017	B	`conf`	Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CPM Karl Bringmann, Philip Wellnitz