BibTeX records: Philip Wellnitz

download as .bib file

@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{\textbackslash}newline 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}
}
@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
               Philip Wellnitz and
               Marvin K{\"{u}}nnemann},
  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}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics