BibTeX records: Philipp Zschoche

download as .bib file

@inproceedings{DBLP:conf/esa/KorenweinNNZ18,
  author    = {Viatcheslav Korenwein and
               Andr{\'{e}} Nichterlein and
               Rolf Niedermeier and
               Philipp Zschoche},
  title     = {Data Reduction for Maximum Matching on Real-World Graphs: Theory and
               Experiments},
  booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
               2018, Helsinki, Finland},
  pages     = {53:1--53:13},
  year      = {2018},
  crossref  = {DBLP:conf/esa/2018},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2018.53},
  doi       = {10.4230/LIPIcs.ESA.2018.53},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/KorenweinNNZ18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ZschocheFMN18,
  author    = {Philipp Zschoche and
               Till Fluschnik and
               Hendrik Molter and
               Rolf Niedermeier},
  title     = {The Complexity of Finding Small Separators in Temporal Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  pages     = {45:1--45:17},
  year      = {2018},
  crossref  = {DBLP:conf/mfcs/2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.45},
  doi       = {10.4230/LIPIcs.MFCS.2018.45},
  timestamp = {Tue, 28 Aug 2018 09:18:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/ZschocheFMN18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FluschnikMNZ18,
  author    = {Till Fluschnik and
               Hendrik Molter and
               Rolf Niedermeier and
               Philipp Zschoche},
  title     = {Temporal Graph Classes: {A} View Through Temporal Separators},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
               Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
  pages     = {216--227},
  year      = {2018},
  crossref  = {DBLP:conf/wg/2018},
  url       = {https://doi.org/10.1007/978-3-030-00256-5\_18},
  doi       = {10.1007/978-3-030-00256-5\_18},
  timestamp = {Mon, 03 Sep 2018 16:21:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/FluschnikMNZ18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00882,
  author    = {Till Fluschnik and
               Hendrik Molter and
               Rolf Niedermeier and
               Philipp Zschoche},
  title     = {Temporal Graph Classes: {A} View Through Temporal Separators},
  journal   = {CoRR},
  volume    = {abs/1803.00882},
  year      = {2018},
  url       = {http://arxiv.org/abs/1803.00882},
  archivePrefix = {arXiv},
  eprint    = {1803.00882},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1803-00882},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09683,
  author    = {Viatcheslav Korenwein and
               Andr{\'{e}} Nichterlein and
               Philipp Zschoche and
               Rolf Niedermeier},
  title     = {Data Reduction for Maximum Matching on Real-World Graphs: Theory and
               Experiments},
  journal   = {CoRR},
  volume    = {abs/1806.09683},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.09683},
  archivePrefix = {arXiv},
  eprint    = {1806.09683},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1806-09683},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-11527,
  author    = {Ren{\'{e}} van Bevern and
               Oxana Yu. Tsidulko and
               Philipp Zschoche},
  title     = {Facility location under matroid constraints: fixed-parameter algorithms
               and applications},
  journal   = {CoRR},
  volume    = {abs/1806.11527},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.11527},
  archivePrefix = {arXiv},
  eprint    = {1806.11527},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1806-11527},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KellerhalsKZBC17,
  author    = {Leon Kellerhals and
               Viatcheslav Korenwein and
               Philipp Zschoche and
               Robert Bredereck and
               Jiehua Chen},
  title     = {On the Computational Complexity of Variants of Combinatorial Voter
               Control in Elections},
  booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
               {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  pages     = {348--361},
  year      = {2017},
  crossref  = {DBLP:conf/tamc/2017},
  url       = {https://doi.org/10.1007/978-3-319-55911-7\_25},
  doi       = {10.1007/978-3-319-55911-7\_25},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/KellerhalsKZBC17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KellerhalsKZBC17,
  author    = {Leon Kellerhals and
               Viatcheslav Korenwein and
               Philipp Zschoche and
               Robert Bredereck and
               Jiehua Chen},
  title     = {On the Computational Complexity of Variants of Combinatorial Voter
               Control in Elections},
  journal   = {CoRR},
  volume    = {abs/1701.05108},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.05108},
  archivePrefix = {arXiv},
  eprint    = {1701.05108},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/KellerhalsKZBC17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00963,
  author    = {Philipp Zschoche and
               Till Fluschnik and
               Hendrik Molter and
               Rolf Niedermeier},
  title     = {The Computational Complexity of Finding Separators in Temporal Graphs},
  journal   = {CoRR},
  volume    = {abs/1711.00963},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.00963},
  archivePrefix = {arXiv},
  eprint    = {1711.00963},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1711-00963},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2018,
  editor    = {Yossi Azar and
               Hannah Bast and
               Grzegorz Herman},
  title     = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
               2018, Helsinki, Finland},
  series    = {LIPIcs},
  volume    = {112},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-081-1},
  isbn      = {978-3-95977-081-1},
  timestamp = {Tue, 14 Aug 2018 17:16:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2018,
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-086-6},
  isbn      = {978-3-95977-086-6},
  timestamp = {Tue, 28 Aug 2018 09:18:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2018,
  editor    = {Andreas Brandst{\"{a}}dt and
               Ekkehard K{\"{o}}hler and
               Klaus Meer},
  title     = {Graph-Theoretic Concepts in Computer Science - 44th International
               Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11159},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-00256-5},
  doi       = {10.1007/978-3-030-00256-5},
  isbn      = {978-3-030-00255-8},
  timestamp = {Mon, 03 Sep 2018 16:21:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2017,
  editor    = {T. V. Gopal and
               Gerhard J{\"{a}}ger and
               Silvia Steila},
  title     = {Theory and Applications of Models of Computation - 14th Annual Conference,
               {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10185},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-55911-7},
  doi       = {10.1007/978-3-319-55911-7},
  isbn      = {978-3-319-55910-0},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier