Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. - Till Fluschnik; Danny Hermelin; André Nichterlein; Rolf Niedermeier (ICALP, 2016)

Finding Secluded Places of Special Interest in Graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (IPEC, 2016)

The Minimum Shared Edges Problem on Planar Graphs. - Till Fluschnik; Manuel Sorge (CoRR, 2016)

The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Percolation Perspective. - Till Fluschnik; Steffen Kriewald; Anselmo García Cantú Ros; Bin Zhou; Dominik Reusser; Jürgen P. Kropp; Diego Rybski (ISPRS Int. J. Geo Inf., 2016)

The Complexity of Routing with Few Collisions. - Till Fluschnik; Marco Morik; Manuel Sorge (FCT, 2017)

The Minimum Shared Edges Problem on Grid-Like Graphs. - Till Fluschnik; Meike Hatzel; Steffen Härtlein; Hendrik Molter; Henning Seidler (WG, 2017)

The Computational Complexity of Finding Separators in Temporal Graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (CoRR, 2017)

Parameterized Algorithms and Data Reduction for Safe Convoy Routing. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (ATMOS, 2018)

Kernelization Lower Bounds for Finding Constant-Size Subgraphs. - Till Fluschnik; George B. Mertzios; André Nichterlein (CiE, 2018)

Temporal Graph Classes: A View Through Temporal Separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Philipp Zschoche (WG, 2018)

On (1+ε)-approximate problem kernels for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (CoRR, 2018)

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Discret. Optim., 2018)

Fractals for Kernelization Lower Bounds. - Till Fluschnik; Danny Hermelin; André Nichterlein; Rolf Niedermeier (SIAM J. Discret. Math., 2018)

Fair Knapsack. - Till Fluschnik; Piotr Skowron 001; Mervin Triphaus; Kai Wilker (AAAI, 2019)

On (1+ varepsilon ) -approximate Data Reduction for the Rural Postman Problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (MOTOR, 2019)

When Can Graph Hyperbolicity be Computed in Linear Time? - Till Fluschnik; Christian Komusiewicz; George B. Mertzios; André Nichterlein; Rolf Niedermeier; Nimrod Talmon (Algorithmica, 2019)

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (CoRR, 2019)

Exact mean computation in dynamic time warping spaces. - Markus Brill; Till Fluschnik; Vincent Froese; Brijnesh J. Jain; Rolf Niedermeier; David Schultz (Data Min. Knowl. Discov., 2019)

Parameterized aspects of triangle enumeration. - Matthias Bentert; Till Fluschnik; André Nichterlein; Rolf Niedermeier (J. Comput. Syst. Sci., 2019)

The parameterized complexity of the minimum shared edges problem. - Till Fluschnik; Stefan Kratsch; Rolf Niedermeier; Manuel Sorge (J. Comput. Syst. Sci., 2019)

The complexity of routing with collision avoidance. - Till Fluschnik; Marco Morik; Manuel Sorge (J. Comput. Syst. Sci., 2019)

A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. - Cristina Bazgan; Till Fluschnik; André Nichterlein; Rolf Niedermeier; Maximilian Stahlberg (Networks, 2019)

As Time Goes By: Reflections on Treewidth for Temporal Graphs. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Treewidth, Kernels, and Algorithms, 2020)

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. - Till Fluschnik; Rolf Niedermeier; Carsten Schubert; Philipp Zschoche (ISAAC, 2020)

Diminishable parameterized problems and strict polynomial kernelization. - Henning Fernau; Till Fluschnik; Danny Hermelin; Andreas Krebs; Hendrik Molter; Rolf Niedermeier (Comput., 2020)

Multistage Committee Election. - Robert Bredereck; Till Fluschnik; Andrzej Kaczmarczyk 001 (CoRR, 2020)

On the computational complexity of length- and neighborhood-constrained path problems. - Max-Jonathan Luckow; Till Fluschnik (Inf. Process. Lett., 2020)

The complexity of finding small separators in temporal graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (J. Comput. Syst. Sci., 2020)

Parameterized algorithms and data reduction for the short secluded s-t-path problem. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

On approximate data reduction for the Rural Postman Problem: Theory and experiments. - René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko (Networks, 2020)

Temporal graph classes: A view through temporal separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Theor. Comput. Sci., 2020)

A Multistage View on 2-Satisfiability. - Till Fluschnik (CIAC, 2021)

Feedback Vertex Set on Hamiltonian Graphs. - Dario Cavallaro; Till Fluschnik (WG, 2021)

3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs. - Dario Cavallaro; Till Fluschnik (CoRR, 2021)

Polynomial Turing Kernels for Clique with an Optimal Number of Queries. - Till Fluschnik; Klaus Heeger; Danny Hermelin (CoRR, 2021)

When Votes Change and Committees Should (Not). - Robert Bredereck; Till Fluschnik; Andrzej Kaczmarczyk 001 (IJCAI, 2022)

Placing Green Bridges Optimally, with Habitats Inducing Cycles. - Maike Herkenrath; Till Fluschnik; Francesco Grothe; Leon Kellerhals (IJCAI, 2022)

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. - Till Fluschnik; Pascal Kunz 001 (SAND, 2022)

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. - Pascal Kunz 001; Till Fluschnik; Rolf Niedermeier; Malte Renken (SWAT, 2022)

Multistage Vertex Cover. - Till Fluschnik; Rolf Niedermeier; Valentin Rohm; Philipp Zschoche (Theory Comput. Syst., 2022)

Efficiently Computing Smallest Agreeable Sets. - Robert Bredereck; Till Fluschnik; Nimrod Talmon (ECAI, 2023)

Algorithmics of Egalitarian versus Equitable Sequences of Committees. - Eva Michelle Deltl; Till Fluschnik; Robert Bredereck (IJCAI, 2023)

Polynomial-time data reduction for weighted problems beyond additive goal functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (Discret. Appl. Math., 2023)

Multistage s-t Path: Confronting Similarity with Dissimilarity. - Till Fluschnik; Rolf Niedermeier; Carsten Schubert; Philipp Zschoche (Algorithmica, 2023)

Locally Rainbow Paths. - Till Fluschnik; Leon Kellerhals; Malte Renken (AAAI, 2024)

Placing Green Bridges Optimally, with a Multivariate Analysis. - Till Fluschnik; Leon Kellerhals (Theory Comput. Syst., 2024)

Properties of Egalitarian Sequences of Committees: Theory and Experiments. - Paula Böhm; Robert Bredereck; Till Fluschnik (CoRR, 2025)