Till Fluschnik

Orcid: 0000-0003-2203-4386

Affiliations:
  • HU Berlin, Germany
  • TU Clausthal, Germany


According to our database1, Till Fluschnik authored at least 46 papers between 2016 and 2024.

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
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Placing Green Bridges Optimally, with a Multivariate Analysis.
Theory Comput. Syst., October, 2024

Locally Rainbow Paths.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Multistage s-t Path: Confronting Similarity with Dissimilarity.
Algorithmica, July, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.
Discret. Appl. Math., March, 2023

Algorithmics of Egalitarian versus Equitable Sequences of Committees.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficiently Computing Smallest Agreeable Sets.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Multistage Vertex Cover.
Theory Comput. Syst., 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

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Placing Green Bridges Optimally, with Habitats Inducing Cycles.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

When Votes Change and Committees Should (Not).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Polynomial Turing Kernels for Clique with an Optimal Number of Queries.
CoRR, 2021

3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs.
CoRR, 2021

Feedback Vertex Set on Hamiltonian Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

A Multistage View on 2-Satisfiability.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Temporal graph classes: A view through temporal separators.
Theor. Comput. Sci., 2020

On approximate data reduction for the Rural Postman Problem: Theory and experiments.
Networks, 2020

Parameterized algorithms and data reduction for the short secluded s-t-path problem.
Networks, 2020

The complexity of finding small separators in temporal graphs.
J. Comput. Syst. Sci., 2020

On the computational complexity of length- and neighborhood-constrained path problems.
Inf. Process. Lett., 2020

Multistage Committee Election.
CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.
Comput., 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.
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

The complexity of routing with collision avoidance.
J. Comput. Syst. Sci., 2019

The parameterized complexity of the minimum shared edges problem.
J. Comput. Syst. Sci., 2019

Parameterized aspects of triangle enumeration.
J. Comput. Syst. Sci., 2019

Exact mean computation in dynamic time warping spaces.
Data Min. Knowl. Discov., 2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.
CoRR, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?
Algorithmica, 2019

On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Fair Knapsack.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Fractals for Kernelization Lower Bounds.
SIAM J. Discret. Math., 2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discret. Optim., 2018

On (1+ε)-approximate problem kernels for the Rural Postman Problem.
CoRR, 2018

Temporal Graph Classes: A View Through Temporal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Kernelization Lower Bounds for Finding Constant-Size Subgraphs.
Proceedings of the Sailing Routes in the World of Computation, 2018

Parameterized Algorithms and Data Reduction for Safe Convoy Routing.
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

2017
The Computational Complexity of Finding Separators in Temporal Graphs.
CoRR, 2017

The Minimum Shared Edges Problem on Grid-Like Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

The Complexity of Routing with Few Collisions.
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

The Minimum Shared Edges Problem on Planar Graphs.
CoRR, 2016

Finding Secluded Places of Special Interest in Graphs.
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


  Loading...