Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Philipp Zschoche
@article{DBLP:journals/mst/FroeseKZ24,
author = {Vincent Froese and
Pascal Kunz and
Philipp Zschoche},
title = {Disentangling the Computational Complexity of Network Untangling},
journal = {Theory Comput. Syst.},
volume = {68},
number = {1},
pages = {103--121},
year = {2024},
url = {https://doi.org/10.1007/s00224-023-10150-y},
doi = {10.1007/S00224-023-10150-Y},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FroeseKZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/KlobasMMNZ23,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
title = {Interference-free walks in time: temporally disjoint paths},
journal = {Auton. Agents Multi Agent Syst.},
volume = {37},
number = {1},
pages = {1},
year = {2023},
url = {https://doi.org/10.1007/s10458-022-09583-5},
doi = {10.1007/S10458-022-09583-5},
timestamp = {Tue, 22 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/KlobasMMNZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikNSZ23,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2028--2064},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01077-w},
doi = {10.1007/S00453-022-01077-W},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikNSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MertziosMNZZ23,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
title = {Computing maximum matchings in temporal graphs},
journal = {J. Comput. Syst. Sci.},
volume = {137},
pages = {1--19},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.04.005},
doi = {10.1016/J.JCSS.2023.04.005},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MertziosMNZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BentertNRZ23,
author = {Matthias Bentert and
Andr{\'{e}} Nichterlein and
Malte Renken and
Philipp Zschoche},
title = {Using a Geometric Lens to Find {\textbackslash}({\textbackslash}boldsymbol\{k\}{\textbackslash})-Disjoint
Shortest Paths},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {3},
pages = {1674--1703},
year = {2023},
url = {https://doi.org/10.1137/22m1527398},
doi = {10.1137/22M1527398},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BentertNRZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Zschoche23,
author = {Philipp Zschoche},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Restless Temporal Path Parameterized Above Lower Bounds},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {55:1--55:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.55},
doi = {10.4230/LIPICS.STACS.2023.55},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Zschoche23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Zschoche22,
author = {Philipp Zschoche},
title = {Parameterized algorithmics for time-evolving structures: temporalizing
and multistaging (Parametrisierte Algorithmik f{\"{u}}r zeitabh{\"{a}}ngige
Strukturen: Temporalisierung and Mehrstufigkeit)},
school = {{TU} Berlin, Germany},
year = {2022},
url = {https://depositonce.tu-berlin.de/handle/11303/17343},
doi = {10.14279/DEPOSITONCE-16124},
timestamp = {Tue, 16 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/basesearch/Zschoche22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zschoche22,
author = {Philipp Zschoche},
title = {A faster parameterized algorithm for temporal matching},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106181},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106181},
doi = {10.1016/J.IPL.2021.106181},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zschoche22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FluschnikNRZ22,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
title = {Multistage Vertex Cover},
journal = {Theory Comput. Syst.},
volume = {66},
number = {2},
pages = {454--483},
year = {2022},
url = {https://doi.org/10.1007/s00224-022-10069-w},
doi = {10.1007/S00224-022-10069-W},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FluschnikNRZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FroeseKZ22,
author = {Vincent Froese and
Pascal Kunz and
Philipp Zschoche},
editor = {Luc De Raedt},
title = {Disentangling the Computational Complexity of Network Untangling},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {2037--2043},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/283},
doi = {10.24963/IJCAI.2022/283},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FroeseKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-15862,
author = {Philipp Zschoche},
title = {Restless Temporal Path Parameterized Above Lower Bounds},
journal = {CoRR},
volume = {abs/2203.15862},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.15862},
doi = {10.48550/ARXIV.2203.15862},
eprinttype = {arXiv},
eprint = {2203.15862},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-15862.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-02668,
author = {Vincent Froese and
Pascal Kunz and
Philipp Zschoche},
title = {Disentangling the Computational Complexity of Network Untangling},
journal = {CoRR},
volume = {abs/2204.02668},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.02668},
doi = {10.48550/ARXIV.2204.02668},
eprinttype = {arXiv},
eprint = {2204.02668},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-02668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CasteigtsHMZ21,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
title = {Finding Temporal Paths Under Waiting Time Constraints},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2754--2802},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00831-w},
doi = {10.1007/S00453-021-00831-W},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CasteigtsHMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BevernTZ21,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
title = {Representative families for matroid intersections, with applications
to location, packing, and covering problems},
journal = {Discret. Appl. Math.},
volume = {298},
pages = {110--128},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.03.014},
doi = {10.1016/J.DAM.2021.03.014},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BevernTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KoanaKNNZ21,
author = {Tomohiro Koana and
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},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.3:1--1.3:30},
year = {2021},
url = {https://doi.org/10.1145/3439801},
doi = {10.1145/3439801},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KoanaKNNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KellerhalsRZ21,
author = {Leon Kellerhals and
Malte Renken and
Philipp Zschoche},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Parameterized Algorithms for Diverse Multistage Problems},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {55:1--55:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.55},
doi = {10.4230/LIPICS.ESA.2021.55},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KellerhalsRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BentertNRZ21,
author = {Matthias Bentert and
Andr{\'{e}} Nichterlein and
Malte Renken and
Philipp Zschoche},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Using a Geometric Lens to Find k Disjoint Shortest Paths},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.26},
doi = {10.4230/LIPICS.ICALP.2021.26},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BentertNRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KlobasMMNZ21,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
editor = {Zhi{-}Hua Zhou},
title = {Interference-free Walks in Time: Temporally Disjoint Paths},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {4090--4096},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/563},
doi = {10.24963/IJCAI.2021/563},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KlobasMMNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KellerhalsKNZ21,
author = {Leon Kellerhals and
Tomohiro Koana and
Andr{\'{e}} Nichterlein and
Philipp Zschoche},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {The {PACE} 2021 Parameterized Algorithms and Computational Experiments
Challenge: Cluster Editing},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.26},
doi = {10.4230/LIPICS.IPEC.2021.26},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KellerhalsKNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MertziosMRSZ21,
author = {George B. Mertzios and
Hendrik Molter and
Malte Renken and
Paul G. Spirakis and
Philipp Zschoche},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {The Complexity of Transitively Orienting Temporal Graphs},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {75:1--75:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.75},
doi = {10.4230/LIPICS.MFCS.2021.75},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MertziosMRSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MolterRZ21,
author = {Hendrik Molter and
Malte Renken and
Philipp Zschoche},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Temporal Reachability Minimization: Delaying vs. Deleting},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {76:1--76:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.76},
doi = {10.4230/LIPICS.MFCS.2021.76},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MolterRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FigielKNR0Z21,
author = {Aleksander Figiel and
Leon Kellerhals and
Rolf Niedermeier and
Matthias Rost and
Stefan Schmid and
Philipp Zschoche},
editor = {Kunal Agrawal and
Yossi Azar},
title = {Optimal Virtual Network Embeddings for Tree Topologies},
booktitle = {{SPAA} '21: 33rd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, 6-8 July, 2021},
pages = {221--231},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3409964.3461787},
doi = {10.1145/3409964.3461787},
timestamp = {Mon, 05 Jul 2021 16:19:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/FigielKNR0Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06783,
author = {George B. Mertzios and
Hendrik Molter and
Malte Renken and
Paul G. Spirakis and
Philipp Zschoche},
title = {The Complexity of Transitively Orienting Temporal Graphs},
journal = {CoRR},
volume = {abs/2102.06783},
year = {2021},
url = {https://arxiv.org/abs/2102.06783},
eprinttype = {arXiv},
eprint = {2102.06783},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-10814,
author = {Hendrik Molter and
Malte Renken and
Philipp Zschoche},
title = {Temporal Reachability Minimization: Delaying vs. Deleting},
journal = {CoRR},
volume = {abs/2102.10814},
year = {2021},
url = {https://arxiv.org/abs/2102.10814},
eprinttype = {arXiv},
eprint = {2102.10814},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-10814.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-04856,
author = {Leon Kellerhals and
Malte Renken and
Philipp Zschoche},
title = {Parameterized Algorithms for Diverse Multistage Problems},
journal = {CoRR},
volume = {abs/2105.04856},
year = {2021},
url = {https://arxiv.org/abs/2105.04856},
eprinttype = {arXiv},
eprint = {2105.04856},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-04856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-07006,
author = {Aleksander Figiel and
Leon Kellerhals and
Rolf Niedermeier and
Matthias Rost and
Stefan Schmid and
Philipp Zschoche},
title = {Optimal Virtual Network Embeddings for Tree Topologies},
journal = {CoRR},
volume = {abs/2105.07006},
year = {2021},
url = {https://arxiv.org/abs/2105.07006},
eprinttype = {arXiv},
eprint = {2105.07006},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-07006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08335,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
title = {Interference-free Walks in Time: Temporally Disjoint Paths},
journal = {CoRR},
volume = {abs/2105.08335},
year = {2021},
url = {https://arxiv.org/abs/2105.08335},
eprinttype = {arXiv},
eprint = {2105.08335},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ZschocheFMN20,
author = {Philipp Zschoche and
Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier},
title = {The complexity of finding small separators in temporal graphs},
journal = {J. Comput. Syst. Sci.},
volume = {107},
pages = {72--92},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.07.006},
doi = {10.1016/J.JCSS.2019.07.006},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ZschocheFMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FluschnikMNRZ20,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
title = {Temporal graph classes: {A} view through temporal separators},
journal = {Theor. Comput. Sci.},
volume = {806},
pages = {197--218},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.03.031},
doi = {10.1016/J.TCS.2019.03.031},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FluschnikMNRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/FluschnikMNRZ20,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {As Time Goes By: Reflections on Treewidth for Temporal Graphs},
booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
pages = {49--77},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_6},
doi = {10.1007/978-3-030-42071-0\_6},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/FluschnikMNRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CasteigtsHMZ20,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Finding Temporal Paths Under Waiting Time Constraints},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {30:1--30:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.30},
doi = {10.4230/LIPICS.ISAAC.2020.30},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CasteigtsHMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FluschnikNSZ20,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity in
Temporal Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.43},
doi = {10.4230/LIPICS.ISAAC.2020.43},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FluschnikNSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MertziosMNZZ20,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Computing Maximum Matchings in Temporal Graphs},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.27},
doi = {10.4230/LIPICS.STACS.2020.27},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MertziosMNZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07569,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity},
journal = {CoRR},
volume = {abs/2002.07569},
year = {2020},
url = {https://arxiv.org/abs/2002.07569},
eprinttype = {arXiv},
eprint = {2002.07569},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-13491,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
title = {As Time Goes By: Reflections on Treewidth for Temporal Graphs},
journal = {CoRR},
volume = {abs/2004.13491},
year = {2020},
url = {https://arxiv.org/abs/2004.13491},
eprinttype = {arXiv},
eprint = {2004.13491},
timestamp = {Sat, 02 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-13491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-12502,
author = {Matthias Bentert and
Andr{\'{e}} Nichterlein and
Malte Renken and
Philipp Zschoche},
title = {Using a geometric lens to find k disjoint shortest paths},
journal = {CoRR},
volume = {abs/2007.12502},
year = {2020},
url = {https://arxiv.org/abs/2007.12502},
eprinttype = {arXiv},
eprint = {2007.12502},
timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-12502.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-10408,
author = {Philipp Zschoche},
title = {A Faster Parameterized Algorithm for Temporal Matching},
journal = {CoRR},
volume = {abs/2010.10408},
year = {2020},
url = {https://arxiv.org/abs/2010.10408},
eprinttype = {arXiv},
eprint = {2010.10408},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-10408.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BevernTZ19,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
editor = {Pinar Heggernes},
title = {Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under
Matroid Constraints},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {62--74},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_6},
doi = {10.1007/978-3-030-17402-6\_6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BevernTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FluschnikNRZ19,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Multistage Vertex Cover},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.14},
doi = {10.4230/LIPICS.IPEC.2019.14},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/FluschnikNRZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-05304,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
title = {Computing Maximum Matchings in Temporal Graphs},
journal = {CoRR},
volume = {abs/1905.05304},
year = {2019},
url = {http://arxiv.org/abs/1905.05304},
eprinttype = {arXiv},
eprint = {1905.05304},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-05304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00659,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
title = {Multistage Vertex Cover},
journal = {CoRR},
volume = {abs/1906.00659},
year = {2019},
url = {http://arxiv.org/abs/1906.00659},
eprinttype = {arXiv},
eprint = {1906.00659},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00659.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06437,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
title = {The Computational Complexity of Finding Temporal Paths under Waiting
Time Constraints},
journal = {CoRR},
volume = {abs/1909.06437},
year = {2019},
url = {http://arxiv.org/abs/1909.06437},
eprinttype = {arXiv},
eprint = {1909.06437},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-06437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KorenweinNNZ18,
author = {Viatcheslav Korenwein and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Philipp Zschoche},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
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},
series = {LIPIcs},
volume = {112},
pages = {53:1--53:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.53},
doi = {10.4230/LIPICS.ESA.2018.53},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/KorenweinNNZ18.bib},
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},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
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}},
series = {LIPIcs},
volume = {117},
pages = {45:1--45:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.45},
doi = {10.4230/LIPICS.MFCS.2018.45},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ZschocheFMN18.bib},
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},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
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},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {216--227},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_18},
doi = {10.1007/978-3-030-00256-5\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FluschnikMNZ18.bib},
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},
eprinttype = {arXiv},
eprint = {1803.00882},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00882.bib},
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},
eprinttype = {arXiv},
eprint = {1806.09683},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09683.bib},
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},
eprinttype = {arXiv},
eprint = {1806.11527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-11527.bib},
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},
editor = {T. V. Gopal and
Gerhard J{\"{a}}ger and
Silvia Steila},
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},
series = {Lecture Notes in Computer Science},
volume = {10185},
pages = {348--361},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-55911-7\_25},
doi = {10.1007/978-3-319-55911-7\_25},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/KellerhalsKZBC17.bib},
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},
eprinttype = {arXiv},
eprint = {1701.05108},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KellerhalsKZBC17.bib},
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},
eprinttype = {arXiv},
eprint = {1711.00963},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
