Till Fluschnik

Leon Kellerhals

Malte Renken

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Multistage s-t Path: Confronting Similarity with Dissimilarity.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2023

Algorithmics of Egalitarian versus Equitable Sequences of Committees.

[BibT_eX]

[DOI]

Eva Michelle Deltl

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficiently Computing Smallest Agreeable Sets.

[BibT_eX]

[DOI]

Nimrod Talmon

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Multistage Vertex Cover.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring.

[BibT_eX]

[DOI]

Pascal Kunz

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Placing Green Bridges Optimally, with Habitats Inducing Cycles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

When Votes Change and Committees Should (Not).

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

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

[BibT_eX]

[DOI]

Klaus Heeger

Danny Hermelin

CoRR, 2021

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

[BibT_eX]

[DOI]

Dario Cavallaro

CoRR, 2021

Feedback Vertex Set on Hamiltonian Graphs.

[BibT_eX]

[DOI]

Dario Cavallaro

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Placing Green Bridges Optimally, with a Multivariate Analysis.

[BibT_eX]

[DOI]

Leon Kellerhals

Proceedings of the Connecting with Computability, 2021

A Multistage View on 2-Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Temporal graph classes: A view through temporal separators.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

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

[BibT_eX]

[DOI]

Networks, 2020

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

[BibT_eX]

[DOI]

Networks, 2020

The complexity of finding small separators in temporal graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

On the computational complexity of length- and neighborhood-constrained path problems.

[BibT_eX]

[DOI]

Max-Jonathan Luckow

Inf. Process. Lett., 2020

Multistage Committee Election.

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.

[BibT_eX]

[DOI]

Comput., 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Networks, 2019

The complexity of routing with collision avoidance.

[BibT_eX]

[DOI]

Marco Morik

Manuel Sorge

J. Comput. Syst. Sci., 2019

The parameterized complexity of the minimum shared edges problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Parameterized aspects of triangle enumeration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Exact mean computation in dynamic time warping spaces.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?

[BibT_eX]

[DOI]

Christian Komusiewicz

Algorithmica, 2019

On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Fair Knapsack.

[BibT_eX]

[DOI]

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

2018

Fractals for Kernelization Lower Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Temporal Graph Classes: A View Through Temporal Separators.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Kernelization Lower Bounds for Finding Constant-Size Subgraphs.

[BibT_eX]

[DOI]

George B. Mertzios

André Nichterlein

Proceedings of the Sailing Routes in the World of Computation, 2018

Parameterized Algorithms and Data Reduction for Safe Convoy Routing.

[BibT_eX]

[DOI]

Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

2017

The Computational Complexity of Finding Separators in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

The Minimum Shared Edges Problem on Grid-Like Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

The Complexity of Routing with Few Collisions.

[BibT_eX]

[DOI]

Marco Morik

Manuel Sorge

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.

[BibT_eX]

[DOI]

Steffen Kriewald

Anselmo García Cantú Ros

ISPRS Int. J. Geo Inf., 2016

The Minimum Shared Edges Problem on Planar Graphs.

[BibT_eX]

[DOI]