No. Title Author Year
1 Covering Many (Or Few) Edges with k Vertices in Sparse Graphs Koana, Tomohiro et al. 2022
2 The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing Kellerhals, Leon et al. 2021
3 Using a Geometric Lens to Find k Disjoint Shortest Paths Bentert, Matthias et al. 2021
4 An Adaptive Version of Brandes' Algorithm for Betweenness Centrality Bentert, Matthias et al. 2018
5 Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments Korenwein, Viatcheslav et al. 2018
6 Parameterized Dynamic Cluster Editing Luo, Junjie et al. 2018
7 A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs Bredereck, Robert et al. 2017
8 The Power of Linear-Time Data Reduction for Maximum Matching Mertzios, George B. et al. 2017
9 Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems Fluschnik, Till et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9


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