Till Fluschnik

ScholarGPS® ID: 80513753728009

Affiliation

Technical University of Berlin, Berlin, Germany

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Graph Theory | Mathematical Optimization | Collision | Data Mining

Metrics Summary

Publication Count

Predicted Citations

454

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Placing Green Bridges Optimally, with a Multivariate Analysis (journal article) Fluschnik, Till \| Kellerhals, Leon Theory of Computing Systems (2024). 10.1007/s00224-023-10157-5 Cite \| Source
Efficiently Computing Smallest Agreeable Sets (book chapter) In ECAI 2023 Bredereck, Robert \| Fluschnik, Till \| Talmon, Nimrod IOS Press (2023) 10.3233/FAIA230285 Cite \| Source
Multistage s–t Path: Confronting Similarity with Dissimilarity (journal article) Fluschnik, Till \| Niedermeier, Rolf \| Schubert, Carsten \| Zschoche, Philipp Algorithmica, volume 85, issue 7, pages 2028-2064 (2023). 10.1007/s00453-022-01077-w Cite \| Source
Polynomial-time data reduction for weighted problems beyond additive goal functions (journal article) Bentert, Matthias \| van Bevern, René \| Fluschnik, Till \| Nichterlein, André \| Niedermeier, Rolf Discrete Applied Mathematics, volume 328 (2023). 10.1016/j.dam.2022.11.018 Cite \| Source
Placing Green Bridges Optimally, with Habitats Inducing Cycles (conference) Herkenrath, Maike \| Fluschnik, Till \| Grothe, Francesco \| Kellerhals, Leon Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22} (2022) Vienna, Austria 10.24963/ijcai.2022/531 Cited by (2) \| Cite \| Source
Multistage Vertex Cover (journal article) Fluschnik, Till \| Niedermeier, Rolf \| Rohm, Valentin \| Zschoche, Philipp Theory of Computing Systems, volume 66, issue 2, pages 454-483 (2022). 10.1007/s00224-022-10069-w Cited by (5) \| Cite \| Source
Feedback Vertex Set on Hamiltonian Graphs (book chapter) In Graph-Theoretic Concepts in Computer Science Cavallaro, Dario \| Fluschnik, Till Springer International Publishing (2021) 10.1007/978-3-030-86838-3_16 Cited by (1) \| Cite \| Source
Placing Green Bridges Optimally, with a Multivariate Analysis (book chapter) In Connecting with Computability Fluschnik, Till \| Kellerhals, Leon Springer International Publishing (2021) 10.1007/978-3-030-80049-9_19 Cite \| Source
A Multistage View on 2-Satisfiability (book chapter) In Algorithms and Complexity Fluschnik, Till Springer International Publishing (2021) 10.1007/978-3-030-75242-2_16 Cited by (5) \| Cite \| Source
On approximate data reduction for the Rural Postman Problem: Theory and experiments (journal article) van Bevern, René \| Fluschnik, Till \| Tsidulko, Oxana Yu. Networks, volume 76, issue 4, pages 485-508 (2020). 10.1002/net.21985 Cited by (8) \| Cite \| Source
On the computational complexity of length- and neighborhood-constrained path problems (journal article) Luckow, Max-Jonathan \| Fluschnik, Till Information Processing Letters, volume 156 (2020). 10.1016/j.ipl.2019.105913 Cited by (3) \| Cite \| Source
Diminishable parameterized problems and strict polynomial kernelization (journal article) Fernau, Henning \| Fluschnik, Till \| Hermelin, Danny \| Krebs, Andreas \| Molter, Hendrik \| Niedermeier, Rolf Computability (2020). 10.3233/COM-180220 Cited by (1) \| Cite \| Source
The complexity of finding small separators in temporal graphs (journal article) Zschoche, Philipp \| Fluschnik, Till \| Molter, Hendrik \| Niedermeier, Rolf Journal of Computer and System Sciences, volume 107 (2020). 10.1016/j.jcss.2019.07.006 Cited by (50) \| Cite \| Source
Temporal graph classes: A view through temporal separators (journal article) Fluschnik, Till \| Molter, Hendrik \| Niedermeier, Rolf \| Renken, Malte \| Zschoche, Philipp Theoretical Computer Science, volume 806 (2020). 10.1016/j.tcs.2019.03.031 Cited by (32) \| Cite \| Source
As Time Goes By: Reflections on Treewidth for Temporal Graphs (book chapter) In Treewidth, Kernels, and Algorithms Fluschnik, Till \| Molter, Hendrik \| Niedermeier, Rolf \| Renken, Malte \| Zschoche, Philipp Springer International Publishing (2020) 10.1007/978-3-030-42071-0_6 Cited by (8) \| Cite \| Source
Parameterized algorithms and data reduction for the short secluded s ‐ t ‐path problem (journal article) van Bevern, René \| Fluschnik, Till \| Tsidulko, Oxana Yu. Networks, volume 75, issue 1, pages 34-63 (2020). 10.1002/net.21904 Cited by (5) \| Cite \| Source
The parameterized complexity of the minimum shared edges problem (journal article) Fluschnik, Till \| Kratsch, Stefan \| Niedermeier, Rolf \| Sorge, Manuel Journal of Computer and System Sciences, volume 106 (2019). 10.1016/j.jcss.2018.12.002 Cited by (3) \| Cite \| Source
Parameterized aspects of triangle enumeration (journal article) Bentert, Matthias \| Fluschnik, Till \| Nichterlein, André \| Niedermeier, Rolf Journal of Computer and System Sciences, volume 103 (2019). 10.1016/j.jcss.2019.02.004 Cited by (9) \| Cite \| Source
The complexity of routing with collision avoidance (journal article) Fluschnik, Till \| Morik, Marco \| Sorge, Manuel Journal of Computer and System Sciences, volume 102 (2019). 10.1016/j.jcss.2019.01.001 Cited by (4) \| Cite \| Source
When Can Graph Hyperbolicity be Computed in Linear Time? (journal article) Fluschnik, Till \| Komusiewicz, Christian \| Mertzios, George B. \| Nichterlein, André \| Niedermeier, Rolf \| Talmon, Nimrod Algorithmica, volume 81, issue 5, pages 2016-2045 (2019). 10.1007/s00453-018-0522-6 Cited by (2) \| Cite \| Source