Till Fluschnik

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 79

Top Topics

Parameterized Complexity

Top Venues

J. Comput. Syst. Sci.

Publications

Till Fluschnik, Leon Kellerhals, Malte Renken
Locally Rainbow Paths. CoRR (2024)
Till Fluschnik, Leon Kellerhals, Malte Renken
Locally Rainbow Paths. AAAI (2024)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85 (7) (2023)
Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
Algorithmics of Egalitarian versus Equitable Sequences of Committees. CoRR (2023)
Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
Algorithmics of Egalitarian versus Equitable Sequences of Committees. IJCAI (2023)
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 (2023)
Robert Bredereck, Till Fluschnik, Nimrod Talmon
Efficiently Computing Smallest Agreeable Sets. ECAI (2023)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. Theory Comput. Syst. 66 (2) (2022)
Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
When Votes Change and Committees Should (Not). IJCAI (2022)
Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals
Placing Green Bridges Optimally, with Habitats Inducing Cycles. IJCAI (2022)
Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals
Placing Green Bridges Optimally, with Habitats Inducing Cycles. CoRR (2022)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT (2022)
Till Fluschnik, Pascal Kunz
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND (2022)
Till Fluschnik, Leon Kellerhals
Placing Green Bridges Optimally, with a Multivariate Analysis. CoRR (2021)
Dario Cavallaro, Till Fluschnik
Feedback Vertex Set on Hamiltonian Graphs. WG (2021)
Till Fluschnik, Leon Kellerhals
Placing Green Bridges Optimally, with a Multivariate Analysis. CiE (2021)
Dario Cavallaro, Till Fluschnik
3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs. CoRR (2021)
Till Fluschnik
A Multistage View on 2-Satisfiability. CIAC (2021)
Till Fluschnik, Pascal Kunz
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. CoRR (2021)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR (2021)
Dario Cavallaro, Till Fluschnik
Feedback Vertex Set on Hamiltonian Graphs. CoRR (2021)
Till Fluschnik, Klaus Heeger, Danny Hermelin
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR (2021)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR (2020)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks 76 (4) (2020)
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)
Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
Multistage Committee Election. CoRR (2020)
Max-Jonathan Luckow, Till Fluschnik
On the computational complexity of length- and neighborhood-constrained path problems. Inf. Process. Lett. 156 (2020)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC (2020)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR (2020)
Till Fluschnik
A Multistage View on 2-Satisfiability. CoRR (2020)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107 (2020)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9 (1) (2020)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806 (2020)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks 75 (1) (2020)
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) (2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. IPEC (2019)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106 (2019)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103 (2019)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR (2019)
Till Fluschnik, Marco Morik, Manuel Sorge
The complexity of routing with collision avoidance. J. Comput. Syst. Sci. 102 (2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. CoRR (2019)
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) (2019)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR (2019)
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) (2019)
Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker
Fair Knapsack. AAAI (2019)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. WG (2018)
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 (2018)
Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
Exact Mean Computation in Dynamic Time Warping Spaces. SDM (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Parameterized algorithms and data reduction for safe convoy routing. CoRR (2018)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE (2018)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. CoRR (2018)
Max-Jonathan Luckow, Till Fluschnik
On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems. CoRR (2018)
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR (2018)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32 (1) (2018)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE (2018)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Complexity of Finding Small Separators in Temporal Graphs. MFCS (2018)
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 (2018)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. FCT (2017)
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
The Minimum Shared Edges Problem on Grid-like Graphs. CoRR (2017)
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
The Minimum Shared Edges Problem on Grid-Like Graphs. WG (2017)
Till Fluschnik, Marco Morik, Manuel Sorge
The Complexity of Routing with Few Collisions. CoRR (2017)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR (2017)
Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker
Fair Knapsack. CoRR (2017)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR (2017)
Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When can Graph Hyperbolicity be computed in Linear Time? CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS (2017)
Till Fluschnik, Marco Morik, Manuel Sorge
The Complexity of Routing with Few Collisions. FCT (2017)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. CoRR (2017)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP (2016)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. CoRR (2016)
Till Fluschnik, Manuel Sorge
The Minimum Shared Edges Problem on Planar Graphs. CoRR (2016)
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) (2016)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. IPEC (2016)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS (2015)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR (2015)