BibTeX records: Philip Wellnitz

download as .bib file

@inproceedings{DBLP:conf/stoc/DoringMW24,
  author       = {Simon D{\"{o}}ring and
                  D{\'{a}}niel Marx and
                  Philip Wellnitz},
  title        = {Counting Small Induced Subgraphs with Edge-Monotone Properties},
  booktitle    = {{STOC}},
  pages        = {1517--1525},
  publisher    = {{ACM}},
  year         = {2024}
}

@inproceedings{DBLP:conf/stoc/KociumakaNW24,
  author       = {Tomasz Kociumaka and
                  Jakob Nogler and
                  Philip Wellnitz},
  title        = {On the Communication Complexity of Approximate Pattern Matching},
  booktitle    = {{STOC}},
  pages        = {1758--1768},
  publisher    = {{ACM}},
  year         = {2024}
}

@article{DBLP:journals/corr/abs-2403-07524,
  author       = {Jakob Greilhuber and
                  Philipp Schepper and
                  Philip Wellnitz},
  title        = {Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs},
  journal      = {CoRR},
  volume       = {abs/2403.07524},
  year         = {2024}
}

@article{DBLP:journals/corr/abs-2403-18812,
  author       = {Tomasz Kociumaka and
                  Jakob Nogler and
                  Philip Wellnitz},
  title        = {On the Communication Complexity of Approximate Pattern Matching},
  journal      = {CoRR},
  volume       = {abs/2403.18812},
  year         = {2024}
}

@article{DBLP:journals/corr/abs-2407-06801,
  author       = {Simon D{\"{o}}ring and
                  D{\'{a}}niel Marx and
                  Philip Wellnitz},
  title        = {From Graph Properties to Graph Parameters: Tight Bounds for Counting
                  on Small Subgraphs},
  journal      = {CoRR},
  volume       = {abs/2407.06801},
  year         = {2024}
}

@article{DBLP:journals/siamdm/PeyerimhoffRSSVW23,
  author       = {Norbert Peyerimhoff and
                  Marc Roth and
                  Johannes Schmitt and
                  Jakob Stix and
                  Alina Vdovina and
                  Philip Wellnitz},
  title        = {Parameterized Counting and Cayley Graph Expanders},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {37},
  number       = {2},
  pages        = {405--486},
  year         = {2023}
}

@inproceedings{DBLP:conf/focs/CassisKW23,
  author       = {Alejandro Cassis and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Optimal Algorithms for Bounded Weighted Edit Distance},
  booktitle    = {{FOCS}},
  pages        = {2177--2187},
  publisher    = {{IEEE}},
  year         = {2023}
}

@inproceedings{DBLP:conf/soda/FockeMINSSW23,
  author       = {Jacob Focke and
                  D{\'{a}}niel Marx and
                  Fionn Mc Inerney and
                  Daniel Neuen and
                  Govind S. Sankar and
                  Philipp Schepper and
                  Philip Wellnitz},
  title        = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
                  Bounded-Treewidth Graphs},
  booktitle    = {{SODA}},
  pages        = {3664--3683},
  publisher    = {{SIAM}},
  year         = {2023}
}

@article{DBLP:journals/corr/abs-2305-06659,
  author       = {Alejandro Cassis and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Optimal Algorithms for Bounded Weighted Edit Distance},
  journal      = {CoRR},
  volume       = {abs/2305.06659},
  year         = {2023}
}

@article{DBLP:journals/corr/abs-2306-03640,
  author       = {Jacob Focke and
                  D{\'{a}}niel Marx and
                  Fionn Mc Inerney and
                  Daniel Neuen and
                  Govind S. Sankar and
                  Philipp Schepper and
                  Philip Wellnitz},
  title        = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
                  Bounded-Treewidth Graphs Part {II:} Hardness Results},
  journal      = {CoRR},
  volume       = {abs/2306.03640},
  year         = {2023}
}

@article{DBLP:journals/corr/abs-2311-08988,
  author       = {Simon D{\"{o}}ring and
                  D{\'{a}}niel Marx and
                  Philip Wellnitz},
  title        = {Counting Small Induced Subgraphs with Edge-monotone Properties},
  journal      = {CoRR},
  volume       = {abs/2311.08988},
  year         = {2023}
}

@article{DBLP:journals/algorithmica/DorflerRSW22,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-Hardness},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {2},
  pages        = {379--404},
  year         = {2022}
}

@article{DBLP:journals/algorithmica/BringmannFHSW22,
  author       = {Karl Bringmann and
                  Nick Fischer and
                  Danny Hermelin and
                  Dvir Shabtay and
                  Philip Wellnitz},
  title        = {Faster Minimization of Tardy Processing Time on a Single Machine},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {5},
  pages        = {1341--1356},
  year         = {2022}
}

@inproceedings{DBLP:conf/focs/Charalampopoulos22,
  author       = {Panagiotis Charalampopoulos and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Faster Pattern Matching under Edit Distance : {A} Reduction to Dynamic
                  Puzzle Matching and the Seaweed Monoid of Permutation Matrices},
  booktitle    = {{FOCS}},
  pages        = {698--707},
  publisher    = {{IEEE}},
  year         = {2022}
}

@article{DBLP:journals/corr/abs-2204-03087,
  author       = {Panagiotis Charalampopoulos and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Faster Pattern Matching under Edit Distance},
  journal      = {CoRR},
  volume       = {abs/2204.03087},
  year         = {2022}
}

@article{DBLP:journals/corr/abs-2211-04278,
  author       = {Jacob Focke and
                  D{\'{a}}niel Marx and
                  Fionn Mc Inerney and
                  Daniel Neuen and
                  Govind S. Sankar and
                  Philipp Schepper and
                  Philip Wellnitz},
  title        = {Tight Complexity Bounds for Counting Generalized Dominating Sets in
                  Bounded-Treewidth Graphs Part {I:} Algorithmic Results},
  journal      = {CoRR},
  volume       = {abs/2211.04278},
  year         = {2022}
}

@phdthesis{DBLP:phd/de/Wellnitz21,
  author       = {Philip Wellnitz},
  title        = {Counting Patterns in Strings and Graphs},
  school       = {Saarland University, Germany},
  year         = {2021}
}

@inproceedings{DBLP:conf/icalp/Roth0W21,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Detecting and Counting Small Subgraphs, and Evaluating a Parameterized
                  Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph
                  Expanders},
  booktitle    = {{ICALP}},
  series       = {LIPIcs},
  volume       = {198},
  pages        = {108:1--108:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021}
}

@inproceedings{DBLP:conf/soda/BringmannW21,
  author       = {Karl Bringmann and
                  Philip Wellnitz},
  title        = {On Near-Linear-Time Algorithms for Dense Subset Sum},
  booktitle    = {{SODA}},
  pages        = {1777--1796},
  publisher    = {{SIAM}},
  year         = {2021}
}

@inproceedings{DBLP:conf/focs/Charalampopoulos20,
  author       = {Panagiotis Charalampopoulos and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Faster Approximate Pattern Matching: {A} Unified Approach},
  booktitle    = {{FOCS}},
  pages        = {978--989},
  publisher    = {{IEEE}},
  year         = {2020}
}

@inproceedings{DBLP:conf/focs/Roth0W20,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
  booktitle    = {{FOCS}},
  pages        = {1356--1367},
  publisher    = {{IEEE}},
  year         = {2020}
}

@inproceedings{DBLP:conf/icalp/BringmannFHSW20,
  author       = {Karl Bringmann and
                  Nick Fischer and
                  Danny Hermelin and
                  Dvir Shabtay and
                  Philip Wellnitz},
  title        = {Faster Minimization of Tardy Processing Time on a Single Machine},
  booktitle    = {{ICALP}},
  series       = {LIPIcs},
  volume       = {168},
  pages        = {19:1--19:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020}
}

@inproceedings{DBLP:conf/soda/RothW20,
  author       = {Marc Roth and
                  Philip Wellnitz},
  title        = {Counting and Finding Homomorphisms is Universal for Parameterized
                  Complexity Theory},
  booktitle    = {{SODA}},
  pages        = {2161--2180},
  publisher    = {{SIAM}},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2003-07104,
  author       = {Karl Bringmann and
                  Nick Fischer and
                  Danny Hermelin and
                  Dvir Shabtay and
                  Philip Wellnitz},
  title        = {Faster Minimization of Tardy Processing Time on a Single Machine},
  journal      = {CoRR},
  volume       = {abs/2003.07104},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2004-06595,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
  journal      = {CoRR},
  volume       = {abs/2004.06595},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2004-08350,
  author       = {Panagiotis Charalampopoulos and
                  Tomasz Kociumaka and
                  Philip Wellnitz},
  title        = {Faster Approximate Pattern Matching: {A} Unified Approach},
  journal      = {CoRR},
  volume       = {abs/2004.08350},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2010-09096,
  author       = {Karl Bringmann and
                  Philip Wellnitz},
  title        = {On Near-Linear-Time Algorithms for Dense Subset Sum},
  journal      = {CoRR},
  volume       = {abs/2010.09096},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2011-03433,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Detecting and Counting Small Subgraphs, and Evaluating a Parameterized
                  Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph
                  Expanders},
  journal      = {CoRR},
  volume       = {abs/2011.03433},
  year         = {2020}
}

@inproceedings{DBLP:conf/icalp/DellRW19,
  author       = {Holger Dell and
                  Marc Roth and
                  Philip Wellnitz},
  title        = {Counting Answers to Existential Questions},
  booktitle    = {{ICALP}},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {113:1--113:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019}
}

@inproceedings{DBLP:conf/mfcs/DorflerRSW19,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-hardness},
  booktitle    = {{MFCS}},
  series       = {LIPIcs},
  volume       = {138},
  pages        = {26:1--26:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019}
}

@inproceedings{DBLP:conf/soda/BringmannWK19,
  author       = {Karl Bringmann and
                  Marvin K{\"{u}}nnemann and
                  Philip Wellnitz},
  title        = {Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches
                  in Compressed Texts},
  booktitle    = {{SODA}},
  pages        = {1126--1145},
  publisher    = {{SIAM}},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1902-04960,
  author       = {Holger Dell and
                  Marc Roth and
                  Philip Wellnitz},
  title        = {Counting Answers to Existential Questions},
  journal      = {CoRR},
  volume       = {abs/1902.04960},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1904-10479,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-hardness},
  journal      = {CoRR},
  volume       = {abs/1904.10479},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1907-03850,
  author       = {Marc Roth and
                  Philip Wellnitz},
  title        = {Counting and Finding Homomorphisms is Universal for Parameterized
                  Complexity Theory},
  journal      = {CoRR},
  volume       = {abs/1907.03850},
  year         = {2019}
}

@article{DBLP:journals/corr/abs-1803-00804,
  author       = {Karl Bringmann and
                  Philip Wellnitz},
  title        = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
  journal      = {CoRR},
  volume       = {abs/1803.00804},
  year         = {2018}
}

@inproceedings{DBLP:conf/cpm/BringmannW17,
  author       = {Karl Bringmann and
                  Philip Wellnitz},
  title        = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
  booktitle    = {{CPM}},
  series       = {LIPIcs},
  volume       = {78},
  pages        = {12:1--12:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017}
}

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.