No. Title Author Year
1 Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring Fluschnik, Till et al. 2022
2 Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives Kunz, Pascal et al. 2022
3 Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs Fluschnik, Till et al. 2020
4 Multistage Vertex Cover Fluschnik, Till et al. 2019
5 Parameterized Algorithms and Data Reduction for Safe Convoy Routing van Bevern, René et al. 2018
6 The Complexity of Finding Small Separators in Temporal Graphs Zschoche, Philipp et al. 2018
7 Finding Secluded Places of Special Interest in Graphs van Bevern, René et al. 2017
8 Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems Fluschnik, Till et al. 2016
9 The Parameterized Complexity of the Minimum Shared Edges Problem Fluschnik, Till et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI