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},
  editor    = {Artur Czumaj and
               Anuj Dawar and
               Emanuela Merelli},
  title     = {Faster Minimization of Tardy Processing Time on a Single Machine},
  booktitle = {47th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
               Conference)},
  series    = {LIPIcs},
  volume    = {168},
  pages     = {19:1--19:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2020.19},
  doi       = {10.4230/LIPIcs.ICALP.2020.19},
  timestamp = {Tue, 30 Jun 2020 15:05:06 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/BringmannFHSW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RothW20,
  author    = {Marc Roth and
               Philip Wellnitz},
  editor    = {Shuchi Chawla},
  title     = {Counting and Finding Homomorphisms is Universal for Parameterized
               Complexity Theory},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {2161--2180},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.133},
  doi       = {10.1137/1.9781611975994.133},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/RothW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {https://arxiv.org/abs/2003.07104},
  archivePrefix = {arXiv},
  eprint    = {2003.07104},
  timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2003-07104.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {https://arxiv.org/abs/2004.06595},
  archivePrefix = {arXiv},
  eprint    = {2004.06595},
  timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-06595.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {https://arxiv.org/abs/2004.08350},
  archivePrefix = {arXiv},
  eprint    = {2004.08350},
  timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-08350.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DellRW19,
  author    = {Holger Dell and
               Marc Roth and
               Philip Wellnitz},
  editor    = {Christel Baier and
               Ioannis Chatzigiannakis and
               Paola Flocchini and
               Stefano Leonardi},
  title     = {Counting Answers to Existential Questions},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series    = {LIPIcs},
  volume    = {132},
  pages     = {113:1--113:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.113},
  doi       = {10.4230/LIPIcs.ICALP.2019.113},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/DellRW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DorflerRSW19,
  author    = {Julian D{\"{o}}rfler and
               Marc Roth and
               Johannes Schmitt and
               Philip Wellnitz},
  editor    = {Peter Rossmanith and
               Pinar Heggernes and
               Joost{-}Pieter Katoen},
  title     = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-hardness},
  booktitle = {44th International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series    = {LIPIcs},
  volume    = {138},
  pages     = {26:1--26:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2019.26},
  doi       = {10.4230/LIPIcs.MFCS.2019.26},
  timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/mfcs/DorflerRSW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannWK19,
  author    = {Karl Bringmann and
               Philip Wellnitz and
               Marvin K{\"{u}}nnemann},
  editor    = {Timothy M. Chan},
  title     = {Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches
               in Compressed Texts},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1126--1145},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482.69},
  doi       = {10.1137/1.9781611975482.69},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/BringmannWK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1902.04960},
  archivePrefix = {arXiv},
  eprint    = {1902.04960},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1902-04960.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1904.10479},
  archivePrefix = {arXiv},
  eprint    = {1904.10479},
  timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1904-10479.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1907.03850},
  archivePrefix = {arXiv},
  eprint    = {1907.03850},
  timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1907-03850.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1803.00804},
  archivePrefix = {arXiv},
  eprint    = {1803.00804},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1803-00804.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BringmannW17,
  author    = {Karl Bringmann and
               Philip Wellnitz},
  editor    = {Juha K{\"{a}}rkk{\"{a}}inen and
               Jakub Radoszewski and
               Wojciech Rytter},
  title     = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
  booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
               July 4-6, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {78},
  pages     = {12:1--12:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.CPM.2017.12},
  doi       = {10.4230/LIPIcs.CPM.2017.12},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/cpm/BringmannW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics