No. Title Author Year
1 Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor Boneh, Itai et al. 2023
2 String Factorization via Prefix Free Families Kraus, Matan et al. 2023
3 Efficient Algorithms for Counting Gapped Palindromes Popa, Andrei et al. 2021
4 Complexity of Computing the Anti-Ramsey Numbers for Paths Akhoondian Amiri, Saeed et al. 2020
5 The b-Matching Problem in Distance-Hereditary Graphs and Beyond Ducoffe, Guillaume et al. 2018
6 The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes Ducoffe, Guillaume et al. 2018
7 Making "Fast" Atomic Operations Computationally Tractable Fernández Anta, Antonio et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 7

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