Till Fluschnik
Orcid: 0000-0003-2203-4386Affiliations:
- HU Berlin, Germany
- TU Clausthal, Germany
According to our database1,
Till Fluschnik
authored at least 46 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
9
10
1
2
1
2
7
7
3
1
2
1
2
4
2
2
2
3
2
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Theory Comput. Syst., October, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Algorithmica, July, 2023
Discret. Appl. Math., March, 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023
2022
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
2021
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Theor. Comput. Sci., 2020
Networks, 2020
Networks, 2020
J. Comput. Syst. Sci., 2020
On the computational complexity of length- and neighborhood-constrained path problems.
Inf. Process. Lett., 2020
Comput., 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
2019
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths.
Networks, 2019
J. Comput. Syst. Sci., 2019
Data Min. Knowl. Discov., 2019
CoRR, 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discret. Optim., 2018
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
Proceedings of the Sailing Routes in the World of Computation, 2018
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018
2017
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
2016
The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Percolation Perspective.
ISPRS Int. J. Geo Inf., 2016
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016