default search action
Philipp Zschoche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. 144: 103549 (2024) - [j12]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (2024) - 2023
- [j11]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1): 1 (2023) - [j10]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
:
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85(7): 2028-2064 (2023) - [j9]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - [j8]Matthias Bentert, André Nichterlein
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023) - [c19]Philipp Zschoche:
Restless Temporal Path Parameterized Above Lower Bounds. STACS 2023: 55:1-55:16 - 2022
- [b1]Philipp Zschoche:
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging (Parametrisierte Algorithmik für zeitabhängige Strukturen: Temporalisierung and Mehrstufigkeit). TU Berlin, Germany, 2022 - [j7]Philipp Zschoche:
A faster parameterized algorithm for temporal matching. Inf. Process. Lett. 174: 106181 (2022) - [j6]Till Fluschnik
Multistage Vertex Cover. Theory Comput. Syst. 66(2): 454-483 (2022) - [c18]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. IJCAI 2022: 2037-2043 - [i19]Philipp Zschoche:
Restless Temporal Path Parameterized Above Lower Bounds. CoRR abs/2203.15862 (2022) - [i18]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. CoRR abs/2204.02668 (2022) - 2021
- [j5]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83(9): 2754-2802 (2021) - [j4]René van Bevern
Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. 298: 110-128 (2021) - [j3]Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26: 1.3:1-1.3:30 (2021) - [c17]Leon Kellerhals, Malte Renken
Parameterized Algorithms for Diverse Multistage Problems. ESA 2021: 55:1-55:17 - [c16]Matthias Bentert, André Nichterlein, Malte Renken
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP 2021: 26:1-26:14 - [c15]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096 - [c14]Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche:
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC 2021: 26:1-26:18 - [c13]George B. Mertzios, Hendrik Molter, Malte Renken
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - [c12]Hendrik Molter, Malte Renken
Temporal Reachability Minimization: Delaying vs. Deleting. MFCS 2021: 76:1-76:15 - [c11]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid
Optimal Virtual Network Embeddings for Tree Topologies. SPAA 2021: 221-231 - [i17]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i16]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal Reachability Minimization: Delaying vs. Deleting. CoRR abs/2102.10814 (2021) - [i15]Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. CoRR abs/2105.04856 (2021) - [i14]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - [i13]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - 2020
- [j2]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107: 72-92 (2020) - [j1]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806: 197-218 (2020) - [c10]Till Fluschnik
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms 2020: 49-77 - [c9]Arnaud Casteigts
Finding Temporal Paths Under Waiting Time Constraints. ISAAC 2020: 30:1-30:18 - [c8]Till Fluschnik
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC 2020: 43:1-43:16 - [c7]George B. Mertzios
Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14 - [i12]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR abs/2002.07569 (2020) - [i11]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR abs/2004.13491 (2020) - [i10]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a geometric lens to find k disjoint shortest paths. CoRR abs/2007.12502 (2020) - [i9]Philipp Zschoche:
A Faster Parameterized Algorithm for Temporal Matching. CoRR abs/2010.10408 (2020)
2010 – 2019
- 2019
- [c6]René van Bevern, Oxana Yu. Tsidulko
Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC 2019: 62-74 - [c5]Till Fluschnik
Multistage Vertex Cover. IPEC 2019: 14:1-14:14 - [i8]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i7]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. CoRR abs/1906.00659 (2019) - [i6]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR abs/1909.06437 (2019) - 2018
- [c4]Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA 2018: 53:1-53:13 - [c3]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Complexity of Finding Small Separators in Temporal Graphs. MFCS 2018: 45:1-45:17 - [c2]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. WG 2018: 216-227 - [i5]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. CoRR abs/1803.00882 (2018) - [i4]Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR abs/1806.09683 (2018) - [i3]René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR abs/1806.11527 (2018) - 2017
- [c1]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC 2017: 348-361 - [i2]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR abs/1701.05108 (2017) - [i1]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR abs/1711.00963 (2017)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 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: