No. Title Author Year
1 Solving Edge Clique Cover Exactly via Synergistic Data Reduction Hevia, Anthony et al. 2023
2 The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set GroƟmann, Ernestine et al. 2022
3 Finding All Global Minimum Cuts in Practice Henzinger, Monika et al. 2020
4 Simultaneous Representation of Proper and Unit Interval Graphs Rutter, Ignaz et al. 2019
5 On Romeo and Juliet Problems: Minimizing Distance-to-Sight Ahn, Hee-Kap et al. 2018
6 Listing all maximal cliques in sparse graphs in near-optimal time Eppstein, David et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 6


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