Follow
Till Fluschnik
Till Fluschnik
TU Clausthal
Verified email at tu-clausthal.de
Title
Cited by
Cited by
Year
City density and CO2 efficiency
R Gudipudi, T Fluschnik, AGC Ros, C Walther, JP Kropp
Energy Policy 91, 352-361, 2016
1272016
The complexity of finding small separators in temporal graphs
P Zschoche, T Fluschnik, H Molter, R Niedermeier
Journal of Computer and System Sciences 107, 72-92, 2020
1052020
Fair knapsack
T Fluschnik, P Skowron, M Triphaus, K Wilker
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1941-1948, 2019
742019
Temporal graph classes: A view through temporal separators
T Fluschnik, H Molter, R Niedermeier, M Renken, P Zschoche
Theoretical Computer Science 806, 197-218, 2020
722020
The size distribution, scaling properties and spatial organization of urban clusters: a global and regional percolation perspective
T Fluschnik, S Kriewald, A García Cantú Ros, B Zhou, DE Reusser, ...
ISPRS International Journal of Geo-Information 5 (7), 110, 2016
522016
Exact mean computation in dynamic time warping spaces
M Brill, T Fluschnik, V Froese, B Jain, R Niedermeier, D Schultz
Data Mining and Knowledge Discovery 33, 252-291, 2019
482019
Multistage vertex cover
T Fluschnik, R Niedermeier, V Rohm, P Zschoche
Theory of Computing Systems 66 (2), 454-483, 2022
382022
Parameterized aspects of triangle enumeration
M Bentert, T Fluschnik, A Nichterlein, R Niedermeier
Journal of Computer and System Sciences 103, 61-77, 2019
312019
When Votes Change and Committees Should (Not).
R Bredereck, T Fluschnik, A Kaczmarczyk
IJCAI, 144-150, 2022
26*2022
Multistage st path: Confronting similarity with dissimilarity in temporal graphs
T Fluschnik, R Niedermeier, C Schubert, P Zschoche
31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020
25*2020
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
R Van Bevern, T Fluschnik, OY Tsidulko
Networks 75 (1), 34-63, 2020
23*2020
Fractals for kernelization lower bounds
T Fluschnik, D Hermelin, A Nichterlein, R Niedermeier
SIAM Journal on Discrete Mathematics 32 (1), 656-681, 2018
232018
A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
C Bazgan, T Fluschnik, A Nichterlein, R Niedermeier, M Stahlberg
Networks 73 (1), 23-37, 2019
222019
The parameterized complexity of the minimum shared edges problem
T Fluschnik, S Kratsch, R Niedermeier, M Sorge
Journal of Computer and System Sciences 106, 23-48, 2019
202019
On-approximate Data Reduction for the Rural Postman Problem
R van Bevern, T Fluschnik, OY Tsidulko
International Conference on Mathematical Optimization Theory and Operations …, 2019
20*2019
When can graph hyperbolicity be computed in linear time?
T Fluschnik, C Komusiewicz, GB Mertzios, A Nichterlein, R Niedermeier, ...
Algorithmica 81, 2016-2045, 2019
202019
As time goes by: reflections on treewidth for temporal graphs
T Fluschnik, H Molter, R Niedermeier, M Renken, P Zschoche
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender …, 2020
192020
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
R van Bevern, T Fluschnik, GB Mertzios, H Molter, M Sorge, O Suchý
Discrete Optimization 30, 20-50, 2018
15*2018
A multistage view on 2-satisfiability
T Fluschnik
International Conference on Algorithms and Complexity, 231-244, 2021
112021
Diminishable parameterized problems and strict polynomial kernelization
H Fernau, T Fluschnik, D Hermelin, A Krebs, H Molter, R Niedermeier
Computability 9 (1), 1-24, 2020
112020
The system can't perform the operation now. Try again later.
Articles 1–20