default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTill Fluschnik
Person information
- affiliation: HU Berlin, Germany
- affiliation: TU Clausthal, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. Theory Comput. Syst. 68(5): 1312-1338 (2024)- [c28]Till Fluschnik, Leon Kellerhals, Malte Renken:
Locally Rainbow Paths. AAAI 2024: 8013-8021 - [i33]Till Fluschnik, Leon Kellerhals, Malte Renken:
Locally Rainbow Paths. CoRR abs/2402.12905 (2024) - 2023
- [j18]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
:
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85(7): 2028-2064 (2023) - [j17]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023) - [c27]Robert Bredereck, Till Fluschnik, Nimrod Talmon:
Efficiently Computing Smallest Agreeable Sets. ECAI 2023: 311-318 - [c26]Eva Michelle Deltl, Till Fluschnik, Robert Bredereck:
Algorithmics of Egalitarian versus Equitable Sequences of Committees. IJCAI 2023: 2651-2658 - [i32]Eva Michelle Deltl, Till Fluschnik, Robert Bredereck:
Algorithmics of Egalitarian versus Equitable Sequences of Committees. CoRR abs/2306.14850 (2023) - 2022
- [j16]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. Theory Comput. Syst. 66(2): 454-483 (2022) - [c25]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
When Votes Change and Committees Should (Not). IJCAI 2022: 144-150 - [c24]Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals:
Placing Green Bridges Optimally, with Habitats Inducing Cycles. IJCAI 2022: 3825-3831 - [c23]Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND 2022: 16:1-16:18 - [c22]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT 2022: 29:1-29:19 - [i31]Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals:
Placing Green Bridges Optimally, with Habitats Inducing Cycles. CoRR abs/2201.12273 (2022) - 2021
- [c21]Till Fluschnik:
A Multistage View on 2-Satisfiability. CIAC 2021: 231-244 - [c20]Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. CiE 2021: 204-216 - [c19]Dario Cavallaro, Till Fluschnik:
Feedback Vertex Set on Hamiltonian Graphs. WG 2021: 207-218 - [i30]Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. CoRR abs/2102.04539 (2021) - [i29]Dario Cavallaro, Till Fluschnik:
Feedback Vertex Set on Hamiltonian Graphs. CoRR abs/2104.05322 (2021) - [i28]Dario Cavallaro, Till Fluschnik:
3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs. CoRR abs/2104.08470 (2021) - [i27]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR abs/2107.04321 (2021) - [i26]Till Fluschnik, Klaus Heeger, Danny Hermelin:
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR abs/2110.03279 (2021) - [i25]Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. CoRR abs/2111.09049 (2021) - 2020
- [j15]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j14]Max-Jonathan Luckow, Till Fluschnik:
On the computational complexity of length- and neighborhood-constrained path problems. Inf. Process. Lett. 156: 105913 (2020) - [j13]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) - [j12]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks 75(1): 34-63 (2020) - [j11]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76(4): 485-508 (2020) - [j10]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806: 197-218 (2020) - [c18]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms 2020: 49-77 - [c17]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC 2020: 43:1-43:16 - [i24]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR abs/2002.07569 (2020) - [i23]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) - [i22]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
Multistage Committee Election. CoRR abs/2005.02300 (2020) - [i21]Till Fluschnik:
A Multistage View on 2-Satisfiability. CoRR abs/2011.02325 (2020)
2010 – 2019
- 2019
- [j9]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019) - [j8]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. 33(1): 252-291 (2019) - [j7]Till Fluschnik, Marco Morik, Manuel Sorge:
The complexity of routing with collision avoidance. J. Comput. Syst. Sci. 102: 69-86 (2019) - [j6]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103: 61-77 (2019) - [j5]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106: 23-48 (2019) - [j4]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73(1): 23-37 (2019) - [c16]Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker:
Fair Knapsack. AAAI 2019: 1941-1948 - [c15]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. IPEC 2019: 14:1-14:14 - [c14]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR 2019: 279-294 - [i20]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. CoRR abs/1906.00659 (2019) - [i19]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR abs/1910.00277 (2019) - 2018
- [j3]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30: 20-50 (2018) - [j2]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32(1): 656-681 (2018) - [c13]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS 2018: 10:1-10:19 - [c12]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c11]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE 2018: 183-193 - [c10]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Complexity of Finding Small Separators in Temporal Graphs. MFCS 2018: 45:1-45:17 - [c9]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. SDM 2018: 540-548 - [c8]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. WG 2018: 216-227 - [i18]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. CoRR abs/1803.00882 (2018) - [i17]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR abs/1804.09155 (2018) - [i16]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
Parameterized algorithms and data reduction for safe convoy routing. CoRR abs/1806.09540 (2018) - [i15]Max-Jonathan Luckow, Till Fluschnik:
On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems. CoRR abs/1808.02359 (2018) - [i14]René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR abs/1812.10131 (2018) - 2017
- [c7]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. FCT 2017: 96-110 - [c6]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. FCT 2017: 257-270 - [c5]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [c4]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-Like Graphs. WG 2017: 249-262 - [i13]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i12]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. CoRR abs/1702.06548 (2017) - [i11]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-like Graphs. CoRR abs/1703.02332 (2017) - [i10]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. CoRR abs/1705.03673 (2017) - [i9]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR abs/1710.07601 (2017) - [i8]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1710.08937 (2017) - [i7]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR abs/1711.00963 (2017) - [i6]Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker:
Fair Knapsack. CoRR abs/1711.04520 (2017) - 2016
- [j1]Till Fluschnik, Steffen Kriewald, Anselmo García Cantú Ros, Bin Zhou, Dominik Reusser, Jürgen P. Kropp, Diego Rybski:
The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Percolation Perspective. ISPRS Int. J. Geo Inf. 5(7): 110 (2016) - [c3]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP 2016: 25:1-25:14 - [c2]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [i5]Till Fluschnik, Manuel Sorge:
The Minimum Shared Edges Problem on Planar Graphs. CoRR abs/1602.01385 (2016) - [i4]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR abs/1602.01739 (2016) - [i3]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - [i2]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - 2015
- [c1]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS 2015: 448-462 - [i1]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR abs/1512.00333 (2015)
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 2025-01-20 23:03 CET 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:
